Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by Mphasis Team. If you also belong to the team, you can get access from here

Mphasis Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Mphasis Java Developer Interview Questions and Answers for Freshers

Updated 21 Aug 2024

Mphasis Java Developer Interview Experiences for Freshers

1 interview found

Interview experience
1
Bad
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Not Selected

I applied via Approached by Company and was interviewed in Sep 2023. There was 1 interview round.

Round 1 - Technical 

(2 Questions)

  • Q1. Reverse string Java code
  • Q2. Java 8 features

Interview Preparation Tips

Topics to prepare for Mphasis Java Developer interview:
  • Java 8
  • Java code
  • Core Java
  • SQL
Interview preparation tips for other job seekers - Just give your best and do not expect any revert from HR.
Right one will approach you.

Top trending discussions

View All
Interview Tips & Stories
6d (edited)
a team lead
Why are women still asked such personal questions in interview?
I recently went for an interview… and honestly, m still trying to process what just happened. Instead of being asked about my skills, experience, or how I could add value to the company… the questions took a totally unexpected turn. The interviewer started asking things like When are you getting married? Are you engaged? And m sure, if I had said I was married, the next question would’ve been How long have you been married? What does my personal life have to do with the job m applying for? This is where I felt the gender discrimination hit hard. These types of questions are so casually thrown at women during interviews but are they ever asked to men? No one asks male candidates if they’re planning a wedding or how old their kids are. So why is it okay to ask women? Can we please stop normalising this kind of behaviour in interviews? Our careers shouldn’t be judged by our relationship status. Period.
Got a question about Mphasis?
Ask anonymously on communities.

Interview questions from similar companies

I appeared for an interview before Jun 2021.

Round 1 - Coding Test 

Had DSA and aptitude questions

Round 2 - Technical 

(1 Question)

  • Q1. DSA a questions, Database Questions
Round 3 - HR 

(1 Question)

  • Q1. 5 min question and answers about company

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare DSA and database management

Java Developer Interview Questions Asked at Other Companies for Fresher

asked in Deloitte
Q1. Sort 0 and 1 Problem Statement Given an integer array ARR of size ... read more
asked in Deloitte
Q2. Convert BST to Greater Sum Tree Given a Binary Search Tree (BST) ... read more
Q3. Besides inheritance, what other mechanisms can you use to connect ... read more
Q4. Do you have any Java certifications?
Q5. How do you change the background color of a div element?

I appeared for an interview in Oct 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 75 min
Round difficulty - Medium

This round was MCQ and coding round. 25 MCQs and one coding question were asked. MCQs were based on OS, DBMS, Aptitude and Data Structures.

  • Q1. 

    Minimum Days to Complete Work

    You have 'N' tasks to complete. Each task can only be done on one of two specific days provided in two arrays: day1 and day2.

    For each task i, day1[i] represents the earliest...

  • Ans. 

    Find the minimum number of days required to complete all tasks given specific completion days for each task.

    • Sort the tasks based on day1 in ascending order.

    • For each task, choose the minimum of day1 and day2 as the completion day.

    • Keep track of the maximum completion day for each task.

    • The final answer is the maximum completion day of all tasks.

  • Answered by AI
Round 2 - Video Call 

(1 Question)

Round duration - 30 min
Round difficulty - Easy

This was a Data Structural round. Only one coding question was asked by the interviewer. The interviewer was very friendly. This round was very easy.

  • Q1. 

    Bubble Sort Problem Statement

    Sort the given unsorted array consisting of N non-negative integers in non-decreasing order using the Bubble Sort algorithm.

    Input:

    The first line contains an integer 'T' r...
  • Ans. 

    Bubble Sort algorithm is used to sort an array of non-negative integers in non-decreasing order.

    • Implement the Bubble Sort algorithm to sort the array in place.

    • Compare adjacent elements and swap them if they are in the wrong order.

    • Repeat this process until the array is sorted.

    • Time complexity of Bubble Sort is O(n^2) in the worst case.

    • Example: For input [6, 2, 8, 4, 10], the output should be [2, 4, 6, 8, 10].

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from TIET - Thapar Institute of Engineering And Technology. I applied for the job as SDE - 1 in GurgaonEligibility criteria8Optum interview preparation:Topics to prepare for the interview - Data Structures, Pointers, OOPS,Dynamic Programminng,Operating System,DBMSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Be confident! 
Tip 2 : Maintain high Cgpa
Tip 3 : Do your best

Application resume tips for other job seekers

Tip 1 : Mention clear points
Tip 2 : Atleast 3 projects and never put anything you have not revised

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 75 minutes
Round difficulty - Medium

It was in the evening.
It consisted of 26 questions of easy to hard level.
It consisted of 25 MCQs and only 1 coding problem.

  • Q1. 

    Author and Books Formatting

    Given a structured list of books and their authors, format the information as specified.

    Input:

    The first line of input contains an integer ‘T' representing the number of tes...
  • Ans. 

    The task is to format a list of authors and their books in a specific way as per the given input format.

    • Parse the input to extract the number of test cases, number of authors, author names, and their respective books.

    • Format the output by printing the author names and their books in the specified format.

    • Ensure correct sequence and labeling of authors and books as per the example provided.

    • Handle multiple test cases and a...

  • Answered by AI
Round 2 - Video Call 

(1 Question)

Round duration - 15 minutes
Round difficulty - Medium

It was more of CV based round. A brief discussion on projects was there followed by some questions like why optum.

  • Q1. 

    Delete a Node from a Linked List

    You are provided with a linked list of integers. Your task is to implement a function that deletes a node located at a specified position 'POS'.

    Input:

    The first line co...
  • Ans. 

    Implement a function to delete a node from a linked list at a specified position.

    • Traverse the linked list to find the node at the specified position.

    • Update the pointers of the previous and next nodes to skip the node to be deleted.

    • Handle edge cases such as deleting the head or tail of the linked list.

    • Ensure to free the memory of the deleted node to avoid memory leaks.

  • Answered by AI
Round 3 - Video Call 

(1 Question)

Round duration - 15 minutes
Round difficulty - Easy

A short round where some basic dbms questions like procedure, cursor were asked. Then some questions on whether I would prefer working alone or in a team. Where I see myself in 5 years.

  • Q1. 

    Graph Coloring Problem

    You are given a graph with 'N' vertices numbered from '1' to 'N' and 'M' edges. Your task is to color this graph using two colors, such as blue and red, in a way that no two adjacen...

  • Ans. 

    Given a graph with 'N' vertices and 'M' edges, determine if it can be colored using two colors without adjacent vertices sharing the same color.

    • Use graph coloring algorithm like BFS or DFS to check if the graph can be colored with two colors without conflicts.

    • Check if any adjacent vertices have the same color. If so, it is not possible to color the graph as described.

    • If the graph has connected components, color each co...

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 8 CGPA, Computer oriented branchesOptum interview preparation:Topics to prepare for the interview - DBMS, Data Structures, Algorithms, Puzzles, Operating Systems, OOPSTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Projects do not matter much for this company.
Tip 2 : I did almost all the puzzles from Interviewbit.
Tip 3 : DBMS is really important. Practice queries in SQL thoroughly. You should know the use of limit and top also. It may be asked to write the same query in more than 1 form.
Tip 4 : Practice all the data structures. Questions were simple and you should know the basics of every data structure.

Application resume tips for other job seekers

Tip 1 : Don't write anything just for the sake of it.
Tip 2 : If you are writing some project then be thorough with all the details. If you are not much confident, then simply remove it and focus on other subjects.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview Questionnaire 

1 Question

  • Q1. Basic questions related to skillset

I appeared for an interview in Dec 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

  • Q1. Can you explain Bipolar Junction Transistors (BJTs)?
  • Ans. 

    BJTs are three-terminal semiconductor devices used for amplification and switching of electronic signals.

    • BJTs have three regions - emitter, base, and collector.

    • They can be NPN or PNP type, depending on the arrangement of semiconductor materials.

    • BJTs are current-controlled devices, where a small current at the base terminal controls a much larger current between the collector and emitter.

    • Common BJT examples include 2N22...

  • Answered by AI
  • Q2. 

    Graph Coloring Problem

    You are given a graph with 'N' vertices numbered from '1' to 'N' and 'M' edges. Your task is to color this graph using two colors, such as blue and red, in a way that no two adjacen...

  • Ans. 

    Graph coloring problem where vertices need to be colored with two colors such that no adjacent vertices share the same color.

    • Check if the graph can be colored using two colors without any adjacent vertices sharing the same color.

    • Use graph coloring algorithms like Greedy Coloring or Backtracking to solve the problem.

    • If there are odd-length cycles in the graph, it is not possible to color the graph with two colors.

    • If the...

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 30 minutes
Round difficulty - Easy

  • Q1. Can you explain in detail about Stacks and Graphs?
  • Ans. 

    Stacks are data structures that follow the Last In First Out (LIFO) principle, while Graphs are data structures that consist of nodes and edges to represent relationships.

    • Stacks are used for implementing functions, backtracking, and expression evaluation.

    • Graphs are used for representing networks, social connections, and shortest path algorithms.

    • Stacks can be implemented using arrays or linked lists.

    • Graphs can be direct...

  • Answered by AI
  • Q2. 

    Rat in a Maze: All Paths Problem

    You are provided with an N * N maze where a rat is positioned at starting cell MAZE[0][0]. The goal is to determine and print all possible paths that the rat can take to r...

  • Ans. 

    Find all possible paths for a rat in a maze from start to finish.

    • Use backtracking to explore all possible paths in the maze.

    • At each cell, check if it is a valid move and mark it as part of the path.

    • Explore all four directions (up, down, left, right) recursively.

    • When reaching the destination cell, add the path to the result.

    • Return all valid paths found in the maze.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Lokmanya Tilak College of Engineering. Eligibility criteria5+ CGPAHexaware Technologies interview preparation:Topics to prepare for the interview - Data Structures, OOPS, DBMS, OOPs, Algorithms, DP, Greedy, Electronics BasicsTime required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

Tip 1 : Do learn EDC.
Tip 2 : Should know about Multivibrators and electronics basics.
Tip 3 : Do learn some extra technologies eg. ML/AI.

Application resume tips for other job seekers

Tip 1: Do not lie at all
Tip 2: Write every project/internship

Final outcome of the interviewRejected

Skills evaluated in this interview

I appeared for an interview in Dec 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 50 Minutes
Round difficulty - Medium

first round was aptitude round + coding round.

  • Q1. 

    Ninja Competition Problem Statement

    Ninja is organizing a coding competition where two teams compete at a time. To keep it fair and interesting, both teams must have an equal number of members. Ninja’s ta...

  • Ans. 

    Given an integer N, determine if two teams with equal members can be formed based on the divisors of N.

    • Iterate through all divisors of N and assign members to two teams based on whether the divisor is even or odd.

    • Keep track of the number of members in each team and check if they are equal at the end.

    • Return true if the number of members in both teams is equal, false otherwise.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Lovely Professional University. I applied for the job as SDE - 1 in ChennaiEligibility criteria6 CGPAHexaware Technologies interview preparation:Topics to prepare for the interview - Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming, OSTime required to prepare for the interview - 3 MonthsInterview preparation tips for other job seekers

Tip 1 : Practice more coding problem
Tip 2 : Brush Data structure thoroughly
Tip 3 : Be confident in interview and be clear while explaining solution to interviewer.

Application resume tips for other job seekers

Tip 1 : Try to make it more concise
Tip 2 : Try to add more projects as well as about hackathon.

Final outcome of the interviewRejected
Are these interview questions helpful?

Interview Questionnaire 

1 Question

  • Q1. Regarding C and C++

Interview Preparation Tips

Interview preparation tips for other job seekers - It was prety easy to answer,upon Hr questions was normal

Interview Questionnaire 

2 Questions

  • Q1. Tell about you
  • Q2. What is computer networking
  • Ans. 

    Computer networking is the practice of connecting devices together to share resources and communicate with each other.

    • Computer networking involves the use of hardware and software to connect devices together, such as computers, printers, and servers.

    • Networking protocols, such as TCP/IP, are used to facilitate communication between devices.

    • Examples of computer networks include local area networks (LANs), wide area netwo...

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - 1 round will be aptitude test and 2 nd round will be group discussion and finally there will be technical hr and general hr round

Skills evaluated in this interview

I appeared for an interview before Oct 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 30 Minutes
Round difficulty - Medium

  • Q1. 

    Count Ways to Reach the N-th Stair Problem Statement

    You are provided with a number of stairs, and initially, you are located at the 0th stair. You need to reach the Nth stair, and you can climb one or tw...

  • Ans. 

    The problem involves counting the number of distinct ways to climb N stairs by taking 1 or 2 steps at a time.

    • Use dynamic programming to solve the problem efficiently.

    • The number of ways to reach the Nth stair is equal to the sum of ways to reach (N-1)th stair and (N-2)th stair.

    • Handle base cases for N=0 and N=1 separately.

    • Consider using modulo operation to avoid overflow for large values of N.

  • Answered by AI
Round 2 - HR 

Round duration - 15 Minutes
Round difficulty - Easy

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in HyderabadEligibility criteria6.5DXC Technology interview preparation:Topics to prepare for the interview - Oops, Dbms, Sql, c++ , data structures, computer networkTime required to prepare for the interview - 3 MonthsInterview preparation tips for other job seekers

Tip 1 : learn oops concept on tips 
Tip 2 : try to do fixing questions in any language 
Tip 3 : try to practice for aptitude very well practice 50-100 questions daily

Application resume tips for other job seekers

Tip 1 : must have 2 projects
Tip 2 : only write those things in your resume you are sure about them and have a very great knowledge about them

Final outcome of the interviewSelected

Mphasis Interview FAQs

How many rounds are there in Mphasis Java Developer interview for freshers?
Mphasis interview process for freshers usually has 1 rounds. The most common rounds in the Mphasis interview process for freshers are Technical.
How to prepare for Mphasis Java Developer interview for freshers?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at Mphasis. The most common topics and skills that interviewers at Mphasis expect are Java, Spring Boot, Microservices, Hibernate and Spring.
What are the top questions asked in Mphasis Java Developer interview for freshers?

Some of the top questions asked at the Mphasis Java Developer interview for freshers -

  1. Reverse string Java c...read more
  2. OOP's Concept Exception handling Difference between abstraction and interfa...read more
  3. Can you use same static method in two different interf...read more

Tell us how to improve this page.

Overall Interview Experience Rating

1/5

based on 1 interview experience

Difficulty level

Moderate 100%

Duration

2-4 weeks 100%
View more
Mphasis Java Developer Salary
based on 273 salaries
₹3.1 L/yr - ₹7.7 L/yr
17% less than the average Java Developer Salary in India
View more details

Mphasis Java Developer Reviews and Ratings

based on 22 reviews

3.7/5

Rating in categories

3.4

Skill development

3.7

Work-life balance

3.3

Salary

3.5

Job security

3.4

Company culture

3.2

Promotions

3.5

Work satisfaction

Explore 22 Reviews and Ratings
Software Engineer
6.7k salaries
unlock blur

₹4 L/yr - ₹8.4 L/yr

Senior Software Engineer
6k salaries
unlock blur

₹6.6 L/yr - ₹20 L/yr

Associate Software Engineer
4.9k salaries
unlock blur

₹2 L/yr - ₹5.6 L/yr

Module Lead
2.5k salaries
unlock blur

₹15.8 L/yr - ₹27 L/yr

Transaction Processing Officer
2.3k salaries
unlock blur

₹1.4 L/yr - ₹4.7 L/yr

Explore more salaries
Compare Mphasis with

Cognizant

3.7
Compare

Wipro

3.7
Compare

Accenture

3.7
Compare

TCS

3.6
Compare
write
Share an Interview