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

Synopsys Quality Assurance Interview Questions and Answers

Updated 12 Dec 2023

Synopsys Quality Assurance Interview Experiences

1 interview found

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-

I applied via Campus Placement

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Aptitude Test 

Aptitude was comparitively simple and easy to crack

Round 3 - Technical 

(2 Questions)

  • Q1. Project discussion, simple circuit explanations like cmos, working of capacitors, etc.
  • Q2. Draw and explain the structure of a cmos
  • Ans. 

    A CMOS (Complementary Metal-Oxide-Semiconductor) is a type of integrated circuit technology that uses both NMOS and PMOS transistors.

    • CMOS is widely used in digital logic circuits due to its low power consumption.

    • It consists of a combination of NMOS (n-type) and PMOS (p-type) transistors.

    • The NMOS transistors are used for logic 0 and the PMOS transistors for logic 1.

    • The transistors are connected in a complementary manner...

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - be thorough with the basics and be confident

Interview questions from similar companies

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-

I applied via Campus Placement

Round 1 - Coding Test 

It was an online assesment followed by an offline assessment.

Round 2 - Technical 

(3 Questions)

  • Q1. Create a Linked List
  • Ans. 

    A linked list is a data structure where each element points to the next element in the sequence.

    • Create a Node class with data and next pointer

    • Initialize a head pointer to null

    • Add elements by creating new nodes and updating next pointers

    • Traverse the list by following next pointers

  • Answered by AI
  • Q2. Insert a node in a Linked List
  • Ans. 

    To insert a node in a Linked List, update the next pointer of the new node to point to the current node's next, then update the current node's next pointer to the new node.

    • Create a new node with the desired value

    • Set the new node's next pointer to the current node's next

    • Update the current node's next pointer to the new node

  • Answered by AI
  • Q3. Project based questions and CS fundamentals

Skills evaluated in this interview

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

I applied via Referral and was interviewed before Sep 2020. There was 1 interview round.

Interview Questionnaire 

2 Questions

  • Q1. Basic c programming
  • Q2. Previous experience questions

Interview Preparation Tips

Interview preparation tips for other job seekers - Be honest. And prepare well in data structures

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.

  • Answered by AI
  • 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

  • Answered by AI

Interview Preparation Tips

Round: Resume Shortlist
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

I was interviewed in Feb 2017.

Interview Questionnaire 

7 Questions

  • Q1. What is a malloc function and where is it used and how is it different from new?
  • Ans. 

    malloc is a function in C that dynamically allocates memory on the heap. It is used to allocate memory for variables or data structures.

    • malloc is used in C programming language.

    • It is used to allocate memory on the heap.

    • malloc is different from 'new' in C++ as it does not call constructors for objects.

  • Answered by AI
  • Q2. What is the difference between C++ and Objective C and where will you use it?
  • Ans. 

    C++ is a general-purpose programming language while Objective C is a superset of C used for iOS and macOS development.

    • C++ is widely used for developing applications, games, and system software.

    • Objective C is mainly used for iOS and macOS development.

    • C++ supports both procedural and object-oriented programming paradigms.

    • Objective C is an object-oriented language with dynamic runtime features.

    • C++ has a larger community a...

  • Answered by AI
  • Q3. What is the difference between class container and class composition?
  • Ans. 

    Class container is a class that holds objects of other classes, while class composition is a way to combine multiple classes to create a new class.

    • Class container holds objects of other classes, acting as a collection or container.

    • Class composition combines multiple classes to create a new class with its own behavior and attributes.

    • In class container, the objects are typically stored in a data structure like an array o...

  • Answered by AI
  • Q4. There are fifteen horses and a racing track that can run five horses at a time. You have to figure out the top 3 horses out of those and you don't have any timer machine to measure. How will you find the t...
  • Ans. 

    Divide the horses into groups of 5 and race them. Take the top 2 from each race and race them again. Finally, race the top 2 horses to determine the top 3.

    • Divide the horses into 3 groups of 5 and race them.

    • Take the top 2 horses from each race and race them again.

    • Finally, race the top 2 horses to determine the top 3.

  • Answered by AI
  • Q5. What is the most difficult problem that you have solved (during work) till now and why you think you could do so?
  • Ans. 

    Developing a real-time data processing system for a high-traffic e-commerce website

    • Implemented a distributed system architecture to handle large volumes of data

    • Optimized algorithms for efficient data processing and storage

    • Utilized caching mechanisms to improve system performance

    • Worked closely with cross-functional teams to troubleshoot and resolve issues

    • Example: Successfully reduced data processing time by 50% by imple

  • Answered by AI
  • Q6. Why you want to change your current job?
  • Ans. 

    Seeking new challenges and opportunities for growth.

    • Looking for a more challenging role to further develop my skills

    • Interested in exploring new technologies and industries

    • Seeking better career advancement opportunities

    • Want to work in a more collaborative team environment

  • Answered by AI
  • Q7. What is the width of a tree? How will you calculate the width of the tree?
  • Ans. 

    The width of a tree is the maximum number of nodes at any level in the tree.

    • To calculate the width of a tree, we can perform a level order traversal and keep track of the maximum number of nodes at any level.

    • We can use a queue data structure to perform the level order traversal.

    • At each level, we count the number of nodes in the queue and update the maximum width if necessary.

  • Answered by AI

Interview Preparation Tips

Skills: Basic C/C++, Implementing Data Structures In C++

Skills evaluated in this interview

Synopsys Interview FAQs

How many rounds are there in Synopsys Quality Assurance interview?
Synopsys interview process usually has 3 rounds. The most common rounds in the Synopsys interview process are Resume Shortlist, Aptitude Test and Technical.
What are the top questions asked in Synopsys Quality Assurance interview?

Some of the top questions asked at the Synopsys Quality Assurance interview -

  1. draw and explain the structure of a c...read more
  2. project discussion, simple circuit explanations like cmos, working of capacitor...read more

Tell us how to improve this page.

Synopsys Quality Assurance Interview Process

based on 1 interview

Interview experience

4
  
Good
View more

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

Synopsys Quality Assurance Reviews and Ratings

based on 1 review

1.0/5

Rating in categories

5.0

Skill development

5.0

Work-life balance

5.0

Salary

5.0

Job security

1.0

Company culture

1.0

Promotions

5.0

Work satisfaction

Explore 1 Review and Rating
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