AMCAT Basic Data Structures 3

Question 1

Which operation is used to remove an element from the front of a queue?

Accepted Answer

Dequeue

Answer

Dequeue (also called dequeue or poll) removes and returns the front element of a queue.

Question 2

A stack implemented using an array of size N can hold at most how many elements before overflow occurs?

Accepted Answer

N

Answer

An array-based stack of size N can hold exactly N elements before a stack overflow condition.

Question 3

What does the 'peek' (or 'top') operation on a stack return?

Accepted Answer

Returns the top element without removing it

Answer

Peek inspects the top element of the stack without modifying the stack.

Question 4

Which abstract data type is most appropriate for implementing a print spooler?

Accepted Answer

Queue

Answer

A print spooler processes jobs in the order they arrive (FIFO), making a queue the natural choice.

Question 5

In a deque (double-ended queue), insertions and deletions can occur at:

Accepted Answer

Both front and rear

Answer

A deque allows insertions and deletions at both the front and rear ends.

(AMCAT) Aspiring Minds Computer Adaptive Test Practice Test