Stacks and Queues - Applications for Competitive Exams

Stacks and Queues - Applications - Case Studies

Q. In which scenario would a queue be used in a web server?

Solution

A queue is used to handle incoming requests in a web server, processing them in the order they arrive.

Correct Answer: B — To handle incoming requests

Q. In which scenario would a stack be preferred over a queue?

Solution

A stack is preferred when tasks need to be processed in a last-in, first-out (LIFO) manner, such as in backtracking algorithms.

Correct Answer: A — When processing tasks in a last-in, first-out manner

Q. What data structure is used to implement a breadth-first search (BFS)?

Solution

A queue is used to implement breadth-first search (BFS) as it processes nodes in a first-in, first-out (FIFO) manner.

Correct Answer: B — Queue

Q. What is the primary advantage of using a stack for expression evaluation?

Solution

Stacks are advantageous for expression evaluation because they can handle parentheses and operator precedence correctly.

Correct Answer: B — Handles parentheses correctly

Q. Which application uses a stack to reverse a string?

Solution

A stack can be used to reverse a string by pushing each character onto the stack and then popping them off.

Correct Answer: B — Stack

Q. Which of the following is a typical use case for queues?

Solution

Queues are commonly used in task scheduling in operating systems to manage processes in a first-come, first-served manner.

Correct Answer: B — Task scheduling in operating systems

Q. Which of the following operations is typically O(1) for both stacks and queues?

Solution

Removing an element (pop for stacks and dequeue for queues) is typically O(1) for both data structures.

Correct Answer: C — Removing an element

Showing 1 to 7 of 7 (1 Pages)