i
Ansys Software Private Limited
Filter interviews by
I applied via Job Portal and was interviewed before Jun 2023. There was 1 interview round.
Recursion tree for a given code
Identify the base case of the recursion
Draw a tree structure with each recursive call as a node
Label each node with the input parameters and return values
I appeared for an interview before May 2021.
Round duration - 90 minutes
Round difficulty - Easy
Timing - 10AM-11:30AM
Online proctored test
Given a binary tree of integers, your task is to print the right view of it. The right view represents a set of nodes visible when the tree is viewed from the righ...
The task is to print the right view of a binary tree, representing nodes visible from the right side in top-to-bottom order.
Traverse the tree level by level and keep track of the rightmost node at each level
Print the rightmost node of each level to get the right view of the tree
Use a queue for level order traversal and a map to store the rightmost nodes
A thief is planning to rob a store and can carry a maximum weight of 'W' in his knapsack. The store contains 'N' items where the ith item has a weight of 'wi' and a value of...
Yes, the 0/1 Knapsack problem can be solved using dynamic programming with a space complexity of not more than O(W).
Use a 1D array to store the maximum value that can be stolen for each weight from 0 to W.
Iterate through each item and update the array based on whether including the item would increase the total value.
The final value in the array at index W will be the maximum value that can be stolen.
Round duration - 45 minutes
Round difficulty - Medium
Timing : 4PM-5PM
Environment - Online
There was a panel of 3 interviewers
You can find the size of an array in C or C++ by dividing the total size of the array by the size of one element.
Calculate the total size of the array by multiplying the number of elements by the size of each element.
Divide the total size by the size of one element to get the size of the array.
For example, if you have an array of strings arr[] = {'hello', 'world', 'example'}, you can find the size by dividing the total
B+ trees are used for indexing in databases to efficiently search and retrieve data.
B+ trees are balanced trees where each node can have multiple keys and child pointers.
Data is stored in leaf nodes, while non-leaf nodes are used for navigation.
B+ trees are commonly used in databases because of their ability to efficiently search and retrieve data.
Example: In a database table with an index on a specific column, B+ tree...
Round duration - 45 mintues
Round difficulty - Easy
Timing - 11AM-12:15PM
Environment - online video call
Again there was a panel of 2 senior engineers
You are given an n-ary tree consisting of 'N' nodes. Your task is to determine the maximum sum of the path from the root to any leaf node.
For the giv...
Find the maximum sum of the path from the root to any leaf node in an n-ary tree.
Traverse the tree from root to leaf nodes while keeping track of the sum of each path.
At each node, calculate the sum of the path from the root to that node and update the maximum sum found so far.
Consider using depth-first search (DFS) or breadth-first search (BFS) for tree traversal.
Handle cases where nodes have negative values or where
Tip 1 : Brush Up on Computer Science Fundamentals
Tip 2 : Prepare a Brief Self-Introduction
Tip 1 : Do not put fake resume
Tip 2 : Writing internship project helps.
posted on 31 Dec 2020
I applied via Naukri.com and was interviewed in Jul 2020. There were 3 interview rounds.
posted on 26 Apr 2022
posted on 29 Nov 2022
Pattern program
Multithreading program
And overriding program
posted on 13 Jan 2023
I applied via Naukri.com and was interviewed before Jan 2022. There were 2 interview rounds.
posted on 12 Jan 2024
I applied via Campus Placement and was interviewed in Dec 2023. There was 1 interview round.
A class is a blueprint for creating objects, while an object is an instance of a class. Private, protected, public, and default are access modifiers in object-oriented programming.
A class is a template or blueprint that defines the properties and behaviors of objects.
An object is an instance of a class, created using the class blueprint.
Private access modifier restricts access to class members within the same class.
Pro...
An object is a self-contained entity that consists of both data and behavior.
Objects are instances of classes in object-oriented programming.
They encapsulate data and provide methods to manipulate that data.
Objects can interact with each other through method calls and message passing.
Examples of objects include a car, a person, or a bank account.
Public is a keyword in programming languages that denotes the accessibility of a class, method, or variable.
Public is one of the access modifiers in object-oriented programming.
It allows the class, method, or variable to be accessed from any other class or package.
Public members are part of the public API of a software component.
Example: public class MyClass { ... }
Example: public void myMethod() { ... }
Example: public
In programming, private is an access modifier that restricts the visibility of a class member to within its own class.
Private is used to encapsulate data and prevent direct access from outside the class.
Private members can only be accessed through public methods or properties.
Private variables are often used to store internal state or implementation details.
Private methods are used for internal logic and are not meant
protected is an access modifier in object-oriented programming that restricts access to members within the same package or subclasses.
protected is one of the four access modifiers in Java, along with public, private, and default.
Members declared as protected can be accessed within the same package or by subclasses.
Protected members are not accessible outside the package unless accessed through inheritance.
Example: prot...
posted on 27 Feb 2024
I applied via Recruitment Consulltant and was interviewed before Feb 2023. There were 4 interview rounds.
That was conducted in my College and it was online assessment for aptitude
The == operator checks for equality, while the === operator checks for strict equality (including data type).
The == operator only checks for equality of values, not data types.
The === operator checks for both equality of values and data types.
Example: 5 == '5' would return true, but 5 === '5' would return false.
posted on 17 Feb 2022
I applied via LinkedIn and was interviewed in Aug 2021. There were 2 interview rounds.
based on 1 interview
Interview experience
based on 2 reviews
Rating in categories
R&D Engineer
53
salaries
| ₹14 L/yr - ₹25 L/yr |
Applications Engineer
34
salaries
| ₹12.5 L/yr - ₹30.5 L/yr |
Senior R&D Engineer
33
salaries
| ₹22 L/yr - ₹45 L/yr |
Senior Application Engineer
28
salaries
| ₹17 L/yr - ₹28 L/yr |
Technical Support Engineer
26
salaries
| ₹12 L/yr - ₹16.5 L/yr |
Autodesk
Apisero
Actalent Services
Cyber Infrastructure