i
CADFEM India Private Limited
Filter interviews by
I applied via Naukri.com and was interviewed in Dec 2023. There was 1 interview round.
I applied via Campus Placement and was interviewed before Feb 2023. There were 2 interview rounds.
It is gamification based test
Top trending discussions
I was interviewed in Jul 2017.
Code to print * in five consecutive lines
Use a loop to iterate five times
Inside the loop, print a string containing a single * character
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
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
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
I applied via Recruitment Consultant and was interviewed in Dec 2020. There were 4 interview rounds.
posted on 31 May 2022
I was interviewed 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.
Commands of docker, git
Mcq questions , c++ java basic aptitube
I was interviewed before Mar 2024.
Not much harder mostly focus on basic coding Questions
I applied via Campus Placement and was interviewed in Dec 2022. There were 3 interview rounds.
First 20 question for apti and then coding round of 20 questions each from c/c++ , java and SQL
No, multiple inheritance is not allowed in Java.
Java does not support multiple inheritance for classes to avoid the diamond problem.
However, multiple inheritance is allowed for interfaces in Java.
Example: class A extends B, C is not allowed, but interface A extends B, C is allowed.
Inheritance is a concept in object-oriented programming where a class inherits properties and behaviors from another class.
Allows a class to inherit attributes and methods from another class
Promotes code reusability and reduces redundancy
Creates a parent-child relationship between classes
Example: Class 'Car' can inherit properties and methods from class 'Vehicle'
Polymorphism in software development is like a person driving different vehicles using the same driving skills.
Polymorphism allows objects of different classes to be treated as objects of a common superclass.
For example, a superclass 'Shape' can have subclasses like 'Circle' and 'Rectangle' which can be treated as 'Shape' objects.
Calling a method like 'draw()' on a 'Shape' object will execute the specific implementatio...
posted on 31 Aug 2015
I am a software engineer with 5 years of experience in developing web applications using Java and JavaScript.
I have a Bachelor's degree in Computer Science.
I am proficient in Spring Framework and AngularJS.
I have worked on projects involving RESTful APIs and microservices architecture.
I am a quick learner and enjoy working in a team environment.
I am impressed with the company's innovative approach and commitment to excellence.
I have researched the company and its products extensively and am excited about the potential for growth and development.
I am impressed with the company's reputation for innovation and cutting-edge technology.
I believe that the company's commitment to excellence aligns with my own values and goals.
I am excited about the opportunity to wo...
My future plans include continuous learning, honing my skills, and contributing to the growth of the company.
I plan to attend relevant conferences and workshops to stay updated with the latest technologies.
I want to work on challenging projects that will help me improve my skills.
I aim to become a valuable asset to the company by contributing to its growth and success.
I plan to mentor and guide junior developers to hel
based on 6 interviews
Interview experience
based on 23 reviews
Rating in categories
Territory Sales Manager
14
salaries
| ₹0 L/yr - ₹0 L/yr |
Applications Engineer
14
salaries
| ₹0 L/yr - ₹0 L/yr |
Simulator Engineer
12
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Application Engineer
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Inside Sales Associate
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Ansys Software Private Limited
Siemens PLM Software
Altair Engineering
Dassault Systemes