Upload Button Icon Add office photos

Mentor Graphics

Compare button icon Compare button icon Compare

Filter interviews by

Mentor Graphics Interview Questions, Process, and Tips

Updated 2 Aug 2024

Top Mentor Graphics Interview Questions and Answers

View all 14 questions

Mentor Graphics Interview Experiences

Popular Designations

18 interviews found

Round 1 - One-on-one 

(2 Questions)

  • Q1. Fire supervisor building maintenance
  • Q2. Safety building management

Interview Preparation Tips

Interview preparation tips for other job seekers - Fire panal firefighter A B C extinguisher all building maintenance

Fire Supervisor Interview Questions asked at other Companies

Q1. What's the colour code of the CO2 fire extinguishers?
View answer (2)
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Selected Selected

I was interviewed before Feb 2022.

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 - Technical 

(1 Question)

  • Q1. Linked list (detect loop, reverse, delte a node) tree (height, DFS) graph theory concept C++ basic questions
Round 3 - One-on-one 

(1 Question)

  • Q1. Total 3 round of Technical interviews.

Interview Preparation Tips

Interview preparation tips for other job seekers - C++ basics, Algo and Data structure and some basic concept of graph theory.

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 random byte. Note: The probability of picking any one of those bytes sho... read more
View answer (1)

Software Developer Interview Questions asked at other Companies

Q1. Maximum Subarray Sum Problem Statement Given an array of integers, determine the maximum possible sum of any contiguous subarray within the array. Example: Input: array = [34, -50, 42, 14, -5, 86] Output: 137 Explanation: The maximum sum is... read more
View answer (42)

I applied via Naukri.com and was interviewed in Jun 2021. There was 1 interview round.

Interview Questionnaire 

6 Questions

  • Q1. Job I need immediately
  • Q2. I need interview
  • Q3. I will work I need salery
  • Q4. I will work perfectly
  • Q5. What ever it may be I will perfect job
  • Q6. Wt u need u do

Interview Preparation Tips

Interview preparation tips for other job seekers - Immediately

Railway jobs NON-Technical jobs Interview Questions asked at other Companies

Q1. How to check
View answer (1)

I applied via LinkedIn and was interviewed in Nov 2020. There were 3 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. Protocol-related questions and general SV UVM, with a major focus on Coverage and Constraints.

Interview Preparation Tips

Interview preparation tips for other job seekers - Have a clear understanding of the protocol that you have mentioned in the resume as the questions will be very complicated and application-based.

Senior Member of Technical Staff Interview Questions asked at other Companies

Q1. Reverse LL using recursion, Find the path in a btree that sums closest to a value K
View answer (1)

Mentor Graphics interview questions for popular designations

 Member Technical Staff

 (2)

 Senior Member of Technical Staff

 (2)

 Software Developer

 (2)

 Intern

 (2)

 Graphic Designer

 (1)

 Functional Verification Engineer/ Team Lead Verification

 (1)

 Fire Supervisor

 (1)

 Embedded Software Engineer

 (1)

I applied via Naukri.com and was interviewed before Jan 2020. There were 3 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. I was asked question on Data Structures and C++ mostly.

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare data structures and algorithm well. Use gfg and interview bit for DS. Also use learncpp.com for oops related questions.

Senior Member of Technical Staff Interview Questions asked at other Companies

Q1. Reverse LL using recursion, Find the path in a btree that sums closest to a value K
View answer (1)

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

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 random byte. Note: The probability of picking any one of those bytes sho... read more
View answer (1)

Software Developer Interview Questions asked at other Companies

Q1. Maximum Subarray Sum Problem Statement Given an array of integers, determine the maximum possible sum of any contiguous subarray within the array. Example: Input: array = [34, -50, 42, 14, -5, 86] Output: 137 Explanation: The maximum sum is... read more
View answer (42)

I was interviewed in Feb 2017.

Interview Questionnaire 

11 Questions

  • Q1. About your work experience
  • Q2. Sequence detector
  • Q3. I2c protocol thoroughly
  • Q4. Spi protocol
  • Q5. Difference between spi & i2c,difference between latch & ff
  • Ans. 

    SPI and I2C are communication protocols used for connecting devices, while latch and FF are different types of sequential logic elements.

    • SPI (Serial Peripheral Interface) and I2C (Inter-Integrated Circuit) are both serial communication protocols used for connecting devices in embedded systems.

    • SPI uses separate lines for data input and output, while I2C uses a shared bus for both input and output.

    • SPI supports higher dat...

  • Answered by AI
  • Q6. 3 box contains ballls,labels are different for them all
  • Q7. 2 identical pills
  • Q8. Find the average speed for a particular ditance is the average speed while going is x.find out the speed of whole trip...(something like that)
  • Ans. 

    To find the average speed for the whole trip, we need to know the distance and the time taken for the trip.

    • Average speed = Total distance / Total time

    • If the distance and time for the trip are known, the average speed can be calculated.

    • If only the average speed while going is known, we cannot determine the speed of the whole trip without additional information.

  • Answered by AI
  • Q9. A circular wheel and a sensor.find out the direction of rotation(related to digital)
  • Q10. Cricket match.maximum run achieved by batsman(he dropped the idea of asking as i have 0 knowledge of game)
  • Q11. Probability of getting heads maximum two times
  • Ans. 

    The probability of getting heads maximum two times in a series of coin flips.

    • To calculate the probability, divide the number of favorable outcomes by the total number of possible outcomes.

    • In this case, the favorable outcomes are 0, 1, or 2 heads, and the total possible outcomes are 2^n, where n is the number of coin flips.

    • For example, if we flip a coin 3 times, the favorable outcomes are HHT, HTH, THH, HHH, TTH, THT, a...

  • Answered by AI

Interview Preparation Tips

Round: Resume Shortlist
Experience: As i was following the mentor grphics on linkedin so i applied for the same post by sending my resume to hr directly.Then after 2 days got a call regarding the F2F round.
Tips: Please do follow linkedin and naukari site daily to get a better opportunity

Round: Technical Interview
Experience: they took 3 technical rounds and asked sequence detector in all the round(it was not in my work experience,ma be something specific they want...:))...it was a good experience
Tips: please go through with your basics and your work exp..they will grind you at any point

Round: Puzzle Interview
Experience: each round has puzzle round with minimum 3 puzzles
Tips: please check all the online frequently asked puzzles.

Skills: Verilog Skills, C Language Basics, VHDL (VHSIC Hardware Description Language)

Skills evaluated in this interview

Functional Verification Engineer/ Team Lead Verification Interview Questions asked at other Companies

Q1. find the average speed for a particular ditance is the average speed while going is x.find out the speed of whole trip...(something like that)
View answer (1)

Interview Questions & Answers

user image Anonymous

posted on 24 Jan 2015

Interview Preparation Tips

Round: Test
Experience: Academic criteria:
CGPA > 7 + Programming Proficiency + Digital Electronics knowledge + Basic VLSI knowledge + Good puzzle solving skills + Algorithm development 
1.5 hrs subjective written test on maths, C questions, algorithms and very difficult puzzles.
Tips: You need fast thinking for the puzzles.
Duration: 90 minutes

Round: Technical Interview
Experience: Technical interviews + 1 HR interview. The Technical interviews went on for an hour each. The problem was developing an algorithm for a given real life problem. Eradicate problems and build a better algorithm. Write a program on the spot. VLSI timing questions were also asked.

General Tips: Projects that required high level coding ability will help.
Skill Tips: Basically the course of VIPES is highly suited for the company.
Skills: Hardcore C programming, VHDL, puzzles, Digital electronics brush up, Data Structures, Verilog
College Name: IIT KHARAGPUR

Mentor Graphics Interview FAQs

How many rounds are there in Mentor Graphics interview?
Mentor Graphics interview process usually has 2-3 rounds. The most common rounds in the Mentor Graphics interview process are Resume Shortlist, Technical and One-on-one Round.
How to prepare for Mentor Graphics interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at Mentor Graphics. The most common topics and skills that interviewers at Mentor Graphics expect are C++, Java, Linux, Programming and Software Development.
What are the top questions asked in Mentor Graphics interview?

Some of the top questions asked at the Mentor Graphics interview -

  1. You have a stream of bytes from which you can read one byte at a time. You only...read more
  2. find the average speed for a particular ditance is the average speed while goin...read more
  3. Find a number a matrix mat[m][n] where all the rows and columns are sorted non-...read more

Tell us how to improve this page.

Mentor Graphics Interview Process

based on 6 interviews

Interview experience

4.5
  
Good
View more

Interview Questions from Similar Companies

Dassault Systemes Interview Questions
4.0
 • 160 Interviews
Synopsys Interview Questions
3.8
 • 89 Interviews
PTC Interview Questions
4.2
 • 62 Interviews
MathWorks Interview Questions
3.9
 • 41 Interviews
Autodesk Interview Questions
4.3
 • 39 Interviews
View all

Mentor Graphics Reviews and Ratings

based on 55 reviews

4.0/5

Rating in categories

3.9

Skill development

4.3

Work-life balance

3.9

Salary

4.5

Job security

3.8

Company culture

3.8

Promotions

3.8

Work satisfaction

Explore 55 Reviews and Ratings
Senior Member of Technical Staff
70 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Lead Member Technical Staff
43 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Member Consulting Staff
35 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Engineer
29 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Member Technical Staff
25 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Mentor Graphics with

Cadence Design Systems

4.1
Compare

Synopsys

3.9
Compare

Ansys Software Private Limited

3.9
Compare

Autodesk

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