Mphasis Placement Papers 2026
Mphasis Placement Papers 2026 - Complete Preparation Guide
Last Updated: March 2026
šÆ Company Overview
Mphasis is a leading global IT services and solutions company headquartered in Bangalore, India. Established in 1998, Mphasis specializes in cloud and cognitive services, application development, infrastructure services, and business process outsourcing. The company serves marquee clients across banking, capital markets, insurance, and healthcare sectors.
With over 30,000 employees and operations in 17 countries, Mphasis has built a reputation for delivering cutting-edge digital solutions powered by AI, machine learning, and cloud technologies.
š¼ Eligibility Criteria (Freshers 2026)
| Parameter | Requirement |
|---|---|
| Education | B.Tech/B.E. (CS/IT/ECE/EEE) or MCA/M.Sc. (CS/IT) |
| Academic Score | 60% or CGPA 6.0+ in 10th, 12th, and Graduation |
| Backlogs | No active backlogs at time of selection |
| Graduation Year | 2026 batch |
| Gap Allowed | Maximum 2 years with valid documentation |
š° CTC for Freshers 2026
Mphasis offers structured compensation based on performance tiers:
| Package Tier | CTC | Monthly Take-Home |
|---|---|---|
| Associate | ā¹3.2 - 3.8 LPA | ā¹22,000 - ā¹27,000 |
| Senior Associate | ā¹4.5 - 5.5 LPA | ā¹32,000 - ā¹40,000 |
| Specialist | ā¹6.0 - 7.5 LPA | ā¹42,000 - ā¹52,000 |
š Exam Pattern
Mphasis conducts a comprehensive assessment to evaluate candidates across multiple dimensions.
Online Assessment Structure
| Section | Questions | Duration | Topics Covered |
|---|---|---|---|
| English Language | 20 | 20 min | Grammar, Vocab, RC, Para jumbles |
| Quantitative Aptitude | 16 | 16 min | Arithmetic, Algebra, Geometry |
| Logical Reasoning | 14 | 14 min | Series, Coding, Puzzles, Syllogism |
| Technical MCQs | 25 | 25 min | CS Fundamentals, DBMS, OOPs, Networking |
| Coding Section | 2-3 | 45 min | Data Structures, Algorithms |
| Essay Writing | 1 | 20 min | Topic-based writing (200 words) |
| Total | ~78 | 140 min | - |
Sectional Timing & Cutoffs
- Sectional cutoffs: Yes (typically 50-60%)
- Negative marking: No
- Adaptive testing: Sometimes used
Interview Rounds
-
Technical Interview (Round 1) - 30-40 mins
- Programming fundamentals
- Project discussion
- Problem-solving approach
-
Technical Interview (Round 2) - 20-30 mins
- Advanced concepts
- Coding on paper/shared screen
-
HR Interview - 15-20 mins
- Behavioral questions
- Culture fit assessment
š§® Aptitude Questions with Solutions (15 Questions)
Question 1
The sum of three consecutive odd numbers is 93. Find the largest number.
Solution: Let the numbers be: x, x+2, x+4 (where x is odd)
Sum: x + x+2 + x+4 = 93 3x + 6 = 93 3x = 87 x = 29
Largest number = x + 4 = 33
Shortcut: Average = 93/3 = 31 (middle number). Numbers: 29, 31, 33.
Question 2
A man buys 12 oranges for ā¹9 and sells 9 oranges for ā¹12. Find his profit percentage.
Solution: CP of 1 orange = 9/12 = ā¹0.75 SP of 1 orange = 12/9 = ā¹1.33...
Profit per orange = 12/9 - 9/12 = (144 - 81)/108 = 63/108 = ā¹0.583
Profit % = (63/108) / (9/12) Ć 100 = (63/108) Ć (12/9) Ć 100 = 77.77...% = 77.78%
Shortcut: CP:SP ratio based on LCM(12,9)=36 CP of 36 oranges = ā¹27, SP of 36 oranges = ā¹48 Profit % = (48-27)/27 Ć 100 = 77.78%
Question 3
Find the number of factors of 360.
Solution: Prime factorization: 360 = 2³ à 3² à 5¹
Number of factors = (3+1)(2+1)(1+1) = 4 Ć 3 Ć 2 = 24
Question 4
If 8 men can complete a work in 12 days, how many days will 12 men take to complete the same work?
Solution: Total work = 8 men Ć 12 days = 96 man-days
Days required for 12 men = 96 / 12 = 8 days
Question 5
The present ages of A and B are in the ratio 5:6. Six years ago, their ages were in the ratio 4:5. Find B's present age.
Solution: Let present ages be 5x and 6x.
(5x - 6) / (6x - 6) = 4/5 5(5x - 6) = 4(6x - 6) 25x - 30 = 24x - 24 x = 6
B's present age = 6x = 36 years
Question 6
A car covers a certain distance at 60 km/hr in 4 hours. What speed is needed to cover the same distance in 3 hours?
Solution: Distance = Speed Ć Time = 60 Ć 4 = 240 km
Required speed = 240 / 3 = 80 km/hr
Question 7
What is the smallest number which when divided by 20, 25, 35, and 40 leaves a remainder of 5 in each case?
Solution: Find LCM(20, 25, 35, 40) 20 = 2² à 5 25 = 5² 35 = 5 à 7 40 = 2³ à 5
LCM = 2³ à 5² à 7 = 1400
Required number = 1400 + 5 = 1405
Question 8
The average of 11 numbers is 50. If the average of the first 6 numbers is 45 and the average of the last 6 numbers is 55, find the 6th number.
Solution: Sum of 11 numbers = 11 Ć 50 = 550 Sum of first 6 = 6 Ć 45 = 270 Sum of last 6 = 6 Ć 55 = 330
6th number = (270 + 330) - 550 = 50
Question 9
A mixture contains milk and water in the ratio 5:2. If 14 liters of water is added, the ratio becomes 5:4. Find the original quantity of milk.
Solution: Let milk = 5x, water = 2x
After adding water: 5x / (2x + 14) = 5/4 20x = 5(2x + 14) 20x = 10x + 70 10x = 70 x = 7
Original milk = 5x = 35 liters
Question 10
Find the unit digit of 7^2026.
Solution: Cyclicity of 7: 7, 9, 3, 1 (repeats every 4)
2026 mod 4 = 2
Unit digit = 9 (2nd position in cycle)
Question 11
A shopkeeper marks his goods 40% above the cost price and allows a discount of 15%. Find his profit percentage.
Solution: Let CP = 100 Marked Price = 140 SP = 140 Ć 0.85 = 119
Profit % = (119 - 100) / 100 Ć 100 = 19%
Question 12
Two trains of length 150m and 200m are moving in opposite directions at 40 km/hr and 50 km/hr respectively. Find the time taken to cross each other.
Solution: Relative speed = 40 + 50 = 90 km/hr = 90 Ć (5/18) = 25 m/s
Total distance = 150 + 200 = 350m
Time = 350 / 25 = 14 seconds
Question 13
If a:b = 2:3 and b:c = 4:5, find a:c.
Solution: a:b = 2:3 = 8:12 b:c = 4:5 = 12:15
a:c = 8:15
Question 14
The compound interest on a sum for 2 years at 10% per annum is ā¹630. Find the principal.
Solution: CI = P[(1.1)² - 1] = 630 P Ć 0.21 = 630 P = 630 / 0.21 = ā¹3000
Question 15
Find the sum of the series: 1 + 3 + 5 + ... + 99.
Solution: This is the sum of first 50 odd numbers.
Sum = n² = 50² = 2500
Alternatively: Number of terms = (99-1)/2 + 1 = 50 Sum = (50/2) Ć (1 + 99) = 25 Ć 100 = 2500
š» Technical Questions with Solutions (10 Questions)
Question 1
What is the difference between INNER JOIN and OUTER JOIN?
- INNER JOIN: Returns only matching rows from both tables
- OUTER JOIN: Returns all rows from one/both tables with NULLs for non-matching rows
- LEFT OUTER JOIN: All rows from left table
- RIGHT OUTER JOIN: All rows from right table
- FULL OUTER JOIN: All rows from both tables
Question 2
Explain the difference between call by value and call by reference.
| Call by Value | Call by Reference |
|---|---|
| Copy of argument passed | Address of argument passed |
| Changes don't affect original | Changes affect original |
| Used in C (default), Java | Used in C++ (with &), pointers |
Question 3
What is the difference between thread and process?
| Process | Thread |
|---|---|
| Independent execution unit | Lightweight sub-process |
| Separate memory space | Shares memory with other threads |
| Heavy weight creation | Light weight creation |
| Inter-process communication needed | Direct memory sharing |
Question 4
Explain indexing in databases.
- Primary Index: On primary key, automatically created
- Secondary Index: On non-key attributes
- Clustered Index: Determines physical order of data
- Non-clustered Index: Separate structure with pointers
Benefits: Faster SELECT queries Drawbacks: Slower INSERT/UPDATE/DELETE
Question 5
What is the difference between HTTP and HTTPS?
| HTTP | HTTPS |
|---|---|
| HyperText Transfer Protocol | HyperText Transfer Protocol Secure |
| Port 80 | Port 443 |
| No encryption | SSL/TLS encryption |
| Not secure | Secure for sensitive data |
Question 6
Explain constructor overloading in C++.
class Demo {
Demo() {} // Default constructor
Demo(int x) {} // Parameterized constructor
Demo(int x, int y) {} // Another parameterized constructor
};
Question 7
What is the difference between DELETE and TRUNCATE in SQL?
| DELETE | TRUNCATE |
|---|---|
| DML command | DDL command |
| Can use WHERE clause | No WHERE clause |
| Slower (row by row) | Faster (deallocate pages) |
| Can be rolled back | Cannot be rolled back (usually) |
| Triggers fire | Triggers don't fire |
Question 8
Explain the difference between compiler and interpreter.
| Compiler | Interpreter |
|---|---|
| Translates entire program at once | Translates line by line |
| Creates executable file | No separate executable |
| Faster execution | Slower execution |
| Shows all errors at end | Shows error immediately |
| Examples: C, C++, Java | Examples: Python, JavaScript |
Question 9
What is the purpose of the 'static' keyword in Java?
- Static variable: Shared among all objects, single copy exists
- Static method: Can be called without object, belongs to class
- Static block: Executed when class is loaded
- Static class: Nested class that doesn't reference outer class
Question 10
Explain the concept of exception handling.
- try: Contains code that might throw exception
- catch: Handles specific exceptions
- finally: Always executes (cleanup code)
- throw: Explicitly throws an exception
- throws: Declares exceptions a method might throw
Benefits: Normal flow separation, graceful error recovery
š Verbal/English Questions with Solutions (10 Questions)
Question 1
Choose the correct synonym for PERNICIOUS:
a) Beneficial b) Harmful c) Helpful d) Innocent
Explanation: Pernicious means having a harmful effect, especially in a gradual or subtle way.
Question 2
Choose the correct antonym for ZEALOUS:
a) Enthusiastic b) Apathetic c) Eager d) Passionate
Explanation: Zealous means showing great energy or enthusiasm; apathetic means showing no interest or enthusiasm.
Question 3
Fill in the blank: The committee members _______ in favor of the proposal.
a) was b) were c) is d) has been
Explanation: "Committee members" is plural, so use plural verb "were."
Question 4
Error spotting: "Each of the students have submitted their assignments."
Explanation: "Each" is singular, so use singular verb "has."
Question 5
Rearrange: P: technology Q: has R: transformed S: the way we work
Question 6
Choose the correct preposition: She is proficient ______ playing the piano.
a) at b) in c) with d) for
Explanation: "Proficient in" is the correct collocation.
Question 7
One word substitution: A person who cannot be corrected.
a) Incorrigible b) Invincible c) Inevitable d) Infallible
Question 8
Idiom meaning: "To kick the bucket"
a) To start something b) To die c) To give up d) To succeed
Explanation: This is an informal/slang expression meaning to die.
Question 9
Direct to Indirect: He said, "I am working on a project."
Question 10
Reading Comprehension:
Passage about artificial intelligence and its impact on jobs...
Question: What is the author's main concern regarding AI?
a) AI will replace all jobs b) AI requires proper regulation and reskilling initiatives c) AI is not advanced enough d) AI should be banned
š Coding Questions with Solutions (5 Questions)
Question 1: Palindrome Check
Problem: Check if a given string is a palindrome.
Python Solution:
def is_palindrome(s):
# Remove non-alphanumeric and convert to lowercase
cleaned = ''.join(char.lower() for char in s if char.isalnum())
return cleaned == cleaned[::-1]
# Alternative without cleaning
def is_pal_simple(s):
left, right = 0, len(s) - 1
while left < right:
if s[left] != s[right]:
return False
left += 1
right -= 1
return True
# Test
print(is_palindrome("A man, a plan, a canal: Panama")) # True
print(is_pal_simple("racecar")) # True
Question 2: Factorial Calculation
Problem: Calculate factorial of a number (iterative and recursive).
Python Solution:
# Iterative approach
def factorial_iterative(n):
if n < 0:
return None
result = 1
for i in range(2, n + 1):
result *= i
return result
# Recursive approach
def factorial_recursive(n):
if n < 0:
return None
if n == 0 or n == 1:
return 1
return n * factorial_recursive(n - 1)
# Using built-in
import math
print(math.factorial(5)) # 120
# Test
print(factorial_iterative(5)) # 120
print(factorial_recursive(5)) # 120
Question 3: Two Sum Problem
Problem: Find two numbers in an array that add up to a target sum.
Python Solution:
def two_sum(nums, target):
# Hash map approach - O(n) time
seen = {}
for i, num in enumerate(nums):
complement = target - num
if complement in seen:
return [seen[complement], i]
seen[num] = i
return None
# Alternative: Two pointer (requires sorted array)
def two_sum_sorted(nums, target):
nums_sorted = sorted(enumerate(nums), key=lambda x: x[1])
left, right = 0, len(nums_sorted) - 1
while left < right:
current_sum = nums_sorted[left][1] + nums_sorted[right][1]
if current_sum == target:
return sorted([nums_sorted[left][0], nums_sorted[right][0]])
elif current_sum < target:
left += 1
else:
right -= 1
return None
# Test
print(two_sum([2, 7, 11, 15], 9)) # [0, 1]
Question 4: Reverse Words in String
Problem: Reverse the order of words in a given string.
Python Solution:
def reverse_words(s):
# Pythonic way
return ' '.join(s.split()[::-1])
# Manual approach
def reverse_words_manual(s):
words = []
word = ""
for char in s:
if char != ' ':
word += char
else:
if word:
words.append(word)
word = ""
if word:
words.append(word)
# Reverse and join
result = ""
for i in range(len(words) - 1, -1, -1):
result += words[i]
if i > 0:
result += " "
return result
# Test
print(reverse_words("the sky is blue")) # "blue is sky the"
print(reverse_words_manual("hello world")) # "world hello"
Question 5: Binary Search Implementation
Problem: Implement binary search to find an element in a sorted array.
Python Solution:
def binary_search(arr, target):
left, right = 0, len(arr) - 1
while left <= right:
mid = left + (right - left) // 2 # Avoid overflow
if arr[mid] == target:
return mid
elif arr[mid] < target:
left = mid + 1
else:
right = mid - 1
return -1 # Not found
# Recursive version
def binary_search_recursive(arr, target, left, right):
if left > right:
return -1
mid = left + (right - left) // 2
if arr[mid] == target:
return mid
elif arr[mid] < target:
return binary_search_recursive(arr, target, mid + 1, right)
else:
return binary_search_recursive(arr, target, left, mid - 1)
# Test
arr = [1, 3, 5, 7, 9, 11, 13]
print(binary_search(arr, 7)) # 3
print(binary_search_recursive(arr, 11, 0, len(arr)-1)) # 5
šÆ Interview Tips
-
Be Thorough with Your Resume: Every project, skill, and achievement mentioned can be questioned. Know them all in detail.
-
Practice Coding Under Time Pressure: Use platforms with timers to simulate exam conditions. Speed and accuracy both matter.
-
Focus on Database Concepts: SQL queries are frequently asked. Practice joins, subqueries, aggregate functions, and query optimization.
-
Understand System Design Basics: Even for freshers, basic understanding of scalable systems shows depth of knowledge.
-
Mock Interviews Help: Practice with friends or use platforms like Pramp. It reduces anxiety and improves articulation.
-
Stay Updated on Tech Trends: Mphasis values candidates who show interest in emerging technologies like cloud, AI, and automation.
-
Communication Skills Matter: The essay writing section tests your written communication. Practice writing concise, well-structured responses.
ā Frequently Asked Questions (FAQ)
Q1: What is the selection rate at Mphasis campus placements?
A: The selection rate varies but is typically around 5-10% of applicants. Good preparation significantly improves your chances.
Q2: Is calculator allowed in the aptitude test?
A: No, calculators are not allowed. Practice mental math and quick calculations.
Q3: What topics should I focus on for technical MCQs?
A: Focus on: C/C++/Java basics, OOPs, DBMS (SQL queries), Computer Networks, Operating Systems, and basic Data Structures.
Q4: How important is the essay writing section?
A: The essay section assesses written communication skills. It may be used as a tie-breaker or for HR discussion points. Take it seriously.
Q5: Does Mphasis have a service agreement?
A: Yes, typically there is a service agreement of 1-2 years. Details are shared in the offer letter.
š Additional Resources
- Practice Platforms: HackerRank, CodeChef, GeeksforGeeks
- Aptitude: RS Aggarwal books, IndiaBIX
- SQL Practice: SQLZoo, HackerRank SQL track
- Company Research: Visit Mphasis official website for recent updates
All the best for your Mphasis placement! š