Synopsys Senior R&D Engineer Interview Questions and Answers

Q1. This was more like shortlisting round with manager. Asked about resume and previous work experience. Not much Technical questions.
Add your answer

Q1. Python programming questions, Basics
Add your answer
Q2. Python oops concepts
Add your answer
Q3. What is module in Python
Ans. 
A module in Python is a file containing Python code, which can define functions, classes, and variables.
• Modules help organize Python code into reusable components

• Modules can be imported into other Python scripts using the 'import' keyword

• Examples of modules in Python include math, random, and os
Answered by AI
Add your answer
Q4. Python memory management
Add your answer
Q5. Basic Devops questions
Add your answer

Three DSA questions one on likedlist one on BST and one on maps

Q1. Cpp pointers explain smart pointers
Ans. 
Smart pointers in C++ provide automatic memory management and help prevent memory leaks.
• Smart pointers are objects that manage the memory of a pointer automatically.

• They ensure that memory is deallocated when it is no longer needed.

• Examples include unique_ptr, shared_ptr, and weak_ptr.
Answered by AI
Add your answer
Q2. Cpp question based on OOPs concepts
Add your answer

DSA questions on graph and lots of puzzles

Q1. Questions about memory segments and compiler optimisations
Add your answer
Q2. Question about controller architecture
Add your answer

Q1. Question about memory allocation of variables from a code snippet
Add your answer

Q1. As infineon is Produc based company and Every Person Responsible for complete Chip Testing instead on 1 specific Block. so Interview Asked Basic Tests like continuity, DPS short , Vil/Vih , Voh/Vih , Lekag...read more
Ans. Above all the Topics prepare clearly
Answered Anonymously
Add your answer
Q2. Basics of Tester Hardwares and why you join in INFIN ? Why want to Change the company ? Why should we we hire ? Tell me about any challenges faced in previous organisation and Work status ? Any protocol...read more
Ans. These are Main topics you should good before going to attend the interview
Answered Anonymously
Add your answer

Q1. Same as Previous Round but did by Manager in deep level on Basics and work
Add your answer

Q1. General Discussion about Works did in previous organisation and Basics
Add your answer

Q1. General Discussion and Salary Negotiation
Add your answer

Q1. Please prepare a 30-minute presentation of your academic and professional experience.
Add your answer
Q2. Detailed questions related to the conceptual and technical nuances of previous work.
Add your answer

Q1. Describe in detail your contribution to the projects you were involved in in your previous employment.
Add your answer
Q2. Share an instance when you experienced failure. How did you deal with it?
Add your answer
Q3. What is your expectation from the role?
Add your answer
Q4. What is your expectation regarding compensation?
Ans. 
I expect a fair and competitive compensation package based on my experience and qualifications.
• I am looking for a salary that is commensurate with my skills and experience

• I am open to discussing benefits such as health insurance, retirement plans, and vacation time

• I am willing to negotiate based on the overall compensation package offered

• I am looking for a long-term commitment from the company
Answered by AI
Add your answer

Q1. According to you, what is more important: individual contribution or team effort?
Add your answer
Q2. On a scale of 1 to 5, how would you rate yourself in the following skills: C++, data-structures and algorithms, python/cython
Add your answer
Q3. Have you had experience in leadership? Share details.
Add your answer
Q4. What are your top three qualities?
Add your answer

Q1. Add two linked list
Ans. 
To add two linked lists, iterate through both lists simultaneously and add corresponding nodes, considering carry from previous addition.
• Create a dummy node to hold the result.

• Initialize current node to dummy node.

• Iterate through both lists, adding values and carry from previous addition.

• Move to next nodes in both lists.

• Handle cases where one list is longer than the other.

• Handle final carry if present.
Answered by AI
Add your answer
Q2. Find shortest path in graph
Ans. 
Use Dijkstra's algorithm to find the shortest path in a graph
• Implement Dijkstra's algorithm to find the shortest path between two nodes in a graph

• Maintain a priority queue to keep track of the shortest distance to each node

• Update the shortest distance to each node as you traverse the graph

• Track the path by storing the previous node for each node visited
Answered by AI
Add your answer

Q1. Check tree is BST
Ans. 
Check if a binary tree is a Binary Search Tree (BST)
• Perform an in-order traversal of the tree and check if the resulting array is sorted

• Keep track of the previous node value during traversal to compare with the current node value

• Ensure that each node's value is greater than the previous node's value in the in-order traversal
Answered by AI
Add your answer
Q2. Check substring palindrome or not
Ans. 
Check if a substring in an array of strings is a palindrome or not.
• Iterate through each string in the array

• For each string, check if any of its substrings are palindromes

• Return true if a palindrome substring is found, false otherwise
Answered by AI
Add your answer

Q1. Reverse linked list recursively
Ans. 
Reverse a linked list recursively
• Create a recursive function to reverse the linked list

• Pass the current node and its next node as parameters

• Update the next pointer of the current node to point to the previous node
Answered by AI
Add your answer
Q2. Check if two stacks are equal
Ans. 
Check if two stacks are equal by comparing each element in the stacks
• Pop elements from both stacks and compare them one by one

• If the sizes of the stacks are different, they are not equal

• If any element in the stacks is different, they are not equal
Answered by AI
Add your answer

Q1. C questions on oops concepts
Add your answer
Q2. Python and ml questions
Add your answer

Q1. Salary discussion
Add your answer