Mphasis Technical Ability Questions And Answers

Mphasis Technical Ability MCQs : This section focuses on "Technical Ability" for Mphasis placement drives. These Technical Ability MCQs are asked in previous Mphasis placements/recruitment exams and will help you to prepare for upcoming Mphasis drives.

1. A tree has 5 levels and each node has either 4 children or no children. All nodes on the same level have the same number of children. How many nodes are there in the tree? (Root is Level 1)

A. 341
B. 256
C. 1024
D. None of the above

View Answer

2. Sorting is not possible by using which of the following methods?

A. Insertion
B. Selection
C. Exchange
D. Deletion

View Answer

3. Which of the following data structures is needed to convert infix notations to postfix notations?

A. Stack
B. Linked List
C. Queues
D. Tree

View Answer

4. What collects all the source code for an application and prepares them to be ready for execution?

A. Executor
B. Loader
C. Linker
D. Compiler

View Answer

5. As a¬†project, Parag wants to write a code which should increment its value until a condition is satisfied. Which type of structure should he be using?

A. For
B. While
C. Do While
D. Perforate

View Answer

6. The default parameter passing mechanism is

A. call by value
B. call by reference
C. call by value result
D. None of the above

View Answer

7. In a Doubly Linked list how many nodes have atleast 1 node before and after it?

A. N+1
B. N
C. N-1
D. N-2

View Answer

8. Which of the following Sorting Algorithm will perform the worst if the numbers are ordered in the opposite form?

A. Quick Sort
B. Radix
C. Bubble
D. Selection

View Answer

9. In c++ how are protected members of a base class accessed in derived class when inherited privately

A. Privately
B. Publicly
C. Protectedly
D. Not Inherited

View Answer

10. Which of the following concepts of OOPS means exposing only necessary information to client?

A. Abstraction
B. Encapsulation
C. Data binding
D. Data hiding

View Answer


* You must be logged in to add comment.