DSA (QUIZ 2) Stacks and Queues Quiz

What is a stack?

• A collection of elements identified by an index.

• A linear data structure that follows First In, First Out (FIFO) principle.

• A collection of nodes with pointers.

• A linear data structure that follows Last In, First Out (LIFO) principle.

Which operation is not typically associated with stacks?

• Push

• Pop

• Enqueue

• Peek

In which order are elements accessed in a queue?

• Random order

• Last In, First Out (LIFO)

• First In, First Out (FIFO)

• In reverse order

Which of the following operations is used to add an element to a stack?

• Pop

• Enqueue

• Push

• Peek

What does the dequeue operation do in a queue?

• Adds an element to the end of the queue

• Removes an element from the front of the queue

• Adds an element to the front of the queue

• Removes an element from the end of the queue

Which of the following is an application of stacks?

• Managing browser history

• Printer job scheduling

• Task scheduling in operating systems

• File download management

What is the result of the following sequence of operations on an empty stack? Push(1), Push(2), Pop(), Push(3), Pop()

• 1

• 2

• 3

• Stack is empty

In a queue, where is a new element added?

• Front

• Middle

• Back

• Random position

Which operation retrieves, but does not remove, the top element of a stack?

• Push

• Peek

• Pop

• Dequeue

Which data structure is ideal for implementing breadth-first search (BFS) in graphs?

• Stack

• Queue

• Array

• Linked List