Stack and Queue

Multiple Choice

Which operation removes the top element from a stack?

• push

• pop

• peek

• insert

Multiple Choice

Which of the following operations does NOT remove an element from the stack?

• push()

• pop()

• peek()

• isEmpty()

Array Stack Visualization

You can open this webpage in a new tab.

Copy link

Open in new tab

Linked List Stack Visualization

You can open this webpage in a new tab.

Copy link

Open in new tab

Open Ended

Explain how the Last-In-First-Out (LIFO) principle is demonstrated in the stack visualisation example.

Multiple Choice

Consider the following operation performed on a stack of size 5.

Push(1);

Pop();

Push(2);

Push(3);

Pop();

Push(4);

Pop();

Pop();

Push(5);

• 4

• 3

• 2

• 1

Multiple Select

Select all the functions from the Python stack implementation that check the status of the stack rather than modify it.

• is_empty()

• push(item)

• pop()

• peek()

Multiple Choice

Which of the following is NOT a typical application of stacks?

• Browser history

• Interrupt handling

• Recursion

• Sorting a list

Fill in the Blanks

Stacks are commonly used for features like

in software applications.

Open Ended

Describe the sequence of stack contents after the following operations: push(2), push(3), push(4), pop(), push(5), pop().

Multiple Choice

Which principle does a queue data structure follow?

• FIFO (First In First Out)

• LIFO (Last In First Out)

• Random Access

• Priority Based

Open Ended

Explain how the enqueue and dequeue operations work in a queue, using the diagrams provided.

Home

Open in new tab

Copy link

Multiple Choice

Which of the following functions in the given Python code checks if the queue is empty?

• enqueue

• dequeue

• is_empty

• queue_str

Multiple Choice

In a Queue, what operation is performed to add a new element?

• Enqueue

• Dequeue

• Push

• Pop

Multiple Choice

Identify two real-world scenarios where queues are used, as mentioned in the slide.

• Printer queues and keyboard queue

• Stack memory and recursion

• Sorting algorithms and searching

• File systems and databases

Multiple Choice

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

• Enqueue

• Dequeue

• Peek

• Pop

Multiple Choice

What is the index of the first element in a list/array?

• 1

• -1

• 2

• 0

Fill in the Blanks

A stack is a

type of list, while a queue is a FIFO type of list.

Multiple Choice

Which of the following statements is true about arrays and stacks/queues?

• Arrays are dynamic data structures and can change size.

• Stacks and queues are static data structures and cannot change size.

• Arrays are static data structures and cannot change size, while stacks and queues are dynamic data structures and can change size.

• Stacks and queues cannot be implemented using arrays.

Multiple Select

Which of the following are common applications of queues?

• Function calls in compilers

• Interrupt handling in real-time systems

• Simulating recursion in programs

• Serving requests of a shared resource like a printer

Open Ended

How would you describe the process of adding and removing elements in a stack, and how does this relate to the concept of 'top' in the stack data structure?

Multiple Choice

In a stack, if a user tries to remove an element from empty stack it is called _________

• Underflow

• Empty collection

• Overflow

• Garbage Collection

Multiple Choice

What is the main difference between the LIFO and FIFO principles when working with stacks and queues?

• LIFO removes the oldest element first, FIFO removes the newest element first

• LIFO removes the newest element first, FIFO removes the oldest element first

• LIFO and FIFO both remove elements randomly

• LIFO and FIFO are only used in sorting algorithms

Open Ended

Why is understanding the principles of stacks and queues important in computer science and programming?