Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by Synopsys Team. If you also belong to the team, you can get access from here

Synopsys Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Clear (1)

Synopsys R&D Design Engineer Interview Questions, Process, and Tips

Updated 25 Aug 2021

Synopsys R&D Design Engineer Interview Experiences

1 interview found

I applied via Referral and was interviewed before Aug 2020. There were 4 interview rounds.

Interview Questionnaire 

9 Questions

  • Q1. Find the left view of a binary tree?
  • Ans. 

    The left view of a binary tree shows the nodes that are visible when the tree is viewed from the left side.

    • Traverse the tree recursively from left to right

    • Print the first node encountered at each level

    • Example: For tree with root node A, left view is A, B, D, G

  • Answered by AI
  • Q2. What is the differnce between c and c++?
  • Ans. 

    C++ is an extension of C with object-oriented programming features.

    • C++ supports classes and objects while C does not.

    • C++ has better support for polymorphism and inheritance.

    • C++ has a standard template library (STL) for data structures and algorithms.

    • C++ allows function overloading while C does not.

    • C++ has exception handling while C does not.

  • Answered by AI
  • Q3. FInd the middle of the linked list?
  • Ans. 

    To find the middle of a linked list, use two pointers - one moving at twice the speed of the other.

    • Use two pointers - slow and fast

    • Slow pointer moves one node at a time, fast pointer moves two nodes at a time

    • When fast pointer reaches the end, slow pointer will be at the middle

  • Answered by AI
  • Q4. What are semaphores, differnce between them, Different OSI layers , deadlock protocols, ACID protocols in dbms
  • Ans. 

    Semaphores, OSI layers, deadlock and ACID protocols in DBMS

    • Semaphores are used for process synchronization and communication

    • OSI model has 7 layers: Physical, Data Link, Network, Transport, Session, Presentation, Application

    • Deadlock protocols prevent processes from entering a deadlock state

    • ACID protocols ensure database transactions are reliable and consistent

  • Answered by AI
  • Q5. Find the boundary traversal of a binary tree?
  • Ans. 

    Boundary traversal of a binary tree is the process of visiting the nodes on the boundary of the tree.

    • Start with the root node and traverse the left boundary nodes from top to bottom.

    • Traverse the leaf nodes from left to right.

    • Traverse the right boundary nodes from bottom to top.

    • Exclude the leaf nodes that are already traversed in the second step.

    • Repeat the above steps for all the subtrees of the binary tree.

  • Answered by AI
  • Q6. What is the differnce between linear and non linear data structure?
  • Ans. 

    Linear data structures have a sequential arrangement of elements while non-linear data structures have a hierarchical arrangement.

    • Linear data structures have a fixed number of elements and are easy to traverse.

    • Non-linear data structures have an arbitrary number of elements and are difficult to traverse.

    • Arrays, linked lists, and stacks are examples of linear data structures.

    • Trees, graphs, and heaps are examples of non-l

  • Answered by AI
  • Q7. Steps associated with client server connnection request?
  • Ans. 

    Steps for client server connection request.

    • Client sends a connection request to the server.

    • Server receives the request and sends a response.

    • Client receives the response and establishes a connection.

    • Connection is maintained until terminated by either party.

  • Answered by AI
  • Q8. Producer and consumer problem?
  • Ans. 

    Producer and consumer problem is a synchronization problem in computer science where multiple processes share a common resource.

    • It occurs when multiple processes try to access a shared resource simultaneously.

    • The producer produces data and the consumer consumes it.

    • The problem is to ensure that the producer does not produce data when the buffer is full and the consumer does not consume data when the buffer is empty.

    • Exam...

  • Answered by AI
  • Q9. Difference between process and threads?
  • Ans. 

    Processes are independent programs while threads are lightweight processes within a program.

    • Processes have their own memory space while threads share memory space.

    • Processes communicate through inter-process communication while threads communicate directly.

    • Processes are slower to create and terminate than threads.

    • Examples of processes are web browsers, word processors, etc. while examples of threads are spell checkers,

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Keep your answer to the point, Don't beat around the bushes, keep things plain and simple and be honest with your CV, many questions will be prompted from there

Skills evaluated in this interview

Interview questions from similar companies

Interview Questionnaire 

9 Questions

  • Q1. Questions related to the work done at my previous company
  • Q2. Find if a given directed graph is cyclic or not
  • Ans. 

    To check if a directed graph is cyclic or not

    • Use Depth First Search (DFS) algorithm to traverse the graph

    • Maintain a visited set to keep track of visited nodes

    • Maintain a recursion stack to keep track of nodes in the current DFS traversal

    • If a node is visited and is already in the recursion stack, then the graph is cyclic

    • If DFS traversal completes without finding a cycle, then the graph is acyclic

  • Answered by AI
  • Q3. You have a stream of bytes from which you can read one byte at a time. You only have enough space to store one byte. After processing those bytes, you have to return a random byte. Note: The probability of...
  • Ans. 

    Return a random byte from a stream of bytes with equal probability.

    • Create a variable to store the count of bytes read

    • Create a variable to store the current random byte

    • For each byte read, generate a random number between 0 and the count of bytes read

    • If the random number is 0, store the current byte as the random byte

    • Return the random byte

  • Answered by AI
  • Q4. Find if a given Binary Tree is BST or not
  • Ans. 

    Check if a binary tree is a binary search tree or not.

    • Traverse the tree in-order and check if the values are in ascending order.

    • For each node, check if its value is greater than the maximum value of its left subtree and less than the minimum value of its right subtree.

    • Use recursion to check if all nodes in the tree satisfy the above condition.

  • Answered by AI
  • Q5. Devise an algorithm to determine the Nth-to-Last element in a singly linked list of unknown length. If N = 0, then your algorithm must return the last element. You should parse the list only once
  • Ans. 

    Algorithm to find Nth-to-Last element in a singly linked list of unknown length

    • Traverse the list and maintain two pointers, one at the beginning and one at Nth node from beginning

    • Move both pointers simultaneously until the second pointer reaches the end of the list

    • The first pointer will be pointing to the Nth-to-Last element

    • If N=0, return the last element

    • Parse the list only once

  • Answered by AI
  • Q6. Given an array of integers, print all possible permutations. Also explain your approach
  • Ans. 

    Print all possible permutations of an array of integers

    • Use recursion to swap elements and generate permutations

    • Start with the first element and swap it with each subsequent element

    • Repeat the process for the remaining elements

    • Stop when all elements have been swapped with the first element

    • Print each permutation as it is generated

  • Answered by AI
  • Q7. Design a Stack DS that also prints in O(1) the minimum element you pushed in the stack
  • Ans. 

    Design a stack that prints the minimum element pushed in O(1)

    • Use two stacks, one for storing elements and another for storing minimums

    • When pushing an element, compare it with the top of minimum stack and push the smaller one

    • When popping an element, pop from both stacks

    • To get the minimum element, just return the top of minimum stack

  • Answered by AI
  • Q8. Given a linked list with loop, how would you find the starting point of the loop ?
  • Ans. 

    To find the starting point of a loop in a linked list, use Floyd's cycle-finding algorithm.

    • Use two pointers, one moving at twice the speed of the other.

    • When they meet, move one pointer to the head of the list and keep the other at the meeting point.

    • Move both pointers one step at a time until they meet again, which is the starting point of the loop.

  • Answered by AI
  • Q9. Find a number a matrix mat[m][n] where all the rows and columns are sorted non-decreasingly. What will be the complexity of the solution
  • Ans. 

    To find a number in a matrix where all rows and columns are sorted non-decreasingly. Complexity of the solution.

    • Use binary search to find the number in each row and column

    • Start from the top-right corner or bottom-left corner to optimize search

    • Time complexity: O(m log n) or O(n log m) depending on the starting corner

  • Answered by AI

Interview Preparation Tips

Skills: Algorithm, Data structure
College Name: Na

Skills evaluated in this interview

Interview Questionnaire 

3 Questions

  • Q1. Asked me about my answer for a question in the logical test and asked me to find mistake
  • Q2. Some tree question
  • Q3. Some array question

Interview Preparation Tips

Round: Test
Experience: Just logical questions. Maybe create a DFA and NFA.
Duration: 1 hour
Total Questions: 20

Round: Coding
Experience: Given two questions. Each question is written like a story, but once you get the idea, it will be a simple question

College Name: Govt. Model Engineering College

I applied via Campus Placement

Interview Questionnaire 

3 Questions

  • Q1. They asked me optimise the code I had written for the first question
  • Q2. Given a binary tree, find out the maximum sum path from root to leaf. This problem, but they said tree has only positive integers. -----/ . To store the path I had used global array. They asked me alternat...
  • Q3. Given a list of words. Given three operations find out the minimum steps to reach from source string to destination string. Basically, -----/ this is the problem with some modification. For this question I...
  • Ans. 

    The question is about finding the minimum steps to reach from a source string to a destination string using three operations.

    • BFS and DFS are graph traversal techniques that can be used to solve this problem.

    • BFS is typically used when finding the shortest path or exploring all possible paths in a graph.

    • DFS is useful when searching for a specific path or exploring deeply into a graph.

    • In this case, BFS can be used to find...

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: • 1 question was on time complexity of searching an unsorted array.
• 2 questions were on recursion, ie, number of recursive calls.
• 1 question on analysing given function on string.
• 1 question was on probability(Two hotels, say A and B. Probability of moving from A to B is 2/3, staying at A is 1/3. Probability of moving from B to A and staying at B is 1/2. If they make decisions each hour, and if they were at A at 7:00 pm, what is the probability that they will be at B at 10:00 pm).
• If a set has elements {1,2,3,4 .... n}. Then what is the sum of elements of it's power set. (Ex: S = {1,2}. Then power set is {{},{1},{2},{1,2}}. The sum is 6.
• If a set has elements {1,2,3,4,5,6,7,8,9,10}. Then how many subsets of 3 elements has no consecutive elements.
• 1 question was on designing a DFA for a string starting with a and ending with c and has at least b in it.
• 1 question had machine instructions. We had to find out minimum number of cycles needed to execute the given set of instructions. (a) If the instructions are executed in the given order. (b) If the instructions are executed in random order.
• 1 puzzle on bridges.

Tips: In this round they not only see the answer. They also verify how you approached(So, give correct explanation to your answers).
Duration: 90 minutes
Total Questions: 10

Round: Coding Round
Experience: Two questions were there. 3 hours duration.

1. Long question, I don't remember fully. I'll just give input/output examples. It was basically on string decoding. If jon2snow3 is there the decoded string will be jonjonsnowjonjonsnowjonjonsnow. Given a string and an integer k we have print the kth character in the decoded string
input:
jon2snow3
8
output:
n

2. Given an array and an integer k return the number of contiguous sub arrays whose sum is divisible by k.
input format:
n k

input:
4 5
10 0 4 5

output:
4

explaination: {10},{0},{10,0},{5} are the sub arrays with sum divisible by 5.


Tips: You will have lots of time, so try to optimise the solution if you can. Remember here also they review each individual's code.

Round: Technical Interview
Experience: They will help you a lot if you are stuck at some point in the question. You have to be smart enough to grasp the clue.
Tips: They only ask questions only on data structures and algorithms.

Skill Tips: You have to be strong in coding. Algorithm questions will be mostly on dynamic programming. Data structures questions are mostly on trees.
Skills: C Programming, Maths(esp Probability), Algorithms And Data Structures
Duration: 5
College Name: JSS Mahavidyapeetha Sri Jayachamarajendra College Of Engineering, Mysore

Skills evaluated in this interview

Software Engineer Interview Questions & Answers

Intel user image Niranjhana Narayanan

posted on 4 Dec 2016

I applied via Campus Placement and was interviewed in Dec 2016. There were 5 interview rounds.

Interview Questionnaire 

2 Questions

  • Q1. Why UDP and not TCP in project
  • Ans. 

    UDP is preferred over TCP in this project due to its low latency and lightweight nature.

    • UDP is a connectionless protocol, which means it does not establish a direct connection between the sender and receiver.

    • UDP is faster than TCP as it does not have the overhead of establishing and maintaining a connection.

    • UDP is suitable for applications where real-time data transmission is crucial, such as video streaming or online ...

  • Answered by AI
  • Q2. How would you clear the 7th bit in a 32 bit register
  • Ans. 

    To clear the 7th bit in a 32-bit register, perform a bitwise AND operation with a mask that has all bits set to 1 except the 7th bit.

    • Create a mask with the 7th bit set to 0 and all other bits set to 1

    • Perform a bitwise AND operation between the register and the mask

    • Store the result back in the register

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: Questions were based on C concepts, given piece of code, find error, output, etc then data structures, bit manipulation, a few aptitude questions were also there (around 5-7).
Tips: Practice aptitude, C, data structures (geeksforgeeks.org is a good source).
Duration: 1 hour
Total Questions: 30

Round: Technical + HR Interview
Experience: I was asked to explain project in detail, I had done projects on embedded, so was asked about that, details like what fields did you use in that structure, why this implementation and not some related other. Memory management, network communications, operating systems. Then questions on C concepts like memory allocation, function pointers, then data structures like linked lists, then bit manipulation in registers. Questions from electrical coursework. Then later, why higher studies, would you still go for higher studies if you had a good job at a company, why etc.
Tips: Be thorough with C (know your Kernighan & Ritchie) and be prepared to go into details about your projects.

Skills: C, Data Structures, Coursework Understanding, Project And Internship
College Name: IIT Madras

Skills evaluated in this interview

Interview Questionnaire 

9 Questions

  • Q1. Tree questions related like traversal?
  • Q2. Locate the sum of 2 numbers in a linear array (Unsorted and sorted) and their complexities
  • Ans. 

    Locate sum of 2 numbers in a linear array (unsorted and sorted) and their complexities

    • For unsorted array, use nested loops to compare each element with every other element until the sum is found

    • For sorted array, use two pointers approach starting from the beginning and end of the array and move them towards each other until the sum is found

    • Complexity for unsorted array is O(n^2) and for sorted array is O(n)

  • Answered by AI
  • Q3. Pointers with increment/decrement, address of and value at operators (++,–,*,&)
  • Ans. 

    Pointers are used to manipulate memory addresses and values in C++. Increment/decrement, address of and value at operators are commonly used.

    • Incrementing a pointer moves it to the next memory location of the same data type

    • Decrementing a pointer moves it to the previous memory location of the same data type

    • The address of operator (&) returns the memory address of a variable

    • The value at operator (*) returns the value sto

  • Answered by AI
  • Q4. A point and a rectangle is present with the given coordinates. How will you determine whether the point is inside or outside the rectangle?
  • Ans. 

    To determine if a point is inside or outside a rectangle, we check if the point's coordinates fall within the rectangle's boundaries.

    • Check if the point's x-coordinate is greater than the left edge of the rectangle

    • Check if the point's x-coordinate is less than the right edge of the rectangle

    • Check if the point's y-coordinate is greater than the top edge of the rectangle

    • Check if the point's y-coordinate is less than the b...

  • Answered by AI
  • Q5. There is a point inside the rectangle. How will you determine the line that passes through the point and divides the rectangle into 2 equal halves?
  • Ans. 

    To find line that divides rectangle into 2 equal halves through a point inside it.

    • Find the center of the rectangle

    • Draw a line from the center to the given point

    • Extend the line to the opposite side of the rectangle

    • The extended line will divide the rectangle into 2 equal halves

  • Answered by AI
  • Q6. There is a scheme which contains 8-bit and 16-bit signed numbers. How many such combinations are possible?
  • Ans. 

    There are multiple combinations of 8-bit and 16-bit signed numbers. How many such combinations are possible?

    • There are 2^8 (256) possible combinations of 8-bit signed numbers.

    • There are 2^16 (65,536) possible combinations of 16-bit signed numbers.

    • To find the total number of combinations, we can add the number of combinations of 8-bit and 16-bit signed numbers.

    • Therefore, the total number of possible combinations is 256 +

  • Answered by AI
  • Q7. You are given an array of elements. Some/all of them are duplicates. Find them in 0(n) time and 0(1) space. Property of inputs – Number are in the range of 1..n where n is the limit of the array
  • Ans. 

    Find duplicates in an array of elements in 0(n) time and 0(1) space.

    • Use the property of inputs to your advantage

    • Iterate through the array and mark elements as negative

    • If an element is already negative, it is a duplicate

    • Return all the negative elements as duplicates

  • Answered by AI
  • Q8. Given a array of digits. print all combination of of these i.e all no formed by these. repetition allowed. and then repetition not allowed example: i/p: arr={1,2,3} o/p: (without repetition) 123, 132, 213,...
  • Q9. Questions on project

Interview Preparation Tips

Round: Test
Duration: 90 minutes
Total Questions: 3

Round: HR Interview
Experience: HR interview was all about my projects, my background and a few more typical HR questions. It was pretty easy to answer them.

Skills: Algorithm, Data structure, C++
College Name: IIT ROORKEE

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

3 rounds online, dsa, hr

Round 2 - One-on-one 

(2 Questions)

  • Q1. Dsa on dp topic
  • Q2. Dsa on dp topics
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Not Selected

I applied via Campus Placement and was interviewed in Feb 2024. There were 3 interview rounds.

Round 1 - Coding Test 

It was online coding test consist of 2 question
One from DP and other graph

Round 2 - Coding Test 

One question of DP within in 45 min time constraints

Round 3 - Technical 

(1 Question)

  • Q1. Floor value of square root of a number
  • Ans. 

    Floor value of square root of a number is the largest integer less than or equal to the square root.

    • The floor value of square root of a number can be found using mathematical functions like floor() or integer division.

    • For example, the floor value of square root of 16 is 4, as sqrt(16) = 4.

    • For non-perfect square numbers, the floor value of square root can be calculated using approximation methods.

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Go through DSA and core subjects
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Campus Placement and was interviewed in Apr 2023. There were 2 interview rounds.

Round 1 - Coding Test 

Level was medium to hard

Round 2 - Technical 

(5 Questions)

  • Q1. Technical interview
  • Q2. Questions on DSA Cs fundamentals
  • Q3. Coding questions
  • Q4. Ques on String array
  • Q5. To print tree in anticlock wise direction
  • Ans. 

    To print a tree in anticlockwise direction, start from the bottom left and traverse each level from right to left.

    • Start from the bottom left of the tree

    • Traverse each level from right to left

    • Print the nodes as you traverse

  • Answered by AI

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

Some old coding platform with limited testcases

Round 2 - Technical 

(1 Question)

  • Q1. Normal dp problems
Round 3 - Manegeral 

(1 Question)

  • Q1. About resume and projects
Contribute & help others!
anonymous
You can choose to be anonymous

Synopsys Interview FAQs

What are the top questions asked in Synopsys R&D Design Engineer interview?

Some of the top questions asked at the Synopsys R&D Design Engineer interview -

  1. What are semaphores, differnce between them, Different OSI layers , deadlock pr...read more
  2. What is the differnce between linear and non linear data structu...read more
  3. What is the differnce between c and c...read more

Recently Viewed

INTERVIEWS

Biesse Manufacturing

10 top interview questions

INTERVIEWS

Synopsys

No Interviews

SALARIES

VE Commercial Vehicles

INTERVIEWS

Synopsys

No Interviews

INTERVIEWS

VE Commercial Vehicles

No Interviews

INTERVIEWS

Blinkit

No Interviews

JOBS

VE Commercial Vehicles

No Jobs

DESIGNATION

SALARIES

VE Commercial Vehicles

INTERVIEWS

CARS24

No Interviews

Tell us how to improve this page.

Interview Questions from Similar Companies

Intel Interview Questions
4.2
 • 214 Interviews
Texas Instruments Interview Questions
4.1
 • 120 Interviews
Molex Interview Questions
3.9
 • 53 Interviews
Lam Research Interview Questions
3.7
 • 44 Interviews
View all
R&D Engineer
148 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior R&D Engineer
100 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Staff Engineer
89 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Security Consultant
60 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Applications Engineer
58 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Synopsys with

Cadence Design Systems

4.1
Compare

Mentor Graphics

4.0
Compare

Ansys Software Private Limited

3.9
Compare

Infineon Technologies

3.9
Compare
Did you find this page helpful?
Yes No
write
Share an Interview