Upload Button Icon Add office photos

Mentor Graphics

Compare button icon Compare button icon Compare

Filter interviews by

Mentor Graphics Software Trainee Intern Interview Questions and Answers

Updated 10 May 2022

Mentor Graphics Software Trainee Intern Interview Experiences

1 interview found

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 - One-on-one 

(1 Question)

  • Q1. Regarding Flip-flops and timers

Interview Preparation Tips

Interview preparation tips for other job seekers - I am yet to do the internsip. For cracking the internship, we should have strength in digital electronics.

Interview questions from similar companies

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

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

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

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

Medium coding qs with technical interview

Round 2 - Technical 

(1 Question)

  • Q1. Reverse an array
  • Ans. 

    Reverse an array of strings

    • Create a new array and iterate through the original array in reverse order, adding each element to the new array

    • Use built-in array methods like reverse() or spread operator for a more concise solution

    • Ensure to handle edge cases like empty array or null values

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

I applied via Campus Placement and was interviewed in Oct 2023. There were 4 interview rounds.

Round 1 - Coding Test 

Topics: maps, sorting and simple DSA question

Round 2 - Technical 

(3 Questions)

  • Q1. What is linked list? How it is stored in memory? Give real examples of linked-list.
  • Ans. 

    A linked list is a data structure where each element points to the next element in the sequence.

    • Linked list is stored in memory as nodes, where each node contains data and a reference to the next node.

    • Examples of linked-list include a singly linked list, doubly linked list, and circular linked list.

    • In a singly linked list, each node points to the next node. In a doubly linked list, each node points to both the next and

  • Answered by AI
  • Q2. How does ML models are built?
  • Ans. 

    ML models are built by collecting and preparing data, selecting a model, training the model on the data, and evaluating its performance.

    • Collect and prepare data by cleaning, transforming, and encoding it

    • Select a model based on the problem at hand (e.g. regression, classification, clustering)

    • Train the model using algorithms like linear regression, decision trees, or neural networks

    • Evaluate the model's performance using ...

  • Answered by AI
  • Q3. Difference between array and linked list.
  • Ans. 

    Arrays store elements in contiguous memory locations, while linked lists store elements in nodes with pointers to the next node.

    • Arrays have fixed size, while linked lists can dynamically grow or shrink.

    • Accessing elements in arrays is faster (O(1)), while accessing elements in linked lists is slower (O(n)).

    • Inserting or deleting elements in arrays can be inefficient, as it may require shifting elements, while in linked l...

  • Answered by AI
Round 3 - Technical 

(2 Questions)

  • Q1. Given string s, return string y which stores first occurrence of characters of s .
  • Ans. 

    Return a string containing the first occurrence of characters in the input string.

    • Create an empty string to store the result.

    • Iterate through each character in the input string.

    • If the character is not already in the result string, add it to the result string.

    • Return the result string.

  • Answered by AI
  • Q2. Describe the hardest DSA questions you have ever done.
  • Ans. 

    One of the hardest DSA questions I have done involved implementing a complex graph traversal algorithm.

    • The question required understanding of graph data structures and algorithms.

    • I had to implement a depth-first search or breadth-first search algorithm.

    • The question may have involved finding the shortest path in a weighted graph.

    • I had to consider edge cases and optimize the algorithm for efficiency.

  • Answered by AI
Round 4 - HR 

(1 Question)

  • Q1. What are your hobbies, plans for future after 5 years?

Interview Preparation Tips

Topics to prepare for Autodesk Software Developer interview:
  • OS
  • OOPS
Interview preparation tips for other job seekers - When you know the answer, be very concise with your answer, try to explain without rambling with minimum word count.
When you don't know the answer try repeating the question back to interviewer to be super clear about the question and then say that currently you don't hold that much clarity about the topic but you will learn it soon.

Skills evaluated in this interview

Interview experience
3
Average
Difficulty level
Easy
Process Duration
2-4 weeks
Result
Selected Selected

I applied via Referral and was interviewed before Sep 2022. There were 4 interview rounds.

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 - Coding Test 

Aptitude Java CI/CD DevOps Unit testing HTML CSS

Round 3 - Technical 

(1 Question)

  • Q1. Technical questions same as above Puzzles to assess problem solving abilities
Round 4 - HR 

(1 Question)

  • Q1. General questions around CTC and expectations
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

2 hours of duration and medium level leetcode questions

Round 2 - Technical 

(2 Questions)

  • Q1. What do you mean by os?
  • Ans. 

    OS stands for Operating System. It is a software that manages computer hardware and provides services for computer programs.

    • OS is the software that acts as an intermediary between computer hardware and user applications.

    • It manages computer resources such as memory, processors, devices, and file systems.

    • Examples of popular operating systems include Windows, macOS, Linux, and Android.

  • Answered by AI
  • Q2. How can deadlock be avoided?
  • Ans. 

    Deadlock can be avoided by implementing proper resource allocation strategies and using techniques like deadlock prevention, avoidance, detection, and recovery.

    • Implement proper resource allocation strategies such as resource ordering, wait-die, wound-wait, etc.

    • Use techniques like deadlock prevention by ensuring that the system never enters a deadlock state, avoidance by ensuring that the system does not enter an unsafe...

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Be confident while answering.

Skills evaluated in this interview

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

I was interviewed in Aug 2023.

Round 1 - Technical 

(1 Question)

  • Q1. Question on merge sort

I was interviewed before Sep 2020.

Round 1 - Video Call 

(3 Questions)

Round duration - 30 minutes
Round difficulty - Easy

  • Q1. How do you search for a node in a linked list?
  • Ans. 

    To search for a node in a linked list, iterate through the list and compare each node's value with the target value.

    • Start at the head of the linked list

    • Iterate through each node by following the 'next' pointer

    • Compare the value of each node with the target value

    • Return the node if found, otherwise return null

  • Answered by AI
  • Q2. How do you detect a loop in a linked list?
  • Ans. 

    To detect a loop in a linked list, we can use Floyd's Cycle Detection Algorithm.

    • Initialize two pointers, slow and fast, at the head of the linked list.

    • Move slow pointer by one step and fast pointer by two steps.

    • If there is a loop, the two pointers will eventually meet.

    • Alternatively, we can use a hash set to store visited nodes and check for duplicates.

  • Answered by AI
  • Q3. Implement a stack using a singly linked list.
  • Ans. 

    Implement a stack using a singly linked list

    • Create a Node class with data and next pointer

    • Create a Stack class with top pointer pointing to the top of the stack

    • Implement push, pop, and peek operations by manipulating the linked list

    • Example: Node class - Node { int data; Node next; }

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 40 minutes
Round difficulty - Easy

  • Q1. What is the top view of a binary tree?
  • Ans. 

    The top view of a binary tree shows the nodes visible from the top when looking down from the root node.

    • The top view of a binary tree is the set of nodes visible from the top when looking down from the root node.

    • Nodes at the same horizontal distance from the root are considered at the same level in the top view.

    • If multiple nodes are at the same horizontal distance, only the topmost node at that level is included in the...

  • Answered by AI
  • Q2. Explain the process of deleting a node from a linked list, covering all possible cases.
  • Ans. 

    Deleting a node from a linked list involves updating pointers to maintain the list's integrity.

    • Identify the node to be deleted by traversing the list

    • Update the previous node's next pointer to skip the node to be deleted

    • Free the memory allocated to the node to be deleted

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Information Technology from Inderprastha Engineering College. I applied for the job as SDE - 1 in NoidaEligibility criteriaminimum 70 %Cadence Design Systems interview preparation:Topics to prepare for the interview - Data Structures and Algorithms, Object-Oriented Programming, System DesignTime required to prepare for the interview - 5 MonthsInterview preparation tips for other job seekers

Do practice a lot of questions on linked list and stacks as these are two most important data structures asked in the interview. Also, try to implement it yourself without seeing the solution. Also prepare for Computer Science subjects like Operating System, Database Management System, Computer Networks, etc. I prepared them through Coding Ninjas notes which were simpler and easy to understand. 

Application resume tips for other job seekers

Keep your resume short and up to mark and check spellings before submitting it for the interview process.

Final outcome of the interviewSelected

Skills evaluated in this interview

Mentor Graphics Interview FAQs

How many rounds are there in Mentor Graphics Software Trainee Intern interview?
Mentor Graphics interview process usually has 2 rounds. The most common rounds in the Mentor Graphics interview process are Resume Shortlist and One-on-one Round.

Tell us how to improve this page.

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