Data Structures and Algorithms Quiz2

The least recently added

The most recently added

The item at the middle

The item with the maximum value

Insertions and deletions can happen at any end in a stack

In a queue, deletions occur at the front, while in a stack, they occur at the top

In a stack, insertions occur at the end, while in a queue, they occur at the rear

There is no difference between a stack and a queue

When the front is equal to the rear

When the front is one less than the rear

When the rear is equal to the capacity

When the front is equal to the capacity

The first and last elements in the queue

The maximum and minimum values in the queue

The indices of the smallest and largest elements

The current and next elements in the queue

Last-In-First-Out (LIFO)

First-In-First-Out (FIFO)

Random-In-Random-Out (RIRI)

None of the above

Circular Queue

Priority Queue

Double-Ended Queue

Linear Queue

To manage CPU scheduling

To overcome boundary case problems in array implementation

To execute undo and redo operations

To represent sorting heap

Linked lists consume less additional memory

Linked lists allow efficient insertion and deletion of elements at any position in the list

Linked lists have a fixed size

Array representation is always more efficient

Each node can have any number of children

Each node has exactly two children

Each node has at most one child

Each node has at least three children

Before the left subtree

After the left subtree

Before the right subtree

After the right subtree