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

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

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

A recursive function without a base case will result in:

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

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

The recursive Fibonacci algorithm is inefficient because:

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

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

A palindrome checker using a stack compares characters in what order?

In a call stack, each new function call is added to:

A queue implemented with two stacks performs enqueue by:

Which of the following is an application of recursion?

When a queue is implemented as a circular queue, which problem is avoided?

A recursive function that computes the sum of digits of 1234 returns:

Which structure would best handle the undo feature in a text editor?

A stack follows the First In First Out (FIFO) principle.

Recursion always requires a base case to prevent infinite calls.

A queue can be used to implement recursion.

In a stack, the pop() operation removes the most recently added element.

Tail recursion is a type of recursion that can be optimized by the compiler.

A circular queue automatically wraps around when it reaches the end of the array.

The factorial of zero (0!) equals one, even in recursive implementation.

A recursive function always performs faster than an iterative one.

Queue underflow occurs when trying to enqueue to a full queue.

The call stack keeps track of function calls and their local variables.

The data structure used to reverse a string is called a __________.

In recursion, the point where the function stops calling itself is called the __________.

The two main operations in a queue are __________ and __________.

When a stack is empty and a pop operation is attempted, it causes a __________ error.

The function call mechanism in most programming languages uses a __________ internally.

The process of one function calling itself directly or indirectly is called __________.

In a circular queue, the rear pointer wraps around to the __________ of the array.

The operation that adds an element at the rear end of a queue is called __________.

A stack that grows beyond its maximum limit results in a __________ error.