AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
i
Synopsys
Compare
Filter interviews by
Clear (1)
Synopsys Software Developer Interview Questions and Answers
Synopsys Software Developer Interview Experiences
2 interviews found
General aptitude questions
Problem solving, solved 2 out of 3 questions
General topics were given in gd
(2 Questions)
- Q1. Programming concepts
- Q2. Projects and coding round questions solved
I applied via Referral and was interviewed before Nov 2023. There were 2 interview rounds.
Frog jump dp problem
(2 Questions)
- Q1. Microservices, Kubernetes
- Q2. Rbac and access control
Top trending discussions
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
- 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
- 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.
- 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
- 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
- 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
- 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.
- 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
Interview Preparation Tips
College Name: Na
Skills evaluated in this interview
Selected
I was interviewed before Feb 2022.
(1 Question)
- Q1. Linked list (detect loop, reverse, delte a node) tree (height, DFS) graph theory concept C++ basic questions
(1 Question)
- Q1. Total 3 round of Technical interviews.
Interview Preparation Tips
Software Developer Interview Questions & Answers
Ansys Software Private Limited
Anonymous
posted on 31 May 2022
I was interviewed before May 2021.
(2 Questions)
Round duration - 90 minutes
Round difficulty - Easy
Timing - 10AM-11:30AM
Online proctored test
- Q1.
Binary Tree Right View Problem Statement
Given a binary tree of integers, your task is to print the right view of it. The right view represents a set of nodes visible when the tree is viewed from the righ...
- Ans.
The task is to print the right view of a binary tree, representing nodes visible from the right side in top-to-bottom order.
Traverse the tree level by level and keep track of the rightmost node at each level
Print the rightmost node of each level to get the right view of the tree
Use a queue for level order traversal and a map to store the rightmost nodes
- Q2.
0/1 Knapsack Problem Statement
A thief is planning to rob a store and can carry a maximum weight of 'W' in his knapsack. The store contains 'N' items where the ith item has a weight of 'wi' and a value of...
- Ans.
Yes, the 0/1 Knapsack problem can be solved using dynamic programming with a space complexity of not more than O(W).
Use a 1D array to store the maximum value that can be stolen for each weight from 0 to W.
Iterate through each item and update the array based on whether including the item would increase the total value.
The final value in the array at index W will be the maximum value that can be stolen.
(2 Questions)
Round duration - 45 minutes
Round difficulty - Medium
Timing : 4PM-5PM
Environment - Online
There was a panel of 3 interviewers
- Q1. How can you find the size of an array in C or C++ without using sizeof or any standard function?
- Ans.
You can find the size of an array in C or C++ by dividing the total size of the array by the size of one element.
Calculate the total size of the array by multiplying the number of elements by the size of each element.
Divide the total size by the size of one element to get the size of the array.
For example, if you have an array of strings arr[] = {'hello', 'world', 'example'}, you can find the size by dividing the total
- Q2. Explain how indexing in a database works using B+ trees.
- Ans.
B+ trees are used for indexing in databases to efficiently search and retrieve data.
B+ trees are balanced trees where each node can have multiple keys and child pointers.
Data is stored in leaf nodes, while non-leaf nodes are used for navigation.
B+ trees are commonly used in databases because of their ability to efficiently search and retrieve data.
Example: In a database table with an index on a specific column, B+ tree...
(1 Question)
Round duration - 45 mintues
Round difficulty - Easy
Timing - 11AM-12:15PM
Environment - online video call
Again there was a panel of 2 senior engineers
- Q1.
Maximum Path Sum Problem Statement
You are given an n-ary tree consisting of 'N' nodes. Your task is to determine the maximum sum of the path from the root to any leaf node.
Example:
Input:
For the giv...
- Ans.
Find the maximum sum of the path from the root to any leaf node in an n-ary tree.
Traverse the tree from root to leaf nodes while keeping track of the sum of each path.
At each node, calculate the sum of the path from the root to that node and update the maximum sum found so far.
Consider using depth-first search (DFS) or breadth-first search (BFS) for tree traversal.
Handle cases where nodes have negative values or where
Interview Preparation Tips
Tip 1 : Brush Up on Computer Science Fundamentals
Tip 2 : Prepare a Brief Self-Introduction
Tip 1 : Do not put fake resume
Tip 2 : Writing internship project helps.
Skills evaluated in this interview
Software Developer Interview Questions & Answers
Ansys Software Private Limited
Shubhodeep Bhattacharya
posted on 28 Jun 2024
I applied via Job Portal and was interviewed before Jun 2023. There was 1 interview round.
(1 Question)
- Q1. Write down the recursion tree for this code:
- Ans.
Recursion tree for a given code
Identify the base case of the recursion
Draw a tree structure with each recursive call as a node
Label each node with the input parameters and return values
Skills evaluated in this interview
Software Developer Interview Questions & Answers
Microchip Technology
Anonymous
posted on 19 Sep 2024
I applied via Naukri.com and was interviewed before Sep 2023. There were 2 interview rounds.
1st round is combination of aptitude and technical mcqs
(2 Questions)
- Q1. Tell me about ur projects
- Ans.
I have worked on various projects including a web-based inventory management system and a mobile app for tracking fitness goals.
Developed a web-based inventory management system using React and Node.js
Created a mobile app for tracking fitness goals using Flutter
Collaborated with a team to implement new features and fix bugs in existing projects
- Q2. Tell me about two sum code in python
- Ans.
Two sum code in Python finds two numbers in an array that add up to a specific target.
Use a dictionary to store the difference between the target and each element in the array.
Iterate through the array and check if the current element's complement is in the dictionary.
Return the indices of the two numbers that add up to the target.
Interview Preparation Tips
- DBMS
- OOPS
- Data Structures
- Python
Skills evaluated in this interview
Software Developer Interview Questions & Answers
Infineon Technologies
Anonymous
posted on 23 Sep 2017
I was interviewed in Sep 2017.
Interview Questionnaire
3 Questions
- Q1. A C program was asked to write
- Q2. How to implement sr flipflop using gates.
- Ans.
An SR flip-flop can be implemented using NAND gates.
Use two NAND gates to create the SR flip-flop.
Connect the output of one NAND gate to the input of the other NAND gate.
Connect the Set (S) and Reset (R) inputs to the inputs of the NAND gates.
The output of the first NAND gate is the Q output, and the output of the second NAND gate is the Q̅ output.
- Q3. Steps to find temperature of N rooms and display the same
- Ans.
The answer describes the steps to find and display the temperature of N rooms.
Create an array to store the temperature of each room
Iterate through each room and prompt the user to enter the temperature
Store the temperature in the corresponding array index
Display the temperature of each room
Interview Preparation Tips
Experience: The first criteria for shortlisting is based on CGPA (8 above)
Round: Test
Experience: A technical test was conducted which had questions from C language and Microcontroller. It was MCQ type.The test was moderately hard
Duration: 30 minutes
Total Questions: 30
Round: Technical Interview
Experience: The above questions were asked and a paper was provided to answer it. The next shotlist was based on the paper evaluation
Tips: Technical knowledge mandatory
Skills: Technical
College Name: Government Model Engineering College, Thrikkakara
Skills evaluated in this interview
Software Developer Interview Questions & Answers
Cadence Design Systems
Anonymous
posted on 10 May 2015
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)
- 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
- 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...
- 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
- 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 +
- 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
- 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
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
I was interviewed before May 2016.
Interview Preparation Tips
Experience: it was elitmus test conducted by the company itself on campus. As per my knowledge only those scoring 90 percentile got selected for round 2.
Tips: Attempt only those ques that are necessary for scoring 90+ in e litmus. Specially in verbal don't attempt more then required questions, though you might be tempted. The aim is not to score max bt to score 90+
Round: Technical Interview
Experience: This was a programming based round. I was asked to write algorithms for various array linked list based problems. There was cross questioning prompting to reduce complexity and to use different data structures for same problems.
Mostly it focused on subjects like c, data structures and ADA.
Tips: Be clear with basic of data structures and algorithms. Pointers, queue, stacks, array linked lists, sorting etc are the keywords.
Round: Technical Interview
Experience: This was a information security specific round since that was my major. In depth cross questioning on my thesis topics, honeypots, network intrusion etc. Security certificates, and on the go problems to provide security solution layer wise in different scenarios. Security concept of torrents was also asked in detail.
Tips: It was more of a security discussion and throwing of ideas about how things in a particular case could work or could not. Don't worry about right or wrong answer just be clear with your reasoning about the solution you are suggesting.
Round: Other Interview
Experience: I don't know what to name this round, but it focused mainly on developing test cases for an object. Say they gave me a stapler and said to develop a test plan listing down test cases for a given object to pass so that it can be confirmed that it is a stapler. Another scenario was with a lift.
Tips: This is one round where your presence of mind and inter personal skills matter. I think the way you present your thoughts was most important here.
Round: Behavioural Interview
Experience: This was was mostly about how would you react in a given professional situation
Like your assigned work could not be completed on time, or if you are doing something wrong with the work assigned.
Tips: This is all about inter personal skills and putting your best foot forward :)
College Name: Indira Gandhi Delhi Technical University For Women, Delhi
Synopsys Interview FAQs
Recently Viewed
INTERVIEWS
Jakson Group
No Interviews
INTERVIEWS
Tietoevry
No Interviews
INTERVIEWS
KPMG India
No Interviews
INTERVIEWS
NS Matrix Services
No Interviews
INTERVIEWS
Molex
No Interviews
INTERVIEWS
Trianz
No Interviews
INTERVIEWS
VDart
No Interviews
INTERVIEWS
Panasonic
No Interviews
INTERVIEWS
TIAA Global Business Services
No Interviews
INTERVIEWS
Jamna Auto Industries
No Interviews
Tell us how to improve this page.
Synopsys Interviews By Designations
- Synopsys R&D Engineer Interview Questions
- Synopsys Applications Engineer Interview Questions
- Synopsys Security Consultant Interview Questions
- Synopsys Software Engineer Interview Questions
- Synopsys Physical Design Engineer Interview Questions
- Synopsys Technical Intern Interview Questions
- Synopsys Software Developer Interview Questions
- Synopsys Intern Interview Questions
- Show more
Interview Questions for Popular Designations
- Senior Software Developer Interview Questions
- Associate Software Developer Interview Questions
- Lead Software Engineer Interview Questions
- Software Development Engineer II Interview Questions
- Software Engineer Interview Questions
- Software Development Engineer 1 Interview Questions
- Software Engineer Level 1 Interview Questions
- Senior Software Engineer Interview Questions
- Show more
Synopsys Software Developer Interview Process
based on 2 interviews
Interview experience
Software Developer Interview Questions from Similar Companies
Fast track your campus placements
Synopsys Software Developer Reviews and Ratings
based on 3 reviews
Rating in categories
|
R&D Engineer
148
salaries
|  ₹0 L/yr - ₹0 L/yr |
|
Senior R&D Engineer
100
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Staff Engineer
89
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Security Consultant
60
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Applications Engineer
58
salaries
| ₹0 L/yr - ₹0 L/yr |
Cadence Design Systems
Mentor Graphics
Ansys Software Private Limited
Infineon Technologies
- Home >
- Interviews >
- Synopsys Interview Questions >
- Synopsys Software Developer Interview Questions
