Understanding Stacks and Queues

What is the primary characteristic of a stack data structure?

• First In First Out

• Last In First Out

• Circular Access

• Random Access

Which operation is used to add an item to the top of a stack?

• Enqueue

• Dequeue

• Pop

• Push

What is a stack overflow?

• Reversing a stack

• Removing an item from an empty stack

• Accessing an item in a stack

• Adding an item to a full stack

In a queue, where are new items added?

• In the middle

• At a random position

• At the back

• At the front

What is a queue underflow?

• Adding an item to a full queue

• Removing an item from an empty queue

• Accessing an item in a queue

• Reversing a queue

What is a priority queue?

• A queue where items are processed based on priority

• A queue where items are processed randomly

• A queue where items are processed in reverse order

• A queue where items are processed based on size

Which data structure is known as First In First Out?

• Stack

• Queue

• Tree

• Graph

What is the main difference between a stack and a queue?

• Stacks are LIFO, queues are FIFO

• Stacks are FIFO, queues are LIFO

• Stacks and queues are both FIFO

• Stacks and queues are both LIFO

Which implementation technique can be used for both stacks and queues?

• Hash Table

• Binary Tree

• Graph

• Linked List

What resource is recommended for further learning about data structures and algorithms?

• Essential Algorithms for A Level Computer Science

• Introduction to Machine Learning

• Advanced Database Systems

• Network Security Essentials