DMI Associate Software Engineer Interview Questions and Answers

Easy to score in coding test. 3 questions of easy medium and hard level

English and aptitude test

Q1. Technical interview on college project and basic ds and algo questions. Asked binary search and some questions on C++
Ans. I explained in detail about my college project. Starting questions were in that.
Answered Anonymously
Add your answer

Q1. Nothing much just a very informal conversation about college.
Ans. A very casual conversation and nothing technical.
Answered Anonymously
Add your answer

Round duration - 90 minutes
Round difficulty - Easy

Timing - 10AM-11:30AM
Online proctored test

Q1. 
Binary Tree Right View Problem Statement
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...read more
Ans. 
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
Answered by AI
Add your answer
Q2. 
0/1 Knapsack Problem Statement
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...read more
Ans. 
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.
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

Timing : 4PM-5PM
Environment - Online

There was a panel of 3 interviewers

Q1. How can you find the size of an array in C or C++ without using sizeof or any standard function?
Ans. 
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...read more
Answered by AI
Add your answer
Q2. Explain how indexing in a database works using B+ trees.
Ans. 
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...read more
Answered by AI
Add your answer

Round duration - 45 mintues
Round difficulty - Easy

Timing - 11AM-12:15PM
Environment - online video call

Again there was a panel of 2 senior engineers

Q1. 
Maximum Path Sum Problem Statement
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.
Example:
Input:
For the giv...read more
Ans. 
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 ...read more
Answered by AI
Add your answer

Q1. Write down the recursion tree for this code:
Ans. 
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
Answered by AI
Add your answer

Apti , html , linux ,sql, java

They give topics and we have to speak for 30 sec

MCQ Test: It had sections of Apti, code snippets, Linux commands and HTML, CSS related (I think it had sectional cut off)..

Group Discussion: 8-10 members in a group and expect you to discuss on a given topic for at least 30s. They only check on whether you are capable of speaking good english or not.

Q1. Mostly questions based on your resume. Having Java as your main language would give you a huge boost.
Add your answer
Q2. I was asked a apti question and a Java snippet to guess the output
Add your answer

Q1. Managerial round: General questions.
Add your answer

Q1. HR related, like why do you wanna join us, etc
Add your answer