Understanding Stacks, Queues, and Lists

What is the primary operation of a stack?

• The primary operation of a stack is 'push' and 'pop'.

• add and remove

• insert and delete

• enqueue and dequeue

How do you implement a queue using two stacks?

• Use two stacks: one for enqueueing and one for dequeueing. Transfer elements from the input stack to the output stack when needed.

• Implement a queue using an array without stacks.

• Use a single stack for both enqueueing and dequeueing.

• Use three stacks to manage the queue operations.

What is the time complexity of traversing a linked list?

• O(n^2)

• O(n)

• O(log n)

• O(1)

What distinguishes a circular queue from a regular queue?

• A circular queue allows the last position to connect back to the first position, optimizing space usage.

• A circular queue requires more memory than a regular queue.

• A circular queue processes elements in a last-in, first-out manner.

• A circular queue can only hold a fixed number of elements.

How do you insert a node in a doubly linked list?

• Add a new node without changing any pointers.

• Insert a new node by adjusting pointers of the new node and surrounding nodes.

• Insert a node only at the beginning of the list.

• Insert a node by deleting the last node in the list.

What is the last element removed from a stack called?

• base

• top

• middle

• bottom

Describe the enqueue operation in a queue.

• The enqueue operation checks if the queue is empty before adding an element.

• The enqueue operation adds an element to the back of the queue.

• The enqueue operation adds an element to the middle of the queue.

• The enqueue operation removes an element from the front of the queue.

What is the main advantage of a circular queue?

• Faster processing time for all operations.

• Fixed size that cannot be adjusted dynamically.

• Efficient space utilization by reusing empty slots.

• Simplified implementation compared to linear queues.

How do you delete a node from a singly linked list?

• Update the pointers to remove the target node from the list.

• Reverse the entire linked list.

• Remove the head node and shift the list.

• Add a new node to the end of the list.

What is the difference between a singly linked list and a doubly linked list?

• Singly linked lists can store more data than doubly linked lists.

• The main difference is that singly linked lists allow traversal in one direction, while doubly linked lists allow traversal in both directions.

• Traversal in singly linked lists is faster than in doubly linked lists.

• Doubly linked lists have a single pointer for each node, while singly linked lists have two.