MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 9 Mcqs, each offering curated multiple-choice questions to sharpen your Technical MCQs knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Which of the following concepts of OOPS means exposing only necessary information to client? |
| A. | Abstraction |
| B. | Encapsulation |
| C. | Data binding |
| D. | Data hiding |
| E. | |
| Answer» D. Data hiding | |
| 2. |
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 |
| Answer» D. Not Inherited | |
| 3. |
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 |
| Answer» B. Radix | |
| 4. |
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 |
| Answer» C. N-1 | |
| 5. |
As aproject, 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 |
| Answer» D. Perforate | |
| 6. |
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 |
| Answer» D. Compiler | |
| 7. |
Which of the following data structures is needed to convert infix notations to postfix notations? |
| A. | Stack |
| B. | Linked List |
| C. | Queues |
| D. | Tree |
| Answer» B. Linked List | |
| 8. |
Sorting is not possible by using which of the following methods? |
| A. | Insertion |
| B. | Selection |
| C. | Exchange |
| D. | Deletion |
| Answer» E. | |
| 9. |
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 |
| Answer» D. None of the above | |