Upload Button Icon Add office photos

Filter interviews by

Mentor Graphics Software Developer Interview Questions, Process, and Tips

Updated 20 Feb 2023

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
View all 8 questions

Mentor Graphics Software Developer Interview Experiences

2 interviews found

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.

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

Software Developer Interview Questions Asked at Other Companies

asked in Amazon
Q1. Maximum Subarray SumGiven an array of numbers, find the maximum s ... read more
asked in Cognizant
Q2. Nth Fibonacci NumberNth term of Fibonacci series F(n), where F(n) ... read more
asked in Rakuten
Q3. Merge two sorted arraysNinja has been given two sorted integer ar ... read more
asked in GlobalLogic
Q4. Terms Of APAyush is given a number ‘X’. He has been told that he ... read more
asked in Amazon
Q5. Minimum Number of Platform NeededYou are given the arrival and de ... read more

Interview questions from similar companies

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I was interviewed in Nov 2024.

Round 1 - HR 

(2 Questions)

  • Q1. Experience in past proyects
  • Ans. 

    I have worked on various projects ranging from web development to mobile app development, gaining experience in different technologies and frameworks.

    • Developed a web application using React.js and Node.js for a client in the e-commerce industry

    • Created a mobile app using Flutter for a startup in the travel sector

    • Collaborated with a team to implement a machine learning algorithm for data analysis in a research project

  • Answered by AI
  • Q2. Experience leading a group of develeopers
  • Ans. 

    Led a team of developers on a project to develop a new software application.

    • Managed a team of 5 developers to ensure project deadlines were met

    • Assigned tasks to team members based on their strengths and expertise

    • Held regular team meetings to discuss progress and address any issues

    • Provided guidance and support to team members when needed

    • Collaborated with other departments to gather requirements and feedback

  • Answered by AI
Round 2 - Technical 

(2 Questions)

  • Q1. It was more like a talk about your experience
  • Q2. Code test to create a small search enginee
  • Ans. 

    Code test to create a small search engine

    • Create a function that takes a search query and an array of strings as input

    • Iterate through the array of strings to find matches with the search query

    • Return an array of strings that contain the search query

  • Answered by AI
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

It was combination of mcqs and 2 coding questions

Round 2 - Technical 

(3 Questions)

  • Q1. What is oops concepts
  • Ans. 

    Object-oriented programming concepts that focus on objects and classes for better code organization and reusability.

    • Encapsulation: Bundling data and methods that operate on the data into a single unit (class).

    • Inheritance: Ability of a class to inherit properties and behavior from another class.

    • Polymorphism: Ability to present the same interface for different data types.

    • Abstraction: Hiding the complex implementation det...

  • Answered by AI
  • Q2. Difference between java nd putjon
  • Ans. 

    Java is a programming language while Putjon is not a recognized term in software development.

    • Java is a widely used programming language for developing applications.

    • Putjon is not a recognized term in software development, it may be a typo or a specific term not commonly used.

    • There is no direct comparison between Java and Putjon as they are not related.

  • Answered by AI
  • Q3. Tell about ur project
Round 3 - One-on-one 

(2 Questions)

  • Q1. What are your strengths
  • Q2. What is ur greatest comeback

Skills evaluated in this interview

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

I was interviewed in Aug 2024.

Round 1 - Coding Test 

Medium level leetcode question

Round 2 - Technical 

(2 Questions)

  • Q1. Explain about your project
  • Ans. 

    Developed a web application for managing inventory and sales for a retail store.

    • Used React.js for front-end development

    • Implemented RESTful APIs using Node.js and Express for back-end

    • Utilized MongoDB for database management

    • Incorporated authentication and authorization features for secure access

  • Answered by AI
  • Q2. Explain functionalities in detail
  • Ans. 

    Functionalities in software development refer to the specific tasks or actions that a software program can perform.

    • Functionalities are the specific features or capabilities of a software program.

    • They define what the software can do and how it can be used.

    • Examples of functionalities include user authentication, data encryption, and file management.

    • Functionalities can be implemented through code modules or libraries.

    • Test...

  • Answered by AI
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Selected Selected

I was interviewed in Aug 2024.

Round 1 - Coding Test 

Hackertank Test containing dsa question

Round 2 - HR 

(2 Questions)

  • Q1. Define success for you
  • Ans. 

    Success for me is achieving personal and professional goals while maintaining a healthy work-life balance.

    • Achieving personal goals such as learning new technologies or completing a project

    • Receiving positive feedback from colleagues or clients

    • Maintaining a healthy work-life balance by setting boundaries and taking time for self-care

    • Feeling fulfilled and satisfied with my work

  • Answered by AI
  • Q2. Why changing your job
  • Ans. 

    Seeking new challenges and opportunities for growth in a different environment.

    • Looking for a new challenge to expand my skills and knowledge

    • Interested in exploring different technologies and industries

    • Seeking better career advancement opportunities

    • Wanting to work in a more collaborative team environment

  • Answered by AI
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
-
Result
-
Round 1 - Coding Test 

Coding test was medium to hard leetcode problems.

I applied via Referral and was interviewed in Apr 2022. There was 1 interview round.

Round 1 - One-on-one 

(1 Question)

  • Q1. I was asked about pascals triangle and basic questions from oops, dbms, SQL, networking and other topics.

Interview Preparation Tips

Interview preparation tips for other job seekers - Revise DSA and study all theory subjects.

I was interviewed before Apr 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

The second round is also written but you need to write programming based on their concept.

  • Q1. Find prime numbers

    You are given a positive integer ‘N’. Your task is to print all prime numbers less than or equal to N.

    Note: A prime number is a natural number that is divisible only by 1 and itself. ...

  • Ans. 

    The naïve approach for this question is to run a loop from the start to the end number. And for each number, check if it is prime or not. If the number is prime, we print it otherwise skip it.

    One optimization to this approach would be to skip all even numbers (except 2 if present in interval) since even numbers are not prime.
    Function to check if a number is prime or not :
    isPrime(n):
    if (n <= 1) return false
    for (i=2;

  • Answered by CodingNinjas
  • Q2. Check If The String Is A Palindrome

    You are given a string 'S'. Your task is to check whether the string is palindrome or not. For checking palindrome, consider alphabets and numbers only and ignor...

  • Ans. 

    The idea is to create a copy of num and recursively pass the copy by reference, and pass num by value. In the recursive calls, divide num by 10 while moving down the recursion tree. While moving up the recursion tree, divide the copy by 10. When they meet in a function for which all child calls are over, the last digit of num will be ith digit from the beginning and the last digit of copy will be ith digit from the end

  • Answered by CodingNinjas
Round 2 - Face to Face 

(6 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Technical round with questions mainly on Java and OOPS concepts.

  • Q1. Java Question

    Difference between Static methods and Instance methods

  • Ans. 

    Instance method can access the instance methods and instance variables directly.
    Instance method can access static variables and static methods directly.
    Static methods can access the static variables and static methods directly.
    Static methods can’t access instance methods and instance variables directly. They must use reference to object. And static method can’t use this keyword as there is no instance for ‘this’ to ref

  • Answered by CodingNinjas
  • Q2. Java Question

    Difference between Abstract Class and Interface

  • Ans. 

    1) Abstract class can have abstract and non-abstract methods. Interface can have only abstract methods. Since Java 8, it can have default and static methods also.
    2) Abstract class doesn't support multiple inheritance. Interface supports multiple inheritance.
    3) Abstract class can have final, non-final, static and non-static variables. Interface has only static and final variables.
    4) Abstract class can provide the implem...

  • Answered by CodingNinjas
  • Q3. Java Question

    ClassNotFoundException Vs NoClassDefFoundError in Java

  • Ans. 

    1. As the name suggests, ClassNotFoundException is an exception while NoClassDefFoundError is an error.
    2. ClassNotFoundException occurs when classpath does not get updated with required JAR files while error occurs when the required class definition is not present at runtime.

  • Answered by CodingNinjas
  • Q4. Java Question

    Difference between Error and Exception

  • Ans. 

    1 Type : 
    Error : Classified as an unchecked type 
    Exception : Classified as checked and unchecked 
    2 Package :
    Error : It belongs to java.lang.error 
    Exception : It belongs to java.lang.Exception 
    3 Recoverable/ Irrecoverable : 
    Error : It is irrecoverable
    Exception : It is recoverable
    4 Error : It can't be occur at compile time 
    Exception : It can occur at run time compile time both 
    5 Ex...

  • Answered by CodingNinjas
  • Q5. Java Question

    What is SerialVersionUID?

  • Ans. 

    The serialization at runtime associates with each serializable class a version number called a serialVersionUID, which is used during deserialization to verify that the sender and receiver of a serialized object have loaded classes for that object that are compatible with respect to serialization.

  • Answered by CodingNinjas
  • Q6. Java Question

    What are the requirement for creating a Immutable Class in Java?

  • Ans. 

    Following are the requirements: 

    The class must be declared as final so that child classes can’t be created.
    Data members in the class must be declared private so that direct access is not allowed.
    Data members in the class must be declared as final so that we can’t change the value of it after object creation.
    A parameterized constructor should initialize all the fields performing a deep copy so that data members can...

  • Answered by CodingNinjas

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAYodlee interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, 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 in Apr 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 120 Minutes
Round difficulty - Medium

I was MCQ + Coding round, Their were MCQ Based on DSA, Aptitude and 2 easy coding questions.

  • Q1. Ninja Competition

    Our hero Ninja is organizing a coding competition where only two teams can participate simultaneously. To make the competition interesting and fair, both the teams should have an equal nu...

  • Ans. Brute Force

    We will iterate from 1 to ‘N’ and count the number of even divisors and odd divisors. If they are equal, we will return true, else false.

     

    Algorithm:

     

    1. Declare two variables, ‘Odd_Count’ and ‘Even_Count’, and initialize them with zero.
    2. Start iterating from 1 to ‘N’.
    3. If the current iterator ( say i ) is a divisor of ‘N’ ( N % i == 0 ):
      1. If ‘i’ is odd, increase the ‘Odd_Count’ by 1.
      2. If ‘i’ is even, increase ...
  • Answered by CodingNinjas
  • Q2. Help Bob Out!

    Bob has just turned 18 years old and has opened a Bank account. However, since he has just opened his bank account he is not very experienced about the working of banks, therefore he asks for...

  • Ans. Brute Force

    To check whether the string is a valid IFSC Code or not we can check every character of the string explicitly and check whether the string is in the correct format or not.

     

    Algorithm:-

    1. If the length of the string is not equal to 11, return False.
    2. Else, iterate from the first index to the fourth index.
      1. Check whether the ASCII values of the characters lie between 65 - 90. If not, return False.
    3. If yes, check wh...
  • Answered by CodingNinjas
Round 2 - Video Call 

(2 Questions)

Round duration - 50 Minutes
Round difficulty - Easy

The nature of the interviewer was very kind. The test was proctored, our webcam and mic were on, and shared my screen.

  • Q1. OOPS Questions

    Tell me somethings about OOPs.
    Functional v/s OOPS programming language
    Polymorphism
    Static and Final Keyword in JAVA

  • Q2. Technical Questions

    Explain your project.
    Show working of your project.
    Tech stack used.
    Rest API
    There are 3 boxes of green, orange and green+orange. how will you know the all boxes after picking from one box ...

Round 3 - Video Call 

(1 Question)

Round duration - 50 minutes
Round difficulty - Easy

The nature of the interviewer was very kind. The test was proctored, our webcam and mic were on, and shared my screen.

  • Q1. Technical Questions

    Tree traversal(Pre-order, Post-order, In-order, Level-order) and code of all orders.
    All type Sorting Algorithms and their use cases
    How will you make 102-102=1
    make 30 using 5 2's

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in BangaloreEligibility criteriaNo criteriaBottomline Technologies interview preparation:Topics to prepare for the interview - Data Structure, Algorithms, Development, Programming Languages, OOPsTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Be strong at your basics.
Tip 2 : Do at least 2 projects and ask to find answers like why are you choosing this tech stack? why did not you choose its alternatives Know your project in and out because they might ask you for a modification in your project?

Application resume tips for other job seekers

Tip 1 : Have some projects on your resume.
Tip 2 : Do not put false things on your resume.
Tip 3 : Try to keep a single-page resume.

Final outcome of the interviewRejected

Skills evaluated in this interview

Mentor Graphics Interview FAQs

How many rounds are there in Mentor Graphics Software Developer interview?
Mentor Graphics interview process usually has 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 Software Developer 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++, DS, Design Development, Programming and Soft Skills.
What are the top questions asked in Mentor Graphics Software Developer interview?

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

  1. You have a stream of bytes from which you can read one byte at a time. You only...read more
  2. Find a number a matrix mat[m][n] where all the rows and columns are sorted non-...read more
  3. Devise an algorithm to determine the Nth-to-Last element in a singly linked lis...read more

Tell us how to improve this page.

Mentor Graphics Software Developer Salary
based on 12 salaries
₹13 L/yr - ₹25 L/yr
163% more than the average Software Developer Salary in India
View more details

Mentor Graphics Software Developer Reviews and Ratings

based on 2 reviews

4.0/5

Rating in categories

3.7

Skill development

4.3

Work-Life balance

3.7

Salary & Benefits

4.3

Job Security

4.3

Company culture

3.7

Promotions/Appraisal

4.3

Work Satisfaction

Explore 2 Reviews and Ratings
Senior Member of Technical Staff
96 salaries
unlock blur

₹12 L/yr - ₹22.1 L/yr

Lead Member Technical Staff
43 salaries
unlock blur

₹19 L/yr - ₹32 L/yr

Member Consulting Staff
35 salaries
unlock blur

₹20 L/yr - ₹56 L/yr

Software Engineer
29 salaries
unlock blur

₹11 L/yr - ₹23 L/yr

Member Technical Staff
28 salaries
unlock blur

₹9 L/yr - ₹20.2 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.3
Compare

Calculate your in-hand salary

Confused about how your in-hand salary is calculated? Enter your annual salary (CTC) and get your in-hand salary
Did you find this page helpful?
Yes No
write
Share an Interview