Quiz2-DSA-FCPC

A web browser maintains a history of visited pages. When you press the “Back” button, the browser retrieves the last page you visited. Which data structure best models this behavior?

• Queue

• Stack

• Linked List

• Tree

A printer receives multiple print requests from users. It processes the first request received before the rest. Which structure is most suitable?

• Stack

• Queue

• Heap

• Tree

A recursive function for factorial(5) calls itself until n == 1. How many total calls are made?

• A. 4

• B. 5

• C. 6

• D. Infinite

In a customer service line, the first customer is served first. This behavior follows:

• LIFO

• FIFO

• FILO

• LILO

A recursive function without a base case will result in:

• Logical error

• Stack overflow

• Queue overflow

• Compilation error

During function execution, the system stores return addresses and local variables in a:

• Queue

• Stack

• Heap

• Array

A hospital triage system prioritizes patients based on severity instead of arrival order. Which structure is not suitable?

• Priority Queue

• Simple Queue

• Heap

• Stack

The recursive Fibonacci algorithm is inefficient because:

• It uses too many global variables

• It re-computes subproblems repeatedly

• It lacks parameters

When pushing elements onto a full stack, the error encountered is called:

• Underflow

• Overflow

• Deadlock

• Exception

Which of the following operations is not possible in a queue?

• Enqueue at front

• Dequeue from front

• Enqueue at rear

• Peek front element