Mphasis India software pvt ltd

Mphasis India software pvt ltd Interview Experience

Selection

Mphasis India software pvt ltd Interview Experience for Fresher Software Engineer, Jan 2026

Role

Software Engineer

Experience

Fresher

Platform

Campus

Prep Duration

10 months

Eligibility / Offer Details

6.3+ CGPA, (Salary package: 6 LPA)

Branch

Computer Science Engineering

Total Rounds

3 Rounds

Application Experience

This opportunity came through on-campus recruitment. Initially, we received a Google Form shared by our college, which I filled out to apply. After that, the company conducted an internal shortlisting process based on eligibility criteria and candidate profiles. The shortlisted candidates were then invited for an online assessment. Based on performance in this round, candidates were further shortlisted. After clearing the online test, the details for the interview rounds were shared with the selected candidates, and the process moved forward from there.

Preparation

Topics Prepared: Data Structures, Algorithms, SQL, OOPs, Operating Systems, DBMS, Puzzle Solving

Preparation Tips

Tip 1: Be consistent with DSA practice and focus on understanding patterns rather than memorizing solutions. Tip 2: Build at least 1–2 strong projects that you can confidently explain in depth. Tip 3: Learn from every rejection, analyze your mistakes, and improve for the next opportunity.

Resume Tips

Tip 1: Keep your resume concise (one page) and highlight only relevant skills, projects, and achievements. Tip 2: Make sure you can confidently explain everything you have written on your resume. Tip 3: Use proper formatting and clear bullet points to make your resume easy to read.

Interview Rounds (3)

Detailed breakdown of each evaluation round, questions asked, and candidate approaches.

Round 1

Round 1 — Online Coding Interview

90 minutesMediumCleared

Timing: The test was scheduled in the morning, with a login window from 10:00 AM to 10:30 AM. It was not a late-night process, and everything was conducted within the given time slot. Environment: The assessment was a fully proctored online test, so a quiet and distraction-free environment was necessary. We had to ensure proper system setup, stable internet connection, and webcam/mic access. Since a Secure Exam Browser (SEB) was used, all background apps, notifications, and security settings had to be properly managed beforehand. Other Significant Activities: The test consisted of a total of 55 questions. The first 20 questions were based on aptitude, followed by 15 questions on English. The remaining 20 questions covered technical fundamentals, including topics like Data Structures, Operating Systems, SQL, and DBMS. Proper system preparation and following all instructions in advance were very important to avoid any last-minute issues during the exam.

Problems & Questions Asked (35)

Puzzle

Problem Statement

Six submersibles – Argo, Beagle, Calypso, Dakar, Endurance, Fenris – were ranked from 1 (longest time underwater) to 6 (shortest). Argo stayed longer than Beagle but shorter than Calypso Dakar did not stay longer than Endurance Exactly two stayed longer than Endurance Fenris stayed longer than Beagle but shorter than Argo Dakar stayed longer than Fenris Find the complete ranking order. Based on above data, which submersible secured the second-longest duration? What is the exact position of Endurance? Which submersible is immediately ahead of Fenris?

Candidate Approach

Convert to inequalities Fix Endurance first (middle position)

Problem Statement

Puzzle

Seven engineers (Isha, Jatin, Kavya, Lokesh, Mehul, Nandita, Om) handled incidents classified as Minor, Major, Critical. Points: Minor = 3, Major = 5, Critical = 11 Example data: Isha handled 70 (30 Minor, 40 Major) Jatin handled 65 (25 Minor, 40 Critical) Kavya handled 80 (30 Major, 50 Critical) Lokesh handled 60 (40 Minor, 20 Major) Mehul handled 75 (25 Major, 50 Critical) Nandita handled 55 (35 Minor, 20 Critical) Om handled 65 (30 Minor, 35 Major) Find the ratio of Minor incidents (Isha + Lokesh) to Critical incidents (Mehul). Using same data, find total performance points earned by all engineers.

Candidate Approach

Tip 1: Extract only needed values Tip 2: Avoid full calculation

Problem Statement

Puzzle

What is the difference between ages of Sumit and Akash? (I) Sumit + Avinash = 45 (II) Akash and Shubham age difference = 10

Puzzle

What is the distance between Reema and Seema? (I) Reema travels at 15 m/s and reaches in 5 minutes (II) Seema reaches Reema in 10 minutes

Candidate Approach

Tip 1: Use Speed × Time

Problem Statement

Puzzle

Due to a glitch: East is shown as West South is shown as East A person moves according to directions and takes turns. Find final direction from starting point.

Candidate Approach

Tip 1: First correct directions Tip 2: Then solve

Problem Statement

Puzzle

A person walks 100 m North, turns right, walks 50 m, then left, etc. Find final direction or distance.

Candidate Approach

Tip 1: Draw diagram Tip 2: Track facing direction

Problem Statement

Puzzle

Five people A, B, C, D, E are ranked based on marks. Given multiple conditions like A > B, C < D, etc., find highest scorer.

Puzzle

Arrange people in increasing order of height based on indirect clues.

Puzzle

Six people are sitting in a row facing north. Given left/right conditions, find seating order.

Puzzle

Find ratio of two quantities given partial data.

Puzzle

Two persons travel at different speeds. Find distance/time.

Puzzle

Check whether given statements are sufficient to find a value.

Puzzle

Given tabular data, find totals/averages/ratios.

Puzzle

Choose the correct synonym of the word "Abundant" A) Scarce B) Plenty C) Rare D) Empty

Candidate Approach

Tip 1: Learn common synonyms and antonyms Tip 2: Use elimination method Tip 3: Think of real-life usage of the word

Puzzle

Problem Statement

Choose the correct antonym of the word “Expand” A) Increase B) Grow C) Contract D) Extend

Candidate Approach

Tip 1: Identify root meaning Tip 2: Focus on opposite meaning Tip 3: Avoid confusing similar words

Puzzle

Problem Statement

Choose the correct sentence: A) She don’t like coffee B) She doesn’t likes coffee C) She doesn’t like coffee D) She not like coffee

Candidate Approach

Tip 1: Check subject-verb agreement Tip 2: Identify singular/plural subject Tip 3: Avoid double verb forms

Puzzle

Problem Statement

Find the error: “He is more smarter than his brother.”

Candidate Approach

Tip 1: Avoid double comparison Tip 2: Use either “more” or “-er” Tip 3: Keep sentence simple

Puzzle

Problem Statement

He ______ to the gym every day. A) go B) goes C) going D) gone

Candidate Approach

Tip 1: Identify tense Tip 2: Check subject Tip 3: Use correct verb form

Problem Statement

Puzzle

Read the passage and answer: “What is the main idea of the passage?”

Candidate Approach

Tip 1: Read first and last lines carefully Tip 2: Avoid extreme options Tip 3: Focus on central theme

Puzzle

Problem Statement

Identify the error: “She has went to the market.”

Candidate Approach

Tip 1: Check verb forms Tip 2: “Has” requires past participle Tip 3: Correct form is “gone”

Puzzle

Problem Statement

He is fond ______ music. A) in B) on C) of D) at

Candidate Approach

Tip 1: Learn common preposition usage Tip 2: Practice fixed phrases Tip 3: Avoid literal translation

Puzzle

Problem Statement

She is ______ honest person. A) a B) an C) the D) no article

Candidate Approach

Tip 1: Check vowel sound Tip 2: “Honest” starts with silent h Tip 3: Use “an”

Problem Statement

Puzzle

Convert into passive: “They completed the work.”

Candidate Approach

Tip 1: Identify object Tip 2: Change tense correctly Tip 3: Use “was/were + V3”

Puzzle

Problem Statement

Direct/Indirect Speech He said, “I am happy.”

Candidate Approach

Tip 1: Change tense Tip 2: Remove quotes Tip 3: Adjust pronouns

Problem Statement

Puzzle

Meaning of “Break the ice”

Candidate Approach

Tip 1: Learn common idioms Tip 2: Use context Tip 3: Practice regularly

Problem Statement

Puzzle

Choose the correct spelling: A) Recieve B) Receive C) Receeve D) Recive

Candidate Approach

Tip 1: Remember rules (i before e except after c) Tip 2: Read frequently Tip 3: Practice writing

OOPS

Problem Statement

Explain what an instance variable is in object-oriented programming. Specifically, determine what each object instantiated from a class contains with respect to instance variables. (Learn)

Candidate Approach

Step 1: Identify that instance variables are defined inside a class Step 2: Understand object instantiation (creating objects from class) Step 3: Each object gets its own memory allocation Step 4: Conclude that each object has a separate copy of instance variables

OS

Problem Statement

Determine the correct statement regarding memory fragmentation in operating systems. (Learn)

Candidate Approach

Step 1: Understand memory allocation and deallocation Step 2: Observe repeated allocation/free cycles Step 3: Identify gaps forming in memory Step 4: Conclude fragmentation occurs due to repeated allocation/deallocation

Stack Operations

Problem Statement

Given a stack with elements [1,2,3,4,5] (top to bottom), perform the operations: pop(), pop(), push(7), peek(), pop(), push(9). Find the sequence of popped elements.

Candidate Approach

Step 1: Apply pop → removes top (1) Step 2: Apply pop → removes next (2) Step 3: push(7) → stack updated Step 4: peek() → returns 7 (not removed) Step 5: pop → removes 7 Step 6: push(9)

OOPS

Problem Statement

Determine which OOP concepts are represented when an interface defines methods and different classes implement them differently. (Learn)

Candidate Approach

Step 1: Understand interface provides method declarations Step 2: Different classes implement methods differently Step 3: Identify abstraction (hiding implementation) Step 4: Identify polymorphism (same method, different behavior)

Data Abstraction

Problem Statement

Explain what data abstraction involves in software engineering. (Learn)

Candidate Approach

Step 1: Identify data object Step 2: Determine relevant attributes Step 3: Hide unnecessary details Step 4: Focus on essential characteristics

Fibonacci Numbers

Problem Statement

Given a pseudocode that generates Fibonacci numbers and accumulates their sum, determine its functionality.

Candidate Approach

Step 1: Identify Fibonacci pattern Step 2: Track sequence generation Step 3: Observe summation logic Step 4: Conclude both generation and summation

Code Output

Problem Statement

Given variables a, b, c and bitwise operations followed by ternary comparison, determine the final output.

Candidate Approach

Step 1: Apply right shift → divide by 2 Step 2: Get values a=5, b=10, c=10 Step 3: Evaluate ternary condition Step 4: Select minimum value

OS

Problem Statement

Explain what happens when a page fault occurs in an operating system. (Learn)

Candidate Approach

Step 1: A process tries to access a page not present in RAM Step 2: Hardware raises a page fault interrupt Step 3: OS checks validity of memory reference Step 4: Required page is fetched from disk Step 5: Page is loaded into memory and execution resumes

OS

Problem Statement

Identify which among the given options are not valid task states in a Real-Time Operating System.

Candidate Approach

Step 1: List standard RTOS states → Ready, Running, Blocked Step 2: Compare with given options Step 3: Identify invalid state Step 4: Conclude “Created” is not a runtime state

Code Output

Problem Statement

Evaluate the output of a recursive function: f(n) = n + f(n-8) for n > 0, else stop. Find f(20).

Candidate Approach

Step 1: f(20) = 20 + f(12) Step 2: f(12) = 12 + f(4) Step 3: f(4) = 4 + f(-4) Step 4: f(-4) stops recursion Step 5: Add values → 20 + 12 + 4 = 36

Size Of

Problem Statement

Determine the output of sizeof applied to a pointer variable. (Learn)

Candidate Approach

Step 1: Identify variable type (pointer) Step 2: Understand sizeof returns memory size Step 3: Pointer size depends on system architecture Step 4: On 64-bit → size = 8 bytes

Agile Principles

Problem Statement

According to Agile principles, determine from where the best architectures, requirements, and designs emerge. (Learn)

Candidate Approach

Step 1: Understand Agile philosophy Step 2: Focus on team collaboration Step 3: Identify importance of autonomy Step 4: Conclude → self-organizing teams

OOPS

Problem Statement

A subclass extends a parent class by adding new behavior. Identify the concept used. (Learn)

Candidate Approach

Step 1: Identify parent-child class relationship Step 2: Subclass inherits properties Step 3: Adds new functionality Step 4: Conclude → inheritance

SQL

Problem Statement

Write the correct SQL syntax to insert a record into a table.

Candidate Approach

Step 1: Identify table and columns Step 2: Use INSERT INTO syntax Step 3: Provide values in correct order Step 4: Execute query

Left Shift

Problem Statement

Evaluate the result of left shifting a negative number: (-1 << 4).

Candidate Approach

Step 1: Represent -1 in two’s complement (all bits = 1) Step 2: Apply left shift by 4 bits Step 3: Last 4 bits become 0 Step 4: Result in hex → FFF0

SQL

Problem Statement

Explain the effect of the GRANT command with WITH GRANT OPTION. (Learn)

Candidate Approach

Step 1: Identify privileges (SELECT, DELETE) Step 2: Grant to user Step 3: WITH GRANT OPTION allows further delegation Step 4: User can grant same permissions to others

MST

Problem Statement

Identify which algorithms can be used to find the Minimum Spanning Tree of a graph. (Learn)

Candidate Approach

Step 1: Understand MST concept Step 2: Identify known algorithms Step 3: Prim’s Algorithm → greedy approach Step 4: Kruskal’s Algorithm → edge-based approach Step 5: Conclude both are valid

Round 2

Round 2 — Face to Face

25 minutesEasyCleared

Timing: The interview was conducted in the afternoon, around 2:00 PM. How was the environment: The environment was formal and well-organized. It took place in a discussion room within my institute, which was quiet and suitable for a face-to-face interaction. Overall, the setting was comfortable and helped maintain focus during the interview. Any other significant activity: Before the interview, there was an online assessment round. Candidates who cleared that round were shortlisted for the face-to-face interview. The process was smooth and conducted systematically within the campus. How the interviewer was: The interviewer was professional and calm. They asked questions related to technical concepts and problem-solving, and also a few general questions to understand my thinking approach. The interaction was interactive rather than stressful, and the interviewer was supportive during the discussion.

Problems & Questions Asked (3)

Puzzle

Problem Statement

There is a dark room containing a bucket filled with shuttlecocks of two different colors. Since the room is dark, you cannot distinguish the colors while picking them. What is the minimum number of shuttlecocks you must pick to guarantee that you have at least one matching pair of the same color?

Candidate Approach

Tip 1: Since the room is dark, assume the worst-case scenario while picking items. Tip 2: There are only two colors, so think in terms of the Pigeonhole Principle. Tip 3: Even if you pick two different colors first, the next pick will definitely match one of them.

Joins

Problem Statement

Explain all types of SQL JOINs with proper examples. Describe how different joins are used to retrieve data from multiple tables. (Learn)

Candidate Approach

Tip 1: Understand that JOIN is used to combine rows from two or more tables based on a related column. Tip 2: Focus on how matching and non-matching rows are handled in each join. Tip 3: Practice writing queries with small tables (like Employees & Departments).

Maximum Subarray Sum

Problem Statement

Given an array A[] of size N, find the maximum sum of any contiguous subarray.

Candidate Approach

Step 1: I first thought of generating all possible subarrays and calculating their sums. This approach had O(N²) time complexity, which is not efficient for large inputs. Step 2: Then I tried optimizing by keeping a running sum while traversing the array. Step 3: I applied Kadane’s Algorithm, where: I maintain a variable current_sum If current_sum becomes negative, I reset it to 0 I keep updating max_sum with the maximum value encountered Step 4: Finally, I obtained the maximum sum in O(N) time complexity.

Round 3

Round 3 — HR Round

5 minutesEasyCleared

Timing: The HR round was conducted in the afternoon, shortly after the technical rounds. How was the environment: The environment was formal yet comfortable. It was conducted face-to-face in the institute, and the overall process was smooth and well-organized. Any other significant activity: There were no additional activities in this round. It was a brief interaction mainly focused on HR-related questions. How the interviewer was: The interviewer was polite and straightforward. She asked a simple question regarding willingness to relocate, to which I responded positively. The interaction was quick, and I was selected after this round.

Problems & Questions Asked (1)

HR Questions

Problem Statement

In the HR round, I was asked a simple and direct question: “Are you comfortable with relocation?”

Selection Perspective

I was selected for this role. I believe my selection was due to a combination of strong preparation and clear presentation. I had a well-structured resume with meaningful projects, and I ensured that I could explain every detail confidently. My consistent practice in DSA helped me solve both coding questions in the online test, which played a key role in qualifying for the interview. During the interview, I stayed calm and composed, which helped me think clearly and communicate my answers effectively. Instead of rushing, I focused on explaining my thought process properly. Overall, a mix of strong fundamentals, project knowledge, problem-solving skills, and good communication contributed to my selection.

Key Preparation Tips

Prepare DSA thoroughly.

Practice aptitude and puzzle-based questions.

Have at least two good projects on your resume.

Be prepared to explain your projects clearly.

Practice coding problems involving Arrays, Binary Search, DP and Recursion.

Prepare common HR questions such as Tell me about yourself and Who is your role model?

Candidate Approach