Algorithms Technology & Digital Applications 4

Question 1

A web browser maintains a Back button history. Pressing Back retrieves the previous page. Which abstract data type models this?

Accepted Answer

Stack

Answer

A stack's LIFO (last-in, first-out) behavior perfectly models browser history where the most recently visited page is retrieved first.

Question 2

A printer queues jobs and processes them in the order they arrive. Which data structure models the print queue?

Accepted Answer

Queue

Answer

A queue's FIFO (first-in, first-out) property ensures print jobs are processed in the order they were submitted.

Question 3

A network router decides which packet to forward next based on the highest priority flag. What data structure should the router use?

Accepted Answer

Priority Queue (Heap)

Answer

A priority queue (implemented as a heap) allows the router to always dequeue the highest-priority packet in O(log n) time.

Question 4

A programming language runtime tracks function calls so it can return to the correct caller. What does it use?

Accepted Answer

Call stack

Answer

The call stack stores return addresses and local variables, ensuring functions resume at the correct point after returning.

Question 5

A distributed system processes tasks as soon as workers become free, regardless of submission order. Which queue variant is most appropriate?

Accepted Answer

Work-stealing deque

Answer

Work-stealing deques let idle workers steal tasks from busy workers' queues, balancing load dynamically in distributed systems.

Algorithms Practice Test