Upload Button Icon Add office photos

Mentor Graphics

Compare button icon Compare button icon Compare

Filter interviews by

Clear (1)

Mentor Graphics Member Technical Staff Interview Questions and Answers

Updated 2 Aug 2024

Mentor Graphics Member Technical Staff Interview Experiences

2 interviews found

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-

I applied via Campus Placement

Round 1 - Technical 

(2 Questions)

  • Q1. Verilog coding of various flip flops and fsm
  • Ans. 

    Verilog coding of flip flops and FSM involves designing sequential circuits using Verilog HDL.

    • Understand the functionality of different flip flops like D flip flop, JK flip flop, etc.

    • Implement flip flops using Verilog syntax, specifying input and output ports.

    • Design Finite State Machines (FSM) using Verilog, defining states, transitions, and outputs.

    • Use Verilog constructs like always blocks, case statements, and state

  • Answered by AI
  • Q2. Basic electronics questions
Round 2 - HR 

(1 Question)

  • Q1. Why do you want to join Siemens?
  • Ans. 

    I want to join Siemens because of its reputation for innovation and commitment to sustainability.

    • Siemens is a global leader in technology and innovation

    • I am impressed by Siemens' focus on sustainability and corporate social responsibility

    • I believe working at Siemens will provide me with opportunities for professional growth and development

  • Answered by AI

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Referral and was interviewed before Jun 2023. There was 1 interview round.

Round 1 - Technical 

(2 Questions)

  • Q1. Question on Linked List
  • Q2. Question on bottom view of binary tree

Interview Preparation Tips

Interview preparation tips for other job seekers - Practice LinkedList, Trees and Graphs

Member Technical Staff Interview Questions Asked at Other Companies

Q1. Next Smallest Palindrome Problem Statement Find the next smallest ... read more
asked in Salesforce
Q2. Buy and Sell Stock Problem Statement Imagine you are Harshad Meht ... read more
Q3. Check Permutation Problem Statement Given two strings 'STR1' and ... read more
asked in Salesforce
Q4. Optimal Strategy for a Coin Game You are playing a coin game with ... read more
asked in Salesforce
Q5. Longest Happy String Problem Statement Given three non-negative i ... read more

Interview questions from similar companies

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
No response

I applied via Referral and was interviewed in Sep 2024. There were 3 interview rounds.

Round 1 - Coding Test 

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

Round 2 - Technical 

(2 Questions)

  • 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
  • Q2. Cpp question based on OOPs concepts
Round 3 - Coding Test 

DSA questions on graph and lots of puzzles

Interview Preparation Tips

Topics to prepare for Ansys Software Private Limited Senior Engineer interview:
  • C++
  • DSA
  • OOPS
  • Puzzles
Interview preparation tips for other job seekers - Overall good experience, but the HR hasn't replied yet.

Skills evaluated in this interview

Interview experience
2
Poor
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Not Selected

I was interviewed in Nov 2023.

Round 1 - Coding Test 

F2F coding test which was pretty simple based on basic c++ concepts and few logical questions.

Round 2 - Technical 

(1 Question)

  • Q1. Project and design level with mid level difficulty.
Round 3 - Culture fit 

(2 Questions)

  • Q1. Oops.here the magic happened. Prior to each stage HR was giving clue about the next round and the rounds were more or less same. But in this round,no was expecting managerial question and was not prepared ...
  • Q2. Array multiple logical questions, design pattern writing, other class relates coding..

I applied via Referral and was interviewed before Dec 2020. There were 3 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. Signal and power integrity question

Interview Preparation Tips

Interview preparation tips for other job seekers - Learn about package design also

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

Software Developer Interview Questions & Answers

PTC user image Snehal Jaipurker

posted on 18 Sep 2017

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

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

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

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

  • Answered by AI
  • Q5. They asked for my introduction.
  • Q6. They asked about my family members.

Interview Preparation Tips

Round: Test
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

I was interviewed before Apr 2021.

Round 1 - Coding Test 

(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, S and X, your task is to find the smallest substring in S that contains all the characters present in X.

    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.

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

  • Answered by AI
Round 2 - Video Call 

(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...

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

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

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

  • Answered by AI
Round 3 - Video Call 

(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 arr of length N. 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...

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

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

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPACadence Design Systems interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, OS, DBMS, Aptitude, OOPSTime required to prepare for the interview - 4 MonthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before May 2021.

Round 1 - Aptitude Test 

Duration: 45 minutes
Topics: MCQ on C and C++, Quantitative Aptitude question from S. Chand and R.S. Agarwal

Round 2 - Coding Test 

Question-related to current work.
Questions on data structure, and topics include link list and trees.
C++: Inheritance, Vtable, and templates.

Interview Preparation Tips

Interview preparation tips for other job seekers - Practice easy to medium problems on HackerRank. And also brush up on quantitative aptitude questions to solve them in the given time.
Interview experience
5
Excellent
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Campus Placement and was interviewed in Feb 2024. There were 2 interview rounds.

Round 1 - Aptitude Test 

Digital electronics, circuits , verilog , asic design flow

Round 2 - Technical 

(2 Questions)

  • Q1. Explain the complete asic design flow process
  • Ans. 

    ASIC design flow process involves steps like specification, design, verification, synthesis, and testing.

    • Specification: Define requirements and constraints for the ASIC design.

    • Design: Create a high-level design based on the specifications.

    • Verification: Verify the design using simulations and tests.

    • Synthesis: Convert the design into a netlist of gates and connections.

    • Testing: Test the fabricated ASIC to ensure functiona...

  • Answered by AI
  • Q2. Power reduction techniques in CMOS
  • Ans. 

    Power reduction techniques in CMOS involve various methods to minimize power consumption in CMOS circuits.

    • Use of power gating to selectively turn off power to unused circuit blocks

    • Implementing clock gating to disable clock signals to unused circuitry

    • Utilizing voltage scaling to reduce power consumption at lower voltages

    • Applying dynamic voltage and frequency scaling to adjust voltage and frequency based on workload

    • Using...

  • Answered by AI
Contribute & help others!
anonymous
You can choose to be anonymous

Mentor Graphics Interview FAQs

How many rounds are there in Mentor Graphics Member Technical Staff interview?
Mentor Graphics interview process usually has 1-2 rounds. The most common rounds in the Mentor Graphics interview process are Technical and HR.
What are the top questions asked in Mentor Graphics Member Technical Staff interview?

Some of the top questions asked at the Mentor Graphics Member Technical Staff interview -

  1. Verilog coding of various flip flops and ...read more
  2. Question on bottom view of binary t...read more
  3. Question on Linked L...read more

Recently Viewed

INTERVIEWS

Atlassian

No Interviews

INTERVIEWS

Atlassian

No Interviews

INTERVIEWS

Atlassian

No Interviews

SALARIES

DBS Bank

INTERVIEWS

Siemens EDA

No Interviews

INTERVIEWS

Atlassian

No Interviews

INTERVIEWS

Atlassian

No Interviews

INTERVIEWS

Atlassian

No Interviews

SALARIES

Mentor Graphics

JOBS

L&T Technology Services

No Jobs

Tell us how to improve this page.

Mentor Graphics Member Technical Staff Interview Process

based on 2 interviews

Interview experience

4.5
  
Good
View more

Interview Questions from Similar Companies

Dassault Systemes Interview Questions
4.0
 • 161 Interviews
Synopsys Interview Questions
3.9
 • 88 Interviews
PTC Interview Questions
4.2
 • 62 Interviews
MathWorks Interview Questions
3.9
 • 41 Interviews
Autodesk Interview Questions
4.2
 • 38 Interviews
Mobileum Interview Questions
3.3
 • 37 Interviews
View all
Mentor Graphics Member Technical Staff Salary
based on 25 salaries
₹10 L/yr - ₹20.2 L/yr
6% more than the average Member Technical Staff Salary in India
View more details

Mentor Graphics Member Technical Staff Reviews and Ratings

based on 2 reviews

5.0/5

Rating in categories

5.0

Skill development

5.0

Work-life balance

5.0

Salary

5.0

Job security

5.0

Company culture

5.0

Promotions

5.0

Work satisfaction

Explore 2 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.0
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
Rate your experience using AmbitionBox
Terrible
Terrible
Poor
Poor
Average
Average
Good
Good
Excellent
Excellent