Mentor Graphics (Siemen EDA) Interview Experience | 2 Years Experienced
Question Details
For Noida LocationF2F Round 1(2hrs):What are virtual functions and virtual destructors?What do mean by static keyword?Difference between pointers and memory reference?When...
Full Details
For Noida Location F2F Round 1(2hrs): What are virtual functions and virtual destructors? What do mean by static keyword? Difference between pointers and memory reference? When some elements at the beginning of an array are moved to the end, it becomes a rotation of the original array. Please implement a function to get the minimum number in a rotation of an increasing sorted array. For example, the array {3, 4, 5, 1, 2} is a rotation of array {1, 2, 3, 4, 5}, of which the minimum is 1. A tree is represented as a matrix M, in which M(i,j) is 1 if 'i' is the parent of 'j'. Write an algorithm to construct the tree from the matrix. Given a list of n distinct integers and a sequence of n boxes with preset inequality signs inserted between them, design an algorithm that places the numbers into the boxes to satisfy those inequalities. For example, the numbers 2, 5, 1, and 0 can be placed in the four boxes as shown below: ||<||<||>|| |0|<|1|<|5|>|2| Detect cycle in a directed and undirected graph. Find errors and output of the program C++ Class A { int x ; }; void fun ( A obj1 ) { obj1 . x = 20 ; } void fun1 ( const A & obj1 ) { obj1 . x = 30 ; } void fun2 ( A * obj1 ) { obj1 -> x = 40 ; } int main () { A obj ; obj . x = 10 ; fun ( obj ); cout << x << endl ; fun1 ( obj ); cout << x << endl ; fun2 ( obj ) cout << x << endl ;
return 0 ; } Difference between new and malloc. F2F Round 2(2hrs): Difference between map and unordered map. What is a static keyword? How can we use non-static variables in static function? What is BST and what is the time complexity of searching an element in an array? Given a matrix of size m*n. Traverse the matrix in spiral form. convert roman numbers to decimal numbers. What are templates and write a syntax for declaring a generic class? Given 100 balls in which one ball is defective. You also have a balance to tell the minimum number of steps to find the defective ball. Puzzle | Measuring Block (https://www.geeksforgeeks.org/aptitude/puzzle-measuring-block/) Write an algorithm to find a kth minimum element from a BST. What are storage classes?
About This Question
This is a reported interview question from a mentor graphics interview for a swe role during the phone screen round reported in 2025.
It covers the following topics: Trees, Binary Tree, Graph, Graphs, Arrays, Matrix .
More Mentor Graphics Interview Questions
About Mentor Graphics Interview Reports
This question was reported by a candidate who interviewed at Mentor Graphics. LeakCode aggregates interview reports from 10+ sources, including 1Point3Acres, Glassdoor, LeetCode Discuss, Blind, Reddit, Indeed, and Nowcoder. Each report is translated where necessary, deduplicated against existing entries, and tagged by company, role, round type, and reporting date.
Use this question as one calibration data point, not a memorization target. Companies typically rotate their question pools every 2-4 months; the exact wording of a 2024 question may differ from what you encounter today. The underlying pattern, difficulty level, and follow-up depth at Mentor Graphics are the higher-signal extractions to take from this report.
For broader preparation context, the Mentor Graphics interview process typically includes a recruiter screen, one or two technical phone screens, and a 4-5 round on-site loop covering coding, system design (at L4+ levels), and behavioral. Reports tagged on LeakCode show the round-by-round distribution and typical difficulty calibration. To browse questions filtered by round type and seniority, use the company hub linked above.
How To Practice This Type of Question
Solve similar problems on LeetCode under timed conditions (25-35 minutes per medium difficulty). The goal is pattern recognition: recognize the underlying technique (sliding window, two-pointer, BFS, memoized recursion, etc.) within 60-90 seconds of reading. Strong candidates verbalize their hypothesis out loud before coding, then iterate based on feedback. Weak candidates dive into implementation immediately, lose time on the wrong approach, and run out of time for follow-ups.
Companies update their question pools every 2-4 months. The exact wording of any given question may have been retired by the time you interview. Focus your prep on the pattern, not the specific problem. The patterns that appear in Mentor Graphics reports consistently are the ones worth investing in; one-off niche problems are not.
During Your Mentor Graphics Round
Apply the standard interview round template: clarify requirements (2-3 minutes), state your approach out loud and confirm direction with the interviewer (3-5 minutes), code with narration (15-25 minutes), test with concrete examples including edge cases (5 minutes), discuss optimization or trade-offs if time permits (5 minutes). This template is universally accepted across FAANG and adjacent companies; deviating from it produces weaker interviewer feedback signal.
The single most predictive failure mode in Mentor Graphics reports tagged "no hire": not asking clarifying questions. Interviewers are explicitly trained to weight this. Strong candidates ask 3-5 clarifying questions even on problems that look obvious; weak candidates dive into code immediately. The clarifying-question check is often the first signal recorded in the interviewer's written notes.