153. OCR A Level (H046-H446) SLR25 – 2.3 Representing, adding &

What data structures were primarily discussed in the video?

• Hash Tables and Sets

• Arrays and Linked Lists

• Stacks and Queues

• Trees and Graphs

Answer explanation

The video primarily discussed Stacks and Queues as the main data structures.

What is the nature of a stack's structure?

• Random Access

• Last In First Out (LIFO)

• First Come First Served

• First In First Out (FIFO)

Answer explanation

The nature of a stack's structure is Last In First Out (LIFO), meaning the last element added to the stack is the first one to be removed.

What operation checks for a full stack before adding an item?

• Queue Underflow

• Stack Overflow

• Stack Underflow

• Queue Overflow

Answer explanation

The correct operation that checks for a full stack before adding an item is Stack Overflow. This ensures that the stack does not exceed its capacity.

Which pointer always points to the node at the top of the stack?

• Tail Pointer

• Back Pointer

• Front Pointer

• Stack Pointer

Answer explanation

The Stack Pointer always points to the node at the top of the stack, making it the correct choice in this scenario.

What is a queue's nature of structure?

• Last In First Out (LIFO)

• Random Access

• First In Last Out (FILO)

• First In First Out (FIFO)

Answer explanation

A queue's nature of structure is First In First Out (FIFO), meaning that the first element added to the queue will be the first one to be removed.

What special type of queue allows elements to jump the queue?

• Circular Queue

• Priority Queue

• Static Queue

• Dynamic Queue

Answer explanation

Priority Queue allows elements to jump the queue based on their priority level, making it the special type of queue that enables this feature.

What is attempted when adding an item to a full queue called?

• Stack Underflow

• Queue Underflow

• Stack Overflow

• Queue Overflow

Answer explanation

Adding an item to a full queue is called Queue Overflow, not Stack Overflow or any other option. In a queue, overflow occurs when trying to insert an element into a full queue.

Which of the following is NOT a way stacks can be implemented?

• Using a priority queue

• Using a linked list

• Using object-oriented techniques

• Using an array

Answer explanation

Using a priority queue is NOT a way stacks can be implemented because stacks follow the Last In First Out (LIFO) principle, while priority queues follow a different order based on priority levels.

What does the OCR clarification document state students should have experience with?

• Using both data structures and understanding their differences and similarities

• Only using arrays for data manipulation

• Implementing data structures in a low-level programming language

• Focusing solely on theoretical aspects without practical implementation

Answer explanation

The OCR clarification document states that students should have experience with using both data structures and understanding their differences and similarities.

What is the result of attempting to pop an item off an empty stack?

• Queue Overflow

• Stack Overflow

• Stack Underflow

• Queue Underflow

Answer explanation

Popping an item off an empty stack results in Stack Underflow, indicating that the stack is empty and no items can be removed.