# Tag Archives: Synopsys

Recently Synopsys ( Noida Center ) visited our campus for recruitment for Research and Development profile and a cg cut of 8.5 was enforced .… Read More
Given a simple expression tree, consisting of basic binary operators i.e., + , – ,* and / and some integers, evaluate the expression tree. Examples:Become… Read More
We are given two sorted arrays. We need to merge these two arrays such that the initial numbers (after complete sorting) are in the first… Read More
Given a value V, if we want to make a change for V cents, and we have an infinite supply of each of C… Read More
Recently, I was interviewed for Synopsys (R&D Engineer I). There were two telephonic rounds followed by 5 F2F rounds. 1st round(Phone Screen): 1 .Reverse a… Read More
Recently I gave interview in Synopsis for the position of R&D Engineer. These were the questions asked : 1. Round 1 : Telephonic Round       … Read More
Reached out via referral in November, team I was interviewed for develops in house software. The overall process took 2 weeks, 2 telephonic followed by… Read More
1st Round: MCQ test consisting of 60 question from Quantitative Aptitude, Logical Ability, C, C++, Algorithm, Data structures, Digital Design. 2nd Round: (20 minutes) 1.… Read More
Write a SortedMerge() function that takes two lists, each of which is sorted in increasing order, and merges the two together into one list which… Read More
A tree where no leaf is much farther away from the root than any other leaf. Different balancing schemes allow different definitions of “much farther”… Read More
There are two sorted arrays. First one is of size m+n containing only m elements. Another one is of size n and contains n elements.… Read More
Given values of two values n1 and n2 in a Binary Search Tree, find the Lowest Common Ancestor (LCA). You may assume that both… Read More
Given a binary tree, find height of it. Height of empty tree is -1, height of tree with one node is 0 and height of… Read More