Mphasis placement papers hub
Eligibility, rounds, salary and FAQs.
Mphasis Previous Year Question Papers PDF with Solutions
Mphasis previous year question papers are practice sets for the Mphasis fresher online assessment (Associate / Associate Software Engineer), rebuilt from candidate reports of 2024, 2025 and 2026 drives. The reported test is about 90 minutes with aptitude, technical MCQs and 1-2 coding problems. This page gives the pattern, new worked questions for each year, the topics that repeat and how to sit one paper under time. The free PDF is linked below.
Mphasis exam pattern by role / drive
All numbers are candidate-reported. Mphasis does not publish a permanent paper format, and section counts change by drive.
| Stage | Section | Questions | Time | What it tests |
|---|---|---|---|---|
| Online assessment (campus and off-campus Associate / ASE) | Aptitude | 20-25 (one reported split) | ~30 min | Quant, logical, verbal |
| Technical MCQ | 15-20 (one reported split) | ~30 min | Programming, DBMS, OOP, DS; cloud basics in 2025 reports | |
| Coding | 1-2 problems | ~30 min | Arrays, strings, basic algorithms | |
| Technical interview | Resume-led | live questions | ~30-45 min | SQL, OOP, project, any algorithm on your CV |
| HR interview | - | - | ~20-30 min | Why Mphasis, city, hobbies, company knowledge |
Working total for the OA: about 90 minutes. Other reports give aptitude a longer ~45-minute block with fewer questions, so treat the split as varying by drive and keep the 90-minute total as the anchor. Languages commonly allowed: C, C++, Java, Python.
Cutoffs: older candidate-reported tables cite sectional cutoffs plus about 60-65% overall. Year pages also mention that only about 20-25% of candidates cleared the assessment (candidate-reported). A blank coding section is the usual way a decent MCQ score still fails.
Year-wise question sets
The three-section OA has stayed stable from 2024 to 2026. What moved is the technical MCQ flavour (domain basics in 2024, cloud concepts in 2025) and how much interviewers want you to explain your code. The questions below are new practice items in each year’s reported style.
Mphasis 2026 question paper pattern and practice
2026 is continuity. The online assessment stays the main volume filter, with exact section counts set by your invite. Interviewers expect cleaner explanations, not only correct final code. Core CS (OOP, DBMS, OS basics) carries into the technical round.
Q: A sum of money becomes ₹13,310 in 3 years at 10% per annum compound interest. Find the principal.
Amount = P × (1.1)³ = 1.331P.
P = 13,310 / 1.331 = 10,000.
Answer: ₹10,000
Q: Riya is 14th from the top and 23rd from the bottom in her class ranking. How many students are in the class?
Total = 14 + 23 − 1 = 36. Subtract 1 because Riya is counted in both positions.
Answer: 36
Q: Which CPU scheduling algorithm can starve long processes: FCFS, Round Robin or non-preemptive Shortest Job First?
FCFS serves in arrival order, so every job eventually runs. Round Robin gives each process a time slice in turn. SJF keeps picking short jobs, so a long job can wait indefinitely if short jobs keep arriving. Aging (raising priority with wait time) fixes it.
Answer: Shortest Job First
Q: Coding. Return the k-th largest element of an unsorted array. Example: [3, 2, 1, 5, 6, 4], k = 2 gives 5.
Keep a min-heap of size k. After the scan, its top is the k-th largest. This is the “sorting + heap lite” style that shows up next to merge-intervals and top-K drills.
import heapq
def kth_largest(a, k): heap = [] for x in a: heapq.heappush(heap, x) if len(heap) > k: heapq.heappop(heap) return heap[0]
print(kth_largest([3, 2, 1, 5, 6, 4], 2)) # 5Complexity: O(n log k) time, O(k) space. Sorting the whole array is O(n log n) and also acceptable if time is short.
Answer: 5
Full 2026 plan and day-of checklist: Mphasis placement 2026.
Mphasis 2025 previous year question paper
The 2025 reports keep the 90-minute aptitude + technical + coding split. The change was in technical MCQs and interviews: more cloud-services basics and more weight on optimal solutions. Aptitude stayed quant and reasoning heavy (ratios, ages, averages, coding-decoding).
Q: The present ages of P and Q are in the ratio 4:5. Five years ago the ratio was 3:4. What is P’s present age?
Let ages be 4x and 5x. Then (4x − 5)/(5x − 5) = 3/4.
16x − 20 = 15x − 15, so x = 5.
P = 4 × 5 = 20 (Q = 25).
Answer: 20 years
Q: Find the next number: 2, 6, 12, 20, 30, ?
Differences are 4, 6, 8, 10, so the next is 12. Equivalently n × (n + 1) for n = 1 to 6: 6 × 7 = 42.
Answer: 42
Q: In which cloud service model does the provider give you virtual machines, storage and networking while you manage the operating system and applications?
IaaS gives raw infrastructure and you manage the OS upward. PaaS also manages the OS and runtime, so you only deploy code. SaaS is a finished application.
Answer: IaaS (Infrastructure as a Service)
Q: Which ACID property guarantees that a committed transaction survives a system crash?
Atomicity is all-or-nothing. Consistency keeps constraints valid. Isolation stops concurrent transactions from seeing each other’s partial work. Durability means committed data is written to non-volatile storage and survives a crash.
Answer: Durability
Q: Coding. Check whether two strings are anagrams. Example: “listen” and “silent” give true; “rat” and “car” give false.
Compare character counts. Sorting both strings also works but is slower.
from collections import Counter
def is_anagram(a, b): return len(a) == len(b) and Counter(a) == Counter(b)
print(is_anagram("listen", "silent")) # Trueprint(is_anagram("rat", "car")) # FalseComplexity: O(n) time, O(k) space for k distinct characters. Sorting is O(n log n).
Answer: true, false
All 2025 worked questions: Mphasis placement papers 2025.
Mphasis 2024 previous year question paper
The 2024 assessment carried aptitude and technical MCQs plus 1-2 coding problems in about 90 minutes. Reported aptitude leaned on train speed and time-distance. Technical MCQs mixed programming, DBMS, OOP and some domain knowledge. The December 2023 ASE write-up from this cycle says the technical round focused on resume content and fundamentals.
Q: Two trains 150 m and 100 m long run in opposite directions at 54 km/h and 36 km/h. How long do they take to cross each other?
Relative speed = 54 + 36 = 90 km/h = 90 × 5/18 = 25 m/s.
Distance = 150 + 100 = 250 m. Time = 250 / 25 = 10 s.
Answer: 10 seconds
Q: A boat goes 18 km/h downstream and 12 km/h upstream. What is the speed of the stream?
Stream speed = (downstream − upstream) / 2 = (18 − 12) / 2 = 3 km/h. Boat speed in still water = (18 + 12) / 2 = 15 km/h.
Answer: 3 km/h
Q: Fill in the blank: “Neither the manager nor the clerks ___ present at the meeting.” (was / were)
With “neither … nor”, the verb agrees with the nearer subject. “Clerks” is plural.
Answer: were
Q: Which OOP concept keeps an object’s data private and exposes it only through methods?
That is encapsulation: private fields with public getters and setters or behaviour methods. Abstraction hides implementation behind an interface. Inheritance reuses a parent class. Polymorphism lets one call behave differently by type.
Answer: Encapsulation
Q: Coding. An array holds n − 1 distinct numbers from 1 to n. Find the missing one. Example: [1, 2, 4, 5, 6] gives 3.
The sum of 1 to n is n(n + 1)/2. Subtract the array sum.
def missing_number(a): n = len(a) + 1 return n * (n + 1) // 2 - sum(a)
print(missing_number([1, 2, 4, 5, 6])) # 3In C or Java, use XOR of 1..n and all elements to avoid overflow on large n.
Complexity: O(n) time, O(1) space.
Answer: 3
All 2024 worked questions: Mphasis placement papers 2024.
Section-wise topics that repeat
Mphasis reuses themes more than exact questions. Use the papers as stamina trainers for a mixed 90-minute sitting, then prepare the resume quiz separately.
| Section | Topics that keep coming back | Questions (candidate-reported) |
|---|---|---|
| Quant | Percentages, ratio and ages, averages, time and work, trains, boats, compound interest | 20-25 in one reported split |
| Logical | Number series, ranking, coding-decoding, blood relations | Part of aptitude |
| Verbal | Synonyms, antonyms, fill in the blank, subject-verb agreement | Part of aptitude |
| Technical MCQ | OOP pillars, DBMS and ACID, SQL JOIN and GROUP BY, OS basics, cloud models (2025) | 15-20 in one reported split |
| Coding | Arrays and strings, reverse/rotate, two sum, palindrome, merge intervals, top-K, heap basics | 1-2 |
| Technical interview | SQL query from your project, four OOP pillars with your class, DFS or any algorithm on the CV | Live |
What the papers do not cover: the resume-led technical. Candidates who could write a JOIN and name the OOP pillars with an example from their own project did well. Candidates who listed tools they could not explain got asked about exactly those tools.
How to use one paper in a timed sitting
Set a 90-minute timer. If your invite gives a different split, rewrite these blocks on paper first.
- Minutes 0-3. Skim every section and mark the easy quant.
- Minutes 3-35. Quant and easy logical. Give a seating or ranking puzzle 45 seconds, then skip.
- Minutes 35-55. Verbal, leftover logical and the technical MCQs you know.
- Minutes 55-80. Coding. Get one complete, passing submit. Test an empty array and a one-element array.
- Minutes 80-90. Mop up skipped MCQs. Do not start a second algorithm while the first is still failing.
- After the timer. List three quant types that ate the clock, rewrite the program cleanly, then spend 20 minutes on one SQL JOIN and the four OOP pillars using a class from your project.
- Last 10 minutes. Explain the algorithm on your resume aloud, then say “Why Mphasis” and your city answer in 30 seconds.
FAQs
Is there a Mphasis previous year question paper PDF?
Yes. A free Mphasis placement paper PDF (2026) is here, and the 2024, 2025 and 2026 year pages carry worked questions. These are practice sets rebuilt from candidate reports, not official Mphasis papers.
What is the Mphasis online assessment pattern?
Candidate-reported: about 90 minutes with aptitude, technical MCQs and 1-2 coding problems in C, C++, Java or Python. One reported split is 20-25 aptitude questions in 30 minutes, 15-20 technical in 30 minutes and coding in 30 minutes, but section counts vary by drive. Your invite wins.
What score do I need to clear the Mphasis assessment?
Older candidate-reported tables cite sectional cutoffs plus about 60-65% overall. Mphasis does not publish one cutoff for every drive, so aim to clear each section and submit at least one coding problem.
Which Mphasis year paper should I start with?
Start with the 2026 page for the plan, then 2025 and 2024 for worked aptitude and coding volume. The 90-minute three-section shape has held from 2024 to 2026, so older sets still train the right stamina.
Do previous year papers help with the Mphasis technical interview?
Only partly. Candidate notes, including a December 2023 Associate Software Engineer write-up, say the technical round focuses on resume content and fundamentals such as SQL, OOP and any algorithm you listed. Prepare your own resume alongside the papers.
Related Mphasis pages
Mphasis 2026
2026 plan and checklist.
Mphasis 2025
2025 worked questions.
Mphasis 2024
2024 worked questions.
Aptitude questions
Aptitude practice and mock quiz.
Coding questions
Array and string drills.
Online assessment
OA format and practice drills.
Interview experience
Candidate stories.
Preparation guide
Week-by-week plan.