Understanding ADTs: Queues, Stacks, Lists

Which of the following operations is not typically associated with a queue?

• Enqueue

• Dequeue

• Peek

• Pop

In a stack, which operation is used to add an element to the top of the stack?

• Push

• Pop

• Enqueue

• Dequeue

Which of the following is a common technique for traversing a list?

• Binary Search

• Depth-First Search

• Linear Search

• Quick Sort

What is a key characteristic of a circular queue?

• It has a fixed size and wraps around when it reaches the end.

• It allows unlimited elements.

• It only allows elements to be added at the end.

• It is always sorted.

Which of the following is an application of stacks?

• Managing printer tasks

• Undo functionality in text editors

• Scheduling processes in an operating system

• Routing packets in a network

What is the time complexity of accessing an element in a list by index?

In a stack, what is the result of performing a pop operation?

• The last element is removed and returned.

• The first element is removed and returned.

• The stack is cleared.

• A new element is added to the top.

Which of the following is true about a circular queue?

• It can only be implemented using arrays.

• It can be implemented using both arrays and linked lists.

• It does not require a front and rear pointer.

• It cannot be full.

What is the primary advantage of using a stack for function calls in programming?

• It allows for random access to function calls.

• It ensures that the most recent function call is completed before the previous one.

• It allows functions to be executed in parallel.

• It reduces memory usage.

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

• Push

• Pop

• Enqueue

• Dequeue