AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Clear (1)
Mentor Graphics Software Developer Interview Questions, Process, and Tips
Top Mentor Graphics Software Developer Interview Questions and Answers
- Q1. 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 ra ...read more
- Q2. 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
- Q3. 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 ...read more
Mentor Graphics Software Developer Interview Experiences
2 interviews found
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
Calpion Software Technologies
Be part of a company where work compliments life, not consumes it.
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
Top trending discussions
Interview questions from similar companies
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
Snehal Jaipurker
I was interviewed in Jul 2017.
Interview Questionnaire
6 Questions
- Q1. Code to print * in five consecutive lines
- Ans.
Code to print * in five consecutive lines
Use a loop to iterate five times
Inside the loop, print a string containing a single * character
- Q2. A ball is left from a height of 10 meters. After bouncing first time it looses 10% of its previous height the next time it bounces. Write a code to calculate the number of bounces the ball goes through unt...
- Ans.
Code to calculate number of bounces a ball goes through until it comes to rest.
Use a loop to simulate the bounces until the ball stops bouncing
Calculate the height of each bounce using the given formula
Keep track of the number of bounces in a counter variable
- Q3. Which is the best and less time consuming way to calculate factorial of a number?
- Ans.
The best and less time consuming way to calculate factorial of a number is using iterative approach.
Iteratively multiply the number with all the numbers from 1 to the given number
Start with a result variable initialized to 1
Multiply the result with each number in the range
Return the final result
- Q4. Write the code to find factorial using function recursion.
- Ans.
Code to find factorial using function recursion
Define a function that takes an integer as input
Check if the input is 0 or 1, return 1 in that case
Otherwise, call the function recursively with input-1 and multiply it with the input
- Q5. They asked for my introduction.
- Q6. They asked about my family members.
Interview Preparation Tips
Experience: Aptitude test was moderately tough. The coding test was on basics of c language of all the topics.
Tips: Solving R. S. Agrawal for Aptitude and videos on YouTube on C language are sufficient to score well.
Duration: 1 hour
Total Questions: 60
Round: Technical Interview
Experience: I wrote the first code correctly. I wrote the second code 75% correct and they explained me my mistakes and I could understand where I was going wrong then I corrected my code and then they were satisfied. They asked me whether I could write the factorial code by function recursion method. I replied that I can write the factorial code but not by function recursion method. They were satisfied.
Tips: Build your coding skills by more practice.
Round: HR Interview
Experience: In this round they just asked me my introduction and said that you are shortlisted for now but we will give you final confirmation after a week.
Tips: Don't lie. Be genuine.
College Name: SCOE, PUNE
Skills evaluated in this interview
Software Developer Interview Questions & Answers
Cadence Design Systems
Anonymous
posted on 6 Apr 2022
I was interviewed before Apr 2021.
(2 Questions)
Round duration - 75 minutes
Round difficulty - Medium
This was an online coding round where I had 2 questions to solve under 75 minutes. Both the coding questions were of Medium to Hard level of difficulty.
- Q1.
Smallest Window Problem Statement
Given two strings,
SandX, your task is to find the smallest substring inSthat contains all the characters present inX.Example:
Input:
S = "abdd"
X = "bd"Output:
... - Ans.
Find the smallest substring in S that contains all characters in X.
Use a sliding window approach to find the smallest substring in S that contains all characters in X.
Keep track of the characters in X using a hashmap.
Move the window by adjusting the start and end pointers until all characters in X are found.
Return the smallest substring encountered.
- Q2.
K - Sum Path In A Binary Tree
Given a binary tree where each node contains an integer value, and a value 'K', your task is to find all the paths in the binary tree such that the sum of the node values in ...
- Ans.
Find all paths in a binary tree where the sum of node values equals a given value 'K'.
Traverse the binary tree using DFS and keep track of the current path and its sum.
At each node, check if the current sum equals 'K' and add the path to the result.
Continue traversal to the left and right child nodes recursively.
Return the list of paths that sum up to 'K'.
(4 Questions)
Round duration - 60 Minutes
Round difficulty - Medium
This round had 2 questions of DS/Algo to solve under 60 minutes and 2 questions related to Operating Systems.
- Q1.
Validate Partial Binary Search Tree (BST) Problem Statement
You are provided with a binary tree containing 'N' nodes. Your task is to determine if this tree is a Partial Binary Search Tree (BST). Return t...
- Ans.
Validate if a binary tree is a Partial Binary Search Tree (BST) by checking if each node's left subtree contains nodes with data less than or equal to the node's data, and each node's right subtree contains nodes with data greater than or equal to the node's data.
Check if each node's left subtree follows BST property (data <= node's data) and right subtree follows BST property (data >= node's data)
Recursively che...
- Q2.
Longest Increasing Subsequence Problem Statement
Given an array of integers with 'N' elements, determine the length of the longest subsequence where each element is greater than the previous element. This...
- Ans.
Find the length of the longest strictly increasing subsequence in an array of integers.
Use dynamic programming to solve this problem efficiently.
Initialize an array to store the length of the longest increasing subsequence ending at each index.
Iterate through the array and update the length of the longest increasing subsequence for each element.
Return the maximum value in the array as the result.
- Q3. Can you define process and threads in operating systems?
- Ans.
Processes are instances of a program in execution, while threads are lightweight processes within a process.
A process is a program in execution, with its own memory space and resources.
Threads are lightweight processes within a process, sharing the same memory space and resources.
Processes are independent of each other, while threads within the same process can communicate and share data.
Example: A web browser running ...
- Q4. What are the different types of semaphores?
- Ans.
Different types of semaphores include binary semaphores, counting semaphores, and mutex semaphores.
Binary semaphores: Can only have two states - 0 or 1. Used for mutual exclusion.
Counting semaphores: Can have multiple states. Used for managing resources with limited capacity.
Mutex semaphores: Similar to binary semaphores but with additional features like priority inheritance.
Named semaphores: Can be shared between proc...
(3 Questions)
Round duration - 60 Minutes
Round difficulty - Hard
In this round, I was asked 3 coding questions out of which I had to implement the first two and for the last question I was only asked the optimal approach. The main challenge in this round was to implement the first two questions in a production ready manner without any bugs and so I had to spent some time thinking about some Edge Cases which were important with respect to the question.
- Q1.
Next Greater Element Problem Statement
You are given an array
arrof lengthN. For each element in the array, find the next greater element (NGE) that appears to the right. If there is no such greater ele... - Ans.
The task is to find the next greater element for each element in an array to its right, if no greater element exists, return -1.
Use a stack to keep track of elements for which the next greater element is not found yet.
Iterate through the array from right to left and pop elements from the stack until a greater element is found.
Store the next greater element for each element in a separate array.
If the stack is empty afte...
- Q2.
Power Set Generation
Given a sorted array of 'N' integers, your task is to generate the power set for this array. Each subset of this power set should be individually sorted.
A power set of a set 'ARR' i...
- Ans.
Generate power set of a sorted array of integers with individually sorted subsets.
Use recursion to generate all possible subsets by including or excluding each element in the array.
Sort each subset before adding it to the power set.
Handle base case when all elements have been considered to add the subset to the power set.
- Q3.
Counting Sort Problem Statement
Ninja is learning about sorting algorithms, specifically those that do not rely on comparisons. Can you help Ninja implement the counting sort algorithm?
Example:
Input:
... - Ans.
Implement counting sort algorithm to sort an array of integers without comparisons.
Count the frequency of each element in the input array.
Create a prefix sum array to determine the position of each element in the sorted array.
Iterate through the input array and place each element in its correct position based on the prefix sum array.
Time complexity of counting sort is O(n+k), where n is the number of elements and k is
Interview Preparation Tips
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Skills evaluated in this interview
Software Developer Interview Questions & Answers
Siemens PLM Software
Anonymous
posted on 6 Mar 2024
(1 Question)
- Q1. Basics and advance C++ concepts
Software Developer Interview Questions & Answers
Siemens PLM Software
Anonymous
posted on 11 Jun 2022
I applied via LinkedIn and was interviewed in Dec 2021. There was 1 interview round.
(1 Question)
- Q1. For 1 yr experience Java dev interview: Qs on core java, collections, internal working, code snippets related to OOPS were given and output had to be guessed. Basic Coding problem
Interview Preparation Tips
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
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
Sudeep B
I applied via Referral and was interviewed in Mar 2024. There was 1 interview round.
(2 Questions)
- Q1. Project based backend and frontend
- Q2. How to connect to backend
- Ans.
To connect to the backend, you can use APIs, database connections, or web services.
Use APIs to send and receive data between the frontend and backend
Establish database connections to retrieve and store data
Utilize web services for communication between different systems
Interview Preparation Tips
Skills evaluated in this interview
Mentor Graphics Interview FAQs
Some of the top questions asked at the Mentor Graphics Software Developer interview -
Recently Viewed
INTERVIEWS
Athenahealth Technology
No Interviews
LIST OF COMPANIES
PCBL Chemical Limited
Locations
COMPANY BENEFITS
Solartis Technology Services
No Benefits
LIST OF COMPANIES
Ongc Petro Additions
Locations
DESIGNATION
LIST OF COMPANIES
Hindustan Petroleum
Locations
LIST OF COMPANIES
Petronas Lubricants
Locations
INTERVIEWS
Reliance Industries
No Interviews
COMPANY BENEFITS
Athenahealth Technology
No Benefits
SALARIES
HPCL-Mittal Energy Limited
Tell us how to improve this page.
Mentor Graphics Interviews By Designations
- Mentor Graphics Member Technical Staff Interview Questions
- Mentor Graphics Senior Member of Technical Staff Interview Questions
- Mentor Graphics Software Developer Interview Questions
- Mentor Graphics Intern Interview Questions
- Mentor Graphics Graphic Designer Interview Questions
- Mentor Graphics Functional Verification Engineer/ Team Lead Verification Interview Questions
- Mentor Graphics Fire Supervisor Interview Questions
- Mentor Graphics Embedded Software Engineer 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
- Java Software Developer Interview Questions
- Show more
Mentor Graphics Software Developer Interview Process
based on 1 interview
Interview experience
Sopra Steria
Rated 4 for Job Security by our employees on AmbitionBox
Software Developer Interview Questions from Similar Companies
Fast track your campus placements
Mentor Graphics Software Developer Reviews and Ratings
based on 2 reviews
Rating in categories
|
Senior Member of Technical Staff
70
salaries
|  ₹0 L/yr - ₹0 L/yr |
|
Lead Member Technical Staff
43
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Member Consulting Staff
35
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Software Engineer
29
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Member Technical Staff
25
salaries
| ₹0 L/yr - ₹0 L/yr |
Cadence Design Systems
Synopsys
Ansys Software Private Limited
Autodesk
- Home >
- Interviews >
- Mentor Graphics Interview Questions >
- Mentor Graphics Software Developer Interview Questions
