Tech Mahindra Interview Questions & Placement Prep (2026)
Tech Mahindra's Associate Software Engineer (ASE) hiring runs through a multi-stage assessment — aptitude and written communication, a technical/pseudocode and coding round paired with a psychometric test, a conversational English assessment, and finally a technical and HR interview. Top performers in the regular rounds may additionally be routed into a higher-paying Supercoder assessment. This guide covers every round, the full syllabus, previous-year-style questions, formulas, ready code templates and a week-by-week plan.
36 MCQs + 1 essay / 60 min (Round 1) + technical MCQs, 2 coding problems and pseudocode/debugging + psychometric test (Round 2, ~90 min) + conversational assessment (~30 min, 7 modules) + technical interview (15–30 min) + HR interview
Last updated:
Exam Pattern
36 MCQs + 1 essay / 60 min (Round 1) + technical MCQs, 2 coding problems and pseudocode/debugging + psychometric test (Round 2, ~90 min) + conversational assessment (~30 min, 7 modules) + technical interview (15–30 min) + HR interview
| Section | Questions | Time | Type | Difficulty |
|---|---|---|---|---|
| Round 1 — Aptitude & Written Communication | 36 MCQs + 1 essay/story | 60 min (some drives 60–90 min) | MCQ + Writing | Elimination |
| Round 2 — Technical, Coding & Psychometric | Technical MCQs + 2 coding problems + pseudocode/debugging + psychometric | ~90 min | MCQ + Coding + Psychometric | Elimination |
| Round 3 — Conversational Assessment | ~7 communication modules | ~30 min | AI speaking & listening | Elimination |
| Round 4 — Technical Interview | Varies | 15–30 min | Interview | Elimination |
| Round 5 — HR Interview | Varies | Varies | Interview | Elimination |
Section-Wise Syllabus
Everything that appears in the assessment, grouped by section.
1. Round 1 — Section-wise Distribution (36 MCQs + essay / 60 min)
Logical Ability (12 Qs, 15 min)
- • Number & alphabet series
- • Coding-decoding
- • Analogy & classification
- • Blood relations
- • Direction sense
- • Seating arrangement
- • Syllogisms
- • Data sufficiency
Quantitative Ability (12 Qs, 15 min)
- • Percentages, profit & loss
- • SI/CI
- • Time & work, pipes & cisterns
- • Time, speed & distance
- • Probability
- • Permutation & combination
English / Verbal Ability (12 Qs, 15 min)
- • Reading comprehension
- • Sentence correction
- • Error spotting
- • Fill in the blanks
- • Para jumbles
- • Synonyms & antonyms
Essay / Story Writing (1 task, 15 min)
- • Structured 3–4 paragraph essay
- • Topics on AI, WFH, education, privacy, teamwork
- • Introduction → argument → example → conclusion
2. Round 2 — Technical, Coding & Psychometric
Technical MCQs
- • Programming fundamentals
- • DSA basics
- • DBMS, OS, computer networks
Coding (usually 2 problems)
- • One easy problem
- • One medium problem
- • Arrays and strings
- • Hidden test cases must pass
Pseudocode / Automata Fix
- • Trace incorrect logic
- • Debug and fix faulty code
- • Identify logical errors
Psychometric test
- • Work style and attitude
- • Situational judgment
- • Consistency across answers
3. Round 3 — Conversational Assessment (~7 modules, 30 min)
Modules
- • Listening comprehension
- • Sentence repetition
- • Sentence formation
- • Spoken responses
- • Grammar-based audio questions
- • Pronunciation & fluency
- • Accent recognition
- • Situational communication
4. Core CS Subjects
Data Structures & Algorithms
- • Arrays, strings, linked lists
- • Stacks, queues, hashing
- • Trees, BSTs, heaps, graphs
- • Sorting & searching
- • Recursion, greedy, DP
- • BFS and DFS
OOP
- • Class & object
- • Encapsulation & abstraction
- • Inheritance & polymorphism
- • Constructor/destructor
- • Overloading vs overriding
- • Virtual functions, access modifiers
- • Abstract classes & interfaces
DBMS & SQL
- • Primary/foreign/candidate keys
- • Functional dependency & normalisation
- • Joins, aggregate functions
- • GROUP BY / HAVING
- • Subqueries, indexing
- • Transactions, ACID, serialisability
- • Deadlock, views
Operating Systems
- • Process vs thread, context switching
- • CPU scheduling
- • Synchronisation, mutex & semaphore
- • Deadlock
- • Paging, segmentation, virtual memory
- • User mode vs kernel mode
Computer Networks
- • OSI & TCP/IP model
- • TCP vs UDP
- • IP addressing, DNS, DHCP, ARP
- • HTTP/HTTPS
- • Routing, three-way handshake
- • Congestion control, basic security
5. Supercoder Pathway
Requirements for higher-paying track
- • Stronger DSA under time pressure
- • Medium-level array and string problems
- • Hashing, recursion
- • Linked lists, trees
- • Dynamic programming basics
- • Debugging and optimisation
Most Asked Topics
Highest-frequency areas across recent test papers.
Coding — both problems
Recent ASE interview experiences report one easy and one medium coding problem covering arrays and strings, with hidden test cases that must pass.
Pseudocode / Automata Fix
Trace or debug faulty code — loops, conditionals and off-by-one errors are common.
Output prediction pitfalls
Pre/post increment, integer division truncation, operator precedence (&& over ||), array indexing from zero.
DSA recognition patterns
Kadane's algorithm, sliding window, two pointers, BFS/DFS, DP for coin change, topological sort for dependencies.
DBMS normalisation & joins
Second Normal Form, foreign keys, INNER/LEFT joins asked repeatedly in technical MCQs and interviews.
Psychometric consistency
Answer consistently around reliability, teamwork, ownership and adaptability — avoid extreme answers.
Conversational assessment
Clear pronunciation, complete sentences, and continuing past small mistakes instead of restarting.
Project + HR readiness
Every interview funnels into project explanation, relocation/shift willingness and 'Why Tech Mahindra?'.
Free Resources
Curated practice links per section.
Aptitude & Reasoning
Technical MCQs
Coding practice
Communication assessment
50+ DSA Practice Problems
Solve in order — arrays and strings first, then sorting and recursion.
Easy — ASE Round 2 level (8)
- Second-largest distinct element (handle duplicates and negatives)
- First non-repeating character in a string
- Reverse a string / number
- Check palindrome
- Check prime
- Armstrong number check
- Factorial and Fibonacci
- GCD and LCM
Medium — Supercoder level (8)
- Maximum subarray sum (Kadane's algorithm)
- Balanced brackets using a stack
- Count triangles from an array (sort + two pointers)
- Longest substring without repeating characters
- Number of islands (DFS/BFS on grid)
- Minimum coins (dynamic programming)
- Two-sum with hashing
- Array rotation by k
DSA recognition sheet (10)
- Pair with target sum → hashing or two pointers
- Maximum contiguous sum → Kadane's algorithm
- Longest substring condition → sliding window
- Sorted search → binary search
- Balanced symbols → stack
- Shortest unweighted path → BFS
- Connected components → DFS/BFS
- Dependencies → topological sort
- Select or reject → dynamic programming
- Minimum possible maximum → binary search on answer
Fundamentals to code from memory (6)
- Bubble, selection and insertion sort
- Binary search (iterative and recursive)
- Prime check in O(√n)
- Sum of digits and digit reversal
- Count vowels and consonants
- Matrix transpose
Previous Year Questions & Patterns
Repeat coding questions with the expected approach.
Aptitude PYQs
- A train 180 m long crosses a pole in 9 seconds. Find its speed. → 20 m/s = 72 km/h
- An item is marked 40% above cost and sold at a 10% discount. Find the profit %. → 26%
- A and B finish a work in 12 and 18 days respectively. Find their combined time. → 7.2 days
- Find the next number: 3, 8, 15, 24, 35, ? → 48
- If TECH is coded as UFDI, how is JAVA coded? → KBWB
Technical MCQs
- Which data structure follows LIFO? → Stack
- Which traversal of a BST gives sorted order? → Inorder traversal
- Which normal form removes partial dependency? → Second Normal Form
- Which protocol is connection-oriented? → TCP
- Average complexity of lookup in an unordered_map? → O(1)
Output prediction
- int x = 5; cout << x / 2 + x % 2; → Output: 3
- for (int i = 1; i <= n; i *= 2) cout << i; → Complexity: O(log n)
- What is the purpose of a foreign key? → Establishes a relationship with a key in another table
Verbal & logic
- Statements: All developers are programmers. Some programmers are gamers. Can we conclude some developers are gamers? → No, it does not necessarily follow
- Choose the correct sentence: 'Neither of the answers is correct' is grammatically correct
- Arrange: requirements, coding, testing, design, deployment → Requirements → design → coding → testing → deployment
HR questions
- Tell me about yourself
- Why Tech Mahindra? Why should we hire you?
- Are you willing to relocate and work shifts?
- Explain your strengths and weaknesses
- Explain a difficult situation you handled
- Are you comfortable working on support or maintenance projects?
- Are you willing to sign training or service-related documents?
20+ SQL Query Bank
Write these out by hand — joins and subqueries are asked in both the test and the interview.
Basics & aggregation
Filter and sort
SELECT name, department
FROM employees
WHERE salary > 50000
ORDER BY salary DESC;Aggregates
SELECT COUNT(*) AS total,
AVG(salary) AS avg_salary,
MAX(salary) AS max_salary
FROM employees;GROUP BY with HAVING
SELECT department, AVG(salary) AS avg_salary
FROM employees
GROUP BY department
HAVING MAX(salary) > 60000;Joins
INNER JOIN
SELECT e.name, d.department_name
FROM employees e
INNER JOIN departments d
ON e.dept_id = d.dept_id;LEFT JOIN
SELECT e.name, d.department_name
FROM employees e
LEFT JOIN departments d
ON e.dept_id = d.dept_id;Subqueries
Second-highest salary
SELECT MAX(salary) AS second_highest
FROM employees
WHERE salary < (SELECT MAX(salary) FROM employees);Employees above the overall average
SELECT name, salary
FROM employees
WHERE salary > (SELECT AVG(salary) FROM employees);DBMS & Core Interview Q&A
Short answers you should be able to say out loud.
Which normal form removes partial dependency?
Second Normal Form (2NF) — it removes partial dependency of non-key attributes on part of a composite key.
What is the purpose of a foreign key?
It establishes a relationship with a key (usually the primary key) in another table.
WHERE vs HAVING?
WHERE filters rows before grouping; HAVING filters groups after GROUP BY and can use aggregates.
What are ACID properties?
Atomicity, Consistency, Isolation and Durability — the guarantees of a reliable transaction.
What is a deadlock?
A state in which processes wait indefinitely for resources held by one another.
Process vs thread?
A process has its own memory space; threads share the memory of their parent process, so context switching between threads is cheaper.
What is indexing used for?
Speeding up data retrieval by creating a lookup structure, at the cost of extra storage and slower writes.
What is serialisability?
A property ensuring that the outcome of concurrently executed transactions is equivalent to some serial execution order.
OOPs Concepts + 10 Code Snippets
Theory plus the exact snippets asked in the technical round.
Encapsulation
Keep fields private and expose controlled accessors, e.g. a Bank class with a private balance and deposit()/getBalance().
Abstraction
Hide implementation details behind interfaces or abstract classes and expose only what matters.
Inheritance
Derive a Child class from a Parent class to reuse and extend behaviour.
Polymorphism
Compile-time overloading versus runtime overriding (virtual functions in C++).
Constructor & destructor
Constructor initialises an object's state; destructor releases resources when the object goes out of scope.
Overloading vs overriding
Overloading changes the parameter list of a same-named method; overriding redefines a parent method in a subclass with the same signature.
Virtual functions
Enable runtime dispatch in C++; mark overrides with the override keyword.
Abstract classes vs interfaces
Abstract classes can have partial implementation; interfaces declare only method signatures for classes to implement.
1. Second-largest distinct element (C++)
int secondLargest(int arr[], int n) {
if (n < 2) return -1;
int first = INT_MIN, second = INT_MIN;
for (int i = 0; i < n; i++) {
if (arr[i] > first) { second = first; first = arr[i]; }
else if (arr[i] > second && arr[i] != first) second = arr[i];
}
return second == INT_MIN ? -1 : second;
}2. First non-repeating character (C++)
char firstNonRepeating(string s) {
unordered_map<char, int> freq;
for (char c : s) freq[c]++;
for (char c : s) if (freq[c] == 1) return c;
return '\0';
}3. Maximum subarray sum — Kadane's algorithm (C++)
long long maxSubArraySum(vector<int>& a) {
long long current = a[0], best = a[0];
for (size_t i = 1; i < a.size(); i++) {
current = max((long long)a[i], current + a[i]);
best = max(best, current);
}
return best;
}4. Balanced brackets using a stack (C++)
bool isBalanced(string s) {
stack<char> st;
for (char c : s) {
if (c == '(' || c == '{' || c == '[') st.push(c);
else {
if (st.empty()) return false;
char top = st.top(); st.pop();
if ((c == ')' && top != '(') || (c == '}' && top != '{') || (c == ']' && top != '[')) return false;
}
}
return st.empty();
}5. Minimum coins — dynamic programming (C++)
int minCoins(vector<int>& coins, int x) {
vector<int> dp(x + 1, INT_MAX);
dp[0] = 0;
for (int i = 1; i <= x; i++)
for (int c : coins)
if (c <= i && dp[i - c] != INT_MAX)
dp[i] = min(dp[i], dp[i - c] + 1);
return dp[x] == INT_MAX ? -1 : dp[x];
}6. Number of islands — BFS/DFS (C++)
void dfs(vector<vector<int>>& grid, int i, int j) {
if (i < 0 || j < 0 || i >= (int)grid.size() || j >= (int)grid[0].size() || grid[i][j] == 0) return;
grid[i][j] = 0;
dfs(grid, i + 1, j); dfs(grid, i - 1, j);
dfs(grid, i, j + 1); dfs(grid, i, j - 1);
}
int numIslands(vector<vector<int>>& grid) {
int count = 0;
for (int i = 0; i < (int)grid.size(); i++)
for (int j = 0; j < (int)grid[0].size(); j++)
if (grid[i][j] == 1) { count++; dfs(grid, i, j); }
return count;
}7. Prime, GCD and Armstrong (Python)
def is_prime(n):
if n < 2:
return False
i = 2
while i * i <= n:
if n % i == 0:
return False
i += 1
return True
def gcd(a, b):
while b:
a, b = b, a % b
return a
def is_armstrong(n):
original, total = n, 0
while n > 0:
d = n % 10
total += d ** 3
n //= 10
return total == original8. OOP — encapsulation and inheritance (Python)
class Animal:
def sound(self):
print('Some sound')
class Dog(Animal):
def sound(self):
print('Bark')
class Bank:
def __init__(self):
self.__balance = 0 # private
def deposit(self, amount):
self.__balance += amount
def get_balance(self):
return self.__balanceOperating System Basics
Scheduling, deadlock and memory management essentials.
Operating Systems
- • Process versus thread and the cost of context switching.
- • CPU scheduling: FCFS, SJF, SRTF, Round Robin, Priority.
- • Synchronisation with mutex versus semaphore; race conditions.
- • Deadlock and its necessary conditions.
- • Paging, segmentation, virtual memory and page replacement.
- • User mode versus kernel mode.
Computer Networks
- • OSI model: Physical, Data Link, Network, Transport, Session, Presentation, Application.
- • TCP (connection-oriented, reliable) versus UDP (connectionless, fast).
- • IP addressing, DNS, DHCP and ARP.
- • HTTP/HTTPS, routing and the three-way handshake.
- • Congestion control and basic network security.
Psychometric strategy
- • Designed to check consistency and workplace behaviour, not technical knowledge.
- • Answer consistently around reliability, teamwork, ownership, willingness to learn, adaptability and calmness under pressure.
- • Avoid extreme answers on every question.
- • Do not present yourself as someone who refuses feedback or avoids responsibility.
Conversational assessment strategy
- • Use a quiet room and a reliable microphone.
- • Speak at a moderate speed without imitating an accent.
- • Pronounce word endings clearly and listen completely before answering.
- • Use short, grammatically complete sentences.
- • If you make a small mistake, continue instead of restarting repeatedly.
4-Week Preparation Roadmap
From zero to test-ready in 28 days.
Aptitude Foundation
- Percentages, ratios, averages
- Basic grammar revision
- Basic C++ syntax practice
Goal: Build fluency in percentages, ratios, averages, grammar basics and simple C++ programs.
Aptitude & Reasoning Depth
- Profit-loss, time-work, speed-distance
- Number & letter series
- Coding-decoding drills
Goal: Master profit-loss, time-work, speed-distance formulas and series/coding-decoding patterns.
Reasoning + Verbal + Programming Basics
- Seating arrangements & puzzles
- Reading comprehension practice
- Arrays and strings coding
Goal: Comfortably solve arrangement puzzles, RC passages and basic array/string problems.
Core CS Subjects
- OOP concepts with examples
- DBMS normalisation and SQL
- OS and networking basics
- Sorting and searching implementations
Goal: Be interview-ready on OOP, DBMS, OS, networks and be able to code sorting/searching from memory.
DSA & Coding
- Linked lists, stacks, queues
- Recursion problems
- Trees and graphs
- 2 coding problems daily
Goal: Solve 30+ coding problems including one easy and one medium daily, matching the Round 2 format.
Full Mocks + Communication + Interviews
- Full 60-minute Round 1 mock
- Essay writing practice
- Psychometric practice
- Mock technical + HR interview
Goal: Complete at least two full-length mocks and two mock interviews with recorded feedback.
Exam Day Strategy
Score targets and time allocation.
Section targets
- Logical Ability (12 Qs): 15 min — solve series and coding-decoding first.
- Quantitative Ability (12 Qs): 15 min — bank easy percentage and SI/CI questions first.
- English / Verbal (12 Qs): 15 min — read questions before the passage to save time.
- Essay / Story Writing: 15 min — 2 min plan, 9 min write, 2 min proofread, 2 min buffer.
- Technical MCQs + Coding (Round 2): ~90 min — read both coding problems first, solve the easier one fully before moving on.
- Conversational Assessment: 30 min — speak clearly, complete every module, do not restart on small mistakes.
Coding time split (50 min)
- Read both problems — ~3 min
- Solve the easier problem first — ~35 min
- Second (medium) problem — ~40 min
- Edge cases and hidden test-case checks — ~10 min
- Both problems passing hidden test cases is the key filter for this round
Interview Process
What follows the online test.
Technical Interview — ASE
- • Explain your project: your role, tech stack and one hard problem you solved.
- • Programming language on your resume — write and trace small snippets.
- • OOP: inheritance, polymorphism, encapsulation with real examples.
- • DBMS and SQL: joins, GROUP BY, normalisation basics.
- • OS and networks: process vs thread, TCP vs UDP, deadlock.
- • Basic DSA: arrays, strings, sorting, searching, and a simple whiteboard problem.
HR Interview
- • Tell me about yourself; why Tech Mahindra?
- • Why should we hire you?
- • Strengths and weaknesses.
- • Willingness to relocate and work shifts.
- • Comfort with support or maintenance projects.
- • Willingness to sign training or service-related bonds.
Mock Test Plan
Four simulations to run before the real test.
Mock 1 — Full Round 1
- • 36 MCQs + essay in exactly 60 minutes
- • Score at least 70% and complete the essay in full
Mock 2 — Technical + Coding Sprint
- • Technical MCQs plus 2 coding problems in 90 minutes
- • Test both solutions against hidden-style edge cases
Mock 3 — Pseudocode / Debugging Drill
- • 20 debugging/output-tracing problems in 30 minutes
- • Log every mistake in an error notebook
Mock 4 — Conversational Simulation
- • 7 modules recorded and self-reviewed
- • Check pronunciation, fluency and completeness of sentences
Mock 5 — Interview Simulation
- • 15–20 min technical + project deep dive
- • 10 min HR covering shifts, relocation and motivation
Final Checklist
Tick all of these before test day.
Recent Interview Experiences
First-hand write-ups from students who actually sat the Tech Mahindra process.
Be the first to share a Tech Mahindra interview experience.
Frequently Asked Questions
What is the Tech Mahindra ASE exam pattern in 2026?
A five-round process: Round 1 aptitude and written communication (36 MCQs + essay in 60 minutes), Round 2 technical MCQs plus 2 coding problems and pseudocode/debugging with a psychometric test (~90 minutes), Round 3 conversational assessment (~30 minutes, 7 modules), Round 4 technical interview and Round 5 HR interview.
How many coding problems are asked and how hard are they?
Typically 2 problems — one easy and one medium — covering basic programming, arrays and strings. Both must pass hidden test cases, so testing edge cases matters more than speed alone.
What is the Supercoder pathway?
Top performers in the regular ASE rounds may be invited to a separate Supercoder assessment (excluding HR) that tests stronger DSA — hashing, recursion, linked lists, trees and basic dynamic programming — for a higher package around ₹5.5 LPA.
Is the psychometric test scored for elimination?
It checks consistency in workplace behaviour rather than technical knowledge. Answer consistently around reliability, teamwork and adaptability, and avoid picking extreme options on every question.
What should I focus on for the conversational assessment?
Use a quiet room, speak at a moderate pace without imitating an accent, pronounce word endings clearly, and continue instead of restarting if you make a small mistake.
Which topics matter most for the technical interview?
Your final-year project, the programming language on your resume, OOP concepts, DBMS/SQL basics, OS and networking fundamentals (process vs thread, TCP vs UDP, deadlock), and basic DSA on the whiteboard.
Want the full structured prep for Tech Mahindra?
The Premium Vault covers Aptitude, Core CS, DSA, SQL and HR rounds with module-wise courses and drill sheets.
Related Prep
Next steps chosen from the Tech Mahindra pattern and other IT Services (Mass Hiring) recruiters.
Other IT Services (Mass Hiring) companies
Virtusa Interview Prep Guide
Virtusa exam pattern, syllabus and previous year questions · ₹3.5–7 LPA.
Cognizant Technology Solutions Interview Prep Guide
Cognizant Technology Solutions exam pattern, syllabus and previous year questions · ₹4–9 LPA.
Accenture Interview Prep Guide
Accenture exam pattern, syllabus and previous year questions · ₹4.5–11 LPA.
Core CS subjects for this pattern
DBMS & SQL Essentials
Normalisation, keys, transactions and the SQL queries asked in written rounds.
OOPs Essentials for Interviews
The four pillars with the exact code snippets interviewers ask you to explain.
Operating System Essentials
Processes, scheduling, deadlock and memory management in interview-ready form.
Recommended practice path