MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 18 Mcqs, each offering curated multiple-choice questions to sharpen your Microprocessors knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
A stack can be implemented using queue, but then we need to use atleast: |
| A. | 3 queues |
| B. | 2 queues |
| C. | only one queue is sufficient |
| D. | none of the options |
| Answer» C. only one queue is sufficient | |
| 2. |
_________ is First in Last Out kind of data structure. |
| A. | Queue |
| B. | Array |
| C. | Deque |
| D. | Stack |
| Answer» E. | |
| 3. |
In what order the elements of a pushdown stack are accessed? |
| A. | First In First Out (FIFO) |
| B. | Last In Last Out (LILO) |
| C. | Last In First Out (LIFO) |
| D. | None of the above |
| Answer» D. None of the above | |
| 4. |
A stack is implemented with an array of ‘A [0..N – 1]’ and a variable ‘pos’. The push and pop operations are defined by the following code.push(x) A[pos] ← x pos ← pos – 1end pushpop( ) pos ← pos + 1 return A[pos]end popWhich of the following will initialize an empty stack with capacity N for the above implementation? |
| A. | pos ← -1 |
| B. | pos ← 0 |
| C. | pos ← 1 |
| D. | pos ← N - 1 |
| Answer» E. | |
| 5. |
A run-time stack cannot be used in a round-robin scheduling system because of the _________ nature of scheduling. |
| A. | LIFO (Last in First out) |
| B. | FIFO (First in First out) |
| C. | FILO (First in Last out) |
| D. | None of the above |
| Answer» B. FIFO (First in First out) | |
| 6. |
For implementation of recursion system uses _______ data structure. |
| A. | Stack |
| B. | Linked List |
| C. | Deque |
| D. | Queue |
| Answer» B. Linked List | |
| 7. |
A recursive problem like tower of hanoi can be rewritten without recursion using: |
| A. | stack |
| B. | priority queue |
| C. | graph |
| D. | cycles |
| Answer» B. priority queue | |
| 8. |
If the sequence of operations - push (1), push (2), pop, push (1), push (2), pop, pop, pop, push (2), pop are performed on a stack, the sequence of popped out values |
| A. | 2, 2, 1, 1, 2 |
| B. | 2, 2, 1, 2, 2 |
| C. | 2, 1, 2, 2, 1 |
| D. | 2, 1, 2, 2, 2 |
| Answer» B. 2, 2, 1, 2, 2 | |
| 9. |
THE_PID_TEMPERATURE_CONTROLLER_USING_8086_HAS?$ |
| A. | data flow |
| B. | data flow and uses queue |
| C. | sequential flow |
| D. | sequential flow and uses stack |
| Answer» E. | |
| 10. |
THE_BOOKS_ARRANGED_ONE_ON_THE_OTHER_ON_A_TABLE_IS_AN_EXAMPLE_OF?$ |
| A. | queue |
| B. | queue and first-in-first out |
| C. | stack |
| D. | stack and last-in-first-out |
| Answer» E. | |
| 11. |
The reverse process of transferring the data back from the stack to the CPU register is known a? |
| A. | pulling out the stack |
| B. | pushing out the stack |
| C. | popping out the stack |
| D. | popping off the stack |
| Answer» E. | |
| 12. |
The process of storing the data in the stack is called ……… the stack.$ |
| A. | pulling into |
| B. | pulling out |
| C. | pushing into |
| D. | popping into |
| Answer» D. popping into | |
| 13. |
While retrieving data from the stack, the stack pointer is |
| A. | incremented by 1 |
| B. | incremented by 2 |
| C. | decremented by 1 |
| D. | decremented by 2 |
| Answer» C. decremented by 1 | |
| 14. |
As the storing of data words onto the stack is increased, the stack pointer is |
| A. | incremented by 1 |
| B. | decremented by 1 |
| C. | incremented by 2 |
| D. | decremented by 2 |
| Answer» E. | |
| 15. |
The Stack is accessed using |
| A. | SP register |
| B. | SS register |
| C. | SP and SS register |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 16. |
The stack is useful for |
| A. | storing the register status of the processor |
| B. | temporary storage of data |
| C. | storing contents of registers temporarily inside the CPU |
| D. | all of the mentioned |
| Answer» E. | |
| 17. |
If the processor is executing the main program that calls a subroutine, then after executing the main program up to the CALL instruction, the control will be transferred to |
| A. | address of main program |
| B. | subroutine address |
| C. | address of CALL instruction |
| D. | none of the mentioned |
| Answer» C. address of CALL instruction | |
| 18. |
The Stack follows the sequence |
| A. | first-in-first-out |
| B. | first-in-last-out |
| C. | last-in-first-out |
| D. | last-in-last-out |
| Answer» D. last-in-last-out | |