Learn from Mphasis campus and off-campus fresher loops, synthesized from recent candidate reports. We reorganized AMCAT/Automata/SWAR stages, technical depth, and HR flexibility - treat this as a prep map, not a script.
Reported eligibility (from student and placement-cell reports): B.E./B.Tech/M.Tech/MCA, roughly 60% or 6.5 CGPA across Class 10, Class 12 and graduation, and no active backlogs at the time of the drive. Cutoffs differ by drive - always confirm against your own placement email.
Motivation, relocation and shift flexibility, offer discussion
Technical interview experience 1
Technical interview experience 1
Candidate Profile: Final year Computer Science student, ~7.5 CGPA, tier-2 college, steady DSA practice
Round 1 - Online assessment
Proctored online test with quantitative aptitude, logical reasoning and verbal ability sections plus technical MCQs
The MCQ section pulled from OOPs, DBMS, operating systems and networks
Two coding questions at easy-to-medium difficulty; partial marks for passing some test cases
Sectional timers meant speed mattered as much as accuracy
Tip: Do timed sectional mocks. Most eliminations here come from running out of time, not from hard questions.
Round 2 - Group discussion
Conducted for this campus drive only; a general awareness / workplace topic
Panel watched for whether you structured a point and let others speak
Tip: Enter early with one clear framing statement rather than fighting for airtime later.
Round 3 - Technical interview (30-45 min)
Started with a resume walkthrough and then the academic project in detail: why that stack, what broke, what you would rebuild
Coding: level-order traversal of a binary tree, then a follow-up on detecting a cycle in a linked list
Core CS: OOPs pillars with real examples, SQL joins and a GROUP BY query, normalisation basics
Asked to state time and space complexity for every solution
Result: Selected
Tip: Say the approach out loud before writing code. Interviewers scored the reasoning as much as the final answer.
Round 4 - HR interview (20-30 min)
Background, why IT services, and why Mphasis specifically
Flexibility on location and on shift timings for client-facing work
One behavioural story about working in a team under a deadline
Final Result: Offer received
Tip: Have two or three concrete facts about Mphasis ready - its service lines and the kind of clients it works with beat generic praise.
Key Takeaways: Clear the online assessment on speed, know your own projects better than the interviewer can, and be able to explain complexity in plain language.
Takeaways
What decided it: Sectional OA speed, aloud approach on level-order and cycle detection, and specific Mphasis service-line facts in HR
Common fail: Timing out on aptitude sections; silent coding; generic IT-services praise
How to practise: Timed sectional AMCAT mocks; narrate complexity before code; two concrete company facts
Short call covering background, skills claimed on the resume and interest in the role
No technical depth here; it was a filter for eligibility and availability
Tip: For off-campus routes, expect a screening call in place of the campus GD round.
Round 2 - Online assessment
Same aptitude plus programming structure as the campus test
Verbal ability section was the tightest on time
Tip: Do not skip verbal. Candidates who prepare only quant get caught by the sectional cutoff.
Round 3 - Technical interview
More conversational than a rapid-fire quiz
Python and SQL questions since both were on the resume: list vs tuple, exception handling, joins, aggregate functions and a window-function follow-up
One string-manipulation problem solved on a shared editor
Result: Selected
Tip: Only list technologies you can defend for ten minutes. Everything on the resume is fair game.
Round 4 - Managerial round
Situational questions: a missed deadline, a disagreement with a teammate, how you would handle unclear requirements from a client
Some discussion of prior internship work
Tip: Use a plain situation-action-result structure. Short and concrete beats long and abstract.
Round 5 - HR interview
Cultural fit, career goals, compensation and benefits discussion
Relocation willingness across Mphasis delivery locations
Final Result: Offer received
Key Takeaways: Depth on the two or three technologies you actually know beats a long resume of buzzwords, and the managerial round is a real filter in drives that include it.
Takeaways
What decided it: Defendable Python/SQL depth, clearing verbal sectional cutoff, and concrete SAR answers in managerial
Common fail: Long buzzword resumes; skipping verbal prep; treating managerial as soft talk
How to practise: List vs tuple and JOIN drills; timed verbal sections; three SAR stories (deadline, disagreement, unclear requirements)
HR interview experience
HR interview experience
Candidate Profile: Electronics and Communication student, selected candidate
HR interview (20-30 min)
Conversational and friendly rather than adversarial
Questions included:
Tell me about yourself
Why Mphasis, and what do you know about what we do?
Why an IT services career after an ECE degree?
Are you comfortable relocating and working in shifts if the client needs it?
Where do you see yourself in five years?
Do you have any questions for us?
The interviewer spent time explaining the training programme and the service line the role sat in
Final Result: Offer received
Key Takeaways: For a non-CS branch, have a clear and honest answer for why software. Prepare a few real facts about Mphasis, and always close with a question of your own.
Campus drive with SWAR and Automata Fix
AMCAT + SWAR campus experience
Candidate Profile: B.Tech CSE, tier-2 college, ~7.2 CGPA, campus Next Program drive
Round 1 - AMCAT online test
Four MCQ sections with individual cutoffs; verbal was the tightest on time
Programming MCQs included Java output tracing and basic SQL
Two coding questions: array rotation and a simple pattern print
Tip: Finish every section even if one feels weak - partial completion still fails sectional gates.
Round 2 - Automata Fix
Short debugging round: fix logical and syntax issues in a C/Java snippet without rewriting from scratch
Common traps: off-by-one loops, wrong comparison operators, uninitialized variables
Tip: Run mentally with a small input before changing code; random edits lose time.
Round 3 - SWAR (voice) assessment
Automated call-style bot with six stages: read sentences, repeat phrases, short answers, listening comprehension
Evaluated pronunciation, pace and grammar - not accent, but clarity
Result: Cleared; candidates with very low volume or incomplete sentences were filtered out per peer reports
Tip: Quiet room, speak at natural pace, follow the instruction sheet exactly.
Round 4 - Technical + HR (combined, ~40 min)
Fibonacci program, difference between abstract class and interface, OSI layers
HR: Why Mphasis, relocation anywhere in India, shift flexibility, comfort with CTC discussed verbally
Final Result: Offer received after document verification (~2 weeks)
Key Takeaways: Treat SWAR and Automata as real elimination rounds, not optional extras. Combined technical+HR saves a visit but packs more topics into one sitting.
Pre-interview checklist (Mphasis fresher)
Confirm whether your drive includes GD, SWAR, or Automata Fix from the placement email, not old forum posts
Pack sectional-timed AMCAT mocks (logical, quant, verbal, programming) for three consecutive days before the OA
Prepare two coding templates: array/string manipulation and basic linked-list or tree traversal
Rehearse project story (problem, your role, stack, one bug, one metric) under three minutes
HR: fixed answers for relocation, shifts, BFSI willingness, and Why Mphasis with three company facts
Keep scanned marksheets and ID ready; verification delays are a common post-offer bottleneck in candidate reports
Common interview questions from the Mphasis process
Based on candidate reports, these come up often:
Technical interview questions:
Walk me through your project - why this stack and what was your contribution?
Level-order traversal of a binary tree
Detect a cycle in a linked list
Reverse a string / find duplicates in an array without extra space
Explain the four OOPs pillars with an example from your own code
SQL: joins, GROUP BY, HAVING, and a basic window function
DBMS: normalisation, primary vs foreign key, indexing basics
OS: process vs thread, deadlock conditions
Networks: TCP vs UDP, what happens when you type a URL into a browser
What is the time and space complexity of your solution?
HR / behavioural questions:
Why Mphasis?
Why IT services, and why this role?
Are you willing to relocate and work in shifts?
Tell me about a time you missed a deadline
What are your strengths and weaknesses?
Where do you see yourself in five years?
Do you have any questions for us?
Tips from successful candidates
Preparation tips
Do timed sectional mocks for the online assessment - the clock eliminates more people than the difficulty does
Practise 1-2 easy-to-medium DSA problems a day on arrays, strings, linked lists and trees
Revise SQL joins and aggregations; they show up in almost every technical panel
Be able to draw your project architecture on a whiteboard in two minutes
Technical interview tips
State your approach before writing code, and mention complexity unprompted
Ask clarifying questions about constraints instead of coding immediately
If you do not know something, say so and describe how you would find out
Only claim technologies you can defend in depth
HR interview tips
Prepare three concrete facts about Mphasis’s business, not generic praise
Be honest and calm about relocation or shift constraints
Keep one short story each for ownership, conflict and failure
Always ask a question at the end
HR interview
After the technical rounds, Mphasis usually closes with a short HR / hiring-manager conversation: motivation, location and shift flexibility, joining timelines, and a couple of behavioural stories. Prepare those answers on the dedicated page rather than cramming them into this hub.
Sample answers for high-frequency questions
Use these as frames, not scripts - interviewers probe follow-ups.
Q. How do you perform a level-order traversal of a binary tree? A. Use a queue. Enqueue the root, then loop while the queue is non-empty: record the current queue size as the number of nodes on this level, dequeue exactly that many nodes, print or collect each value, and enqueue each node’s non-null left and right children. Capturing the size at the start of each iteration is what lets you emit the tree level by level rather than as one flat list. Every node is enqueued and dequeued once, so it is O(n) time; space is O(w) where w is the maximum width of the tree, which is about n/2 for a complete tree. A recursive alternative computes the height and prints each level separately, but that is O(n squared) on a skewed tree, so the queue version is the answer to give.
Q. How do you reverse a singly linked list? A. Iteratively with three pointers. Set prev to null and curr to head; in each step save next = curr.next, point curr.next back at prev, then advance prev = curr and curr = next. When curr becomes null, prev is the new head. That is O(n) time and O(1) space, and the order of the four assignments matters - if you reassign curr.next before saving next, you lose the rest of the list. A recursive version recurses to the tail and re-links on the way back, which is also O(n) time but O(n) stack space, so it can overflow on a long list. Handle the empty list and single-node list explicitly; both should simply return the head unchanged.
Q. How do you check whether a string of brackets is balanced? A. Push every opening bracket onto a stack. On a closing bracket, the string is invalid if the stack is empty or the top does not match the corresponding opening bracket; otherwise pop and continue. At the end the string is balanced only if the stack is empty, which catches unclosed openers. It is O(n) time and O(n) space. Store the pairs in a hash map from closing to opening bracket so adding a new bracket type does not mean adding another if-branch. Counting brackets instead of using a stack is the classic wrong answer - it accepts a string like a close-then-open sequence, which has equal counts but is not balanced.
Q. What is the difference between an array, an ArrayList and a LinkedList? A. An array is fixed-size contiguous memory: O(1) indexing, excellent cache locality, but you cannot grow it. An ArrayList wraps a dynamic array - indexing stays O(1), appending is O(1) amortised because the backing array doubles when full, but inserting or deleting in the middle is O(n) because elements shift. A LinkedList stores nodes with pointers, so inserting or deleting is O(1) once you hold the node, but reaching position i costs O(n) and every node carries pointer overhead with poor cache behaviour. In practice ArrayList wins for most workloads even for mid-list inserts at small sizes, because a block move of contiguous memory is far faster than chasing scattered pointers; choose LinkedList only when you genuinely need queue or deque behaviour at both ends.
Q. Explain the four pillars of OOP as they appear in Java. A. Encapsulation: fields are private and access goes through methods, so an object can enforce its own invariants - a BankAccount can reject a withdrawal that would make the balance negative. Inheritance: a subclass extends a base class with the extends keyword, reusing state and behaviour, and Java allows only single class inheritance to avoid the diamond problem, with interfaces filling the gap. Polymorphism: a base-type reference can hold any subclass object and calls dispatch at run time to the overridden method, which is what lets a List variable hold an ArrayList or a LinkedList without the caller changing. Abstraction: abstract classes and interfaces publish what an object does without the how, so implementations can change without breaking callers. Together they give code that is easier to extend than to modify - the reason interviewers keep asking.
Tips from successful candidates
Assessment tips
Confirm the current Mphasis pattern from the drive mail before practising old papers
Finish one problem or section fully before starting the next
Revise the fundamentals listed in the round table on this page
Interview tips
Narrate trade-offs; expect “why” after every answer
Only list projects you can defend under follow-ups
Prepare 3-4 STAR stories for behavioural prompts
HR tips
Know why Mphasis, not just why the industry
Be clear on location / notice period / higher studies
Round-wise notes on this page are curated from public candidate reports, then reorganized with prep takeaways and outcome context (GeeksforGeeks interview experiences, placement prep write-ups, and campus forums accessed 2025-2026). Cross-check the current drive mail and careers.mphasis.com for timings. For OA practice, see mPhasis placement papers.
