Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by DMI Team. If you also belong to the team, you can get access from here

DMI Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

DMI Senior Manager Recruitment Interview Questions and Answers

Updated 11 Feb 2022

DMI Senior Manager Recruitment Interview Experiences

1 interview found

Round 1 - One-on-one 

(1 Question)

  • Q1. Explain your strenghts and weakness

Interview Preparation Tips

Interview preparation tips for other job seekers - Professional company ..felt nice

Interview questions from similar companies

I applied via Apna Jobs and was interviewed before Aug 2021. There were 4 interview rounds.

Round 1 - Coding Test 

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

Round 2 - Aptitude Test 

English and aptitude test

Round 3 - One-on-one 

(1 Question)

  • 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
Round 4 - HR 

(1 Question)

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

Interview Preparation Tips

Topics to prepare for Credera Associate Software Engineer interview:
  • Ds and algo
  • C++
  • Java
Interview preparation tips for other job seekers - Just be confident and prepare your college project thoroughly.

I appeared for an interview before May 2021.

Round 1 - Coding Test 

(2 Questions)

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

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

  • 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
Round 2 - Video Call 

(2 Questions)

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

  • Answered by AI
  • 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...

  • Answered by AI
Round 3 - Video Call 

(1 Question)

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

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Netaji Subhas University Of Technology. I applied for the job as SDE - 1 in NoidaEligibility criteria7.5 CGPAANSYS, Inc. interview preparation:Topics to prepare for the interview - System Design, core C++, Algorithms, Data Structures, DBMSTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Brush Up on Computer Science Fundamentals
Tip 2 : Prepare a Brief Self-Introduction

Application resume tips for other job seekers

Tip 1 : Do not put fake resume
Tip 2 : Writing internship project helps.

Final outcome of the interviewSelected

Skills evaluated in this interview

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

I applied via Naukri.com and was interviewed in Mar 2023. There were 3 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 

String related functions,virtual functions and STL concepts

Round 3 - Technical 

(1 Question)

  • Q1. String related questions and STL concepts
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - HR 

(1 Question)

  • Q1. General HR questions also a little bit about my experience
Round 2 - Technical 

(1 Question)

  • Q1. .net general questions like ref vs out, interface vs abstract class
Interview experience
5
Excellent
Difficulty level
-
Process Duration
Less than 2 weeks
Result
No response

I applied via Job Portal and was interviewed before Jun 2023. There was 1 interview round.

Round 1 - One-on-one 

(1 Question)

  • 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

Skills evaluated in this interview

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

I applied via Campus Placement 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 - Aptitude Test 

Multiple choice questions

Round 3 - Technical 

(2 Questions)

  • Q1. Face to face interview, Technical questions will be asked on the respective Technology
  • Q2. Question Related to the specific technology
Round 4 - HR 

(1 Question)

  • Q1. All the confirmations and clarity regarding the role, training and job will be given here

Interview Preparation Tips

Interview preparation tips for other job seekers - Include everything in the resume before attending the interview
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Campus Placement and was interviewed in Dec 2023. There were 5 interview rounds.

Round 1 - Aptitude Test 

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

Round 2 - Group Discussion 

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.

Round 3 - Technical 

(2 Questions)

  • Q1. Mostly questions based on your resume. Having Java as your main language would give you a huge boost.
  • Q2. I was asked a apti question and a Java snippet to guess the output
Round 4 - One-on-one 

(1 Question)

  • Q1. Managerial round: General questions.
Round 5 - HR 

(1 Question)

  • Q1. HR related, like why do you wanna join us, etc

Interview Preparation Tips

Topics to prepare for Solugenix India Private Limited Associate Software Engineer interview:
  • Java
  • HTML
  • Javascript
  • Advanced Java
  • Project Management
Interview preparation tips for other job seekers - I applied through university. The process took 1 day.
I was interviewed at SJCE campus (Mysore) on 1/2/2024

Be true to yourself,
Brush up your Resume.
Interview experience
4
Good
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Campus Placement and was interviewed in Sep 2024. There were 2 interview rounds.

Round 1 - Aptitude Test 

Apti , html , linux ,sql, java

Round 2 - Group Discussion 

They give topics and we have to speak for 30 sec

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

I applied via Referral and was interviewed in Mar 2024. There was 1 interview round.

Round 1 - Technical 

(2 Questions)

  • Q1. Project based backend and frontend
  • Q2. How to connect to backend
  • Ans. 

    To connect to the backend, you can use APIs, database connections, or web services.

    • Use APIs to send and receive data between the frontend and backend

    • Establish database connections to retrieve and store data

    • Utilize web services for communication between different systems

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare for project

Skills evaluated in this interview

DMI Interview FAQs

How many rounds are there in DMI Senior Manager Recruitment interview?
DMI interview process usually has 1 rounds. The most common rounds in the DMI interview process are One-on-one Round.

Tell us how to improve this page.

Interview Questions from Similar Companies

Apisero Interview Questions
4.3
 • 65 Interviews
TestingXperts Interview Questions
3.9
 • 41 Interviews
Credera Interview Questions
3.8
 • 40 Interviews
Stefanini Interview Questions
2.9
 • 35 Interviews
GlobalStep Interview Questions
2.7
 • 28 Interviews
SpanIdea Interview Questions
3.6
 • 24 Interviews
View all
Senior Software Engineer
136 salaries
unlock blur

₹9.5 L/yr - ₹31 L/yr

Software Engineer
88 salaries
unlock blur

₹4 L/yr - ₹14.5 L/yr

Associate Software Engineer
51 salaries
unlock blur

₹3.3 L/yr - ₹9 L/yr

Principal Software Engineer
42 salaries
unlock blur

₹12.1 L/yr - ₹38.8 L/yr

QA Engineer
35 salaries
unlock blur

₹4 L/yr - ₹11 L/yr

Explore more salaries
Compare DMI with

Apisero

4.3
Compare

Actalent Services

3.5
Compare

Cyber Infrastructure

3.5
Compare

TestingXperts

3.9
Compare
Did you find this page helpful?
Yes No
write
Share an Interview