MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 7 Mcqs, each offering curated multiple-choice questions to sharpen your Data Structure knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Queues serve major role in ______________ |
| A. | Simulation of recursion |
| B. | Simulation of arbitrary linked list |
| C. | Simulation of limited resource allocation |
| D. | Simulation of heap sort |
| Answer» D. Simulation of heap sort | |
| 2. |
A normal queue, if implemented using an array of size MAX_SIZE, gets full when? |
| A. | Rear = MAX_SIZE 1 |
| B. | Front = (rear + 1)mod MAX_SIZE |
| C. | Front = rear + 1 |
| D. | Rear = front |
| Answer» B. Front = (rear + 1)mod MAX_SIZE | |
| 3. |
A data structure in which elements can be inserted or deleted at/from both ends but not in the middle is? |
| A. | Queue |
| B. | Circular queue |
| C. | Dequeue |
| D. | Priority queue |
| Answer» D. Priority queue | |
| 4. |
If the elements A , B , C and D are placed in a queue and are deleted one at a time, in what order will they be removed? |
| A. | ABCD |
| B. | DCBA |
| C. | DCAB |
| D. | ABDC |
| Answer» B. DCBA | |
| 5. |
Circular Queue is also known as ________ |
| A. | Ring Buffer |
| B. | Square Buffer |
| C. | Rectangle Buffer |
| D. | Curve Buffer |
| Answer» B. Square Buffer | |
| 6. |
A queue follows __________ |
| A. | FIFO (First In First Out) principle |
| B. | LIFO (Last In First Out) principle |
| C. | Ordered array |
| D. | Linear tree |
| Answer» B. LIFO (Last In First Out) principle | |
| 7. |
A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear) is known as _____________ |
| A. | Queue |
| B. | Stack |
| C. | Tree |
| D. | Linked list |
| Answer» B. Stack | |