94. OCR A Level (H046-H446) SLR14 – 1.4 Data structures part 3 –

What operation is used to add an item to a stack?

• Enqueue

• Pop

• Push

• Dequeue

Answer explanation

To add an item to a stack, the operation used is 'Push'.

What should you check before adding an item to a data structure?

• The size of the item

• If it is full

• If it is empty

• The type of the item

Answer explanation

Before adding an item to a data structure, you should check if it is full to ensure there is space available for the new item.

Which data structure concept allows dynamic size adjustment?

• Stack pointer

• Procedural programming

• Object orientated approach

• Static array

Answer explanation

The object orientated approach allows dynamic size adjustment through features like inheritance and polymorphism.

What operation is used to add an item to a queue?

• Dequeue

• Pop

• Push

• Enqueue

Answer explanation

To add an item to a queue, the operation used is Enqueue. This operation inserts an element at the end of the queue.

What operation is used to remove an item from a stack?

• Push

• Dequeue

• Pop

• Enqueue

Answer explanation

To remove an item from a stack, the operation used is 'Pop'. Pop removes the top item from the stack.

What operation is used to remove an item from a queue?

• Dequeue

• Enqueue

• Pop

• Push

Answer explanation

Dequeue operation is used to remove an item from a queue, making it the correct choice among the options provided.

Before removing an item from a data structure, what should you check?

• If it is empty

• If it is full

• The type of the data structure

• The size of the data structure

Answer explanation

Before removing an item from a data structure, you should check if it is empty to avoid errors or accessing non-existent elements.

Which approach allows a stack to grow and shrink dynamically?

• Using an array

• Using a static data structure

• Object orientated approach

• Procedural programming

Answer explanation

The object-oriented approach allows a stack to grow and shrink dynamically by using dynamic memory allocation and pointers, unlike static data structures or arrays.

What is the recommended way to learn about data structures and algorithms?

• Memorizing code patterns

• Only reading textbooks

• Only watching videos

• General understanding and practical experience

Answer explanation

The recommended way to learn about data structures and algorithms is through general understanding and practical experience, rather than just memorizing code patterns, reading textbooks, or watching videos.

What is the first step in removing an item from a stack?

• Report an error

• Copy the item out of the stack

• Check if the stack is empty

• Decrement the pointer

Answer explanation

The first step in removing an item from a stack is to check if the stack is empty, as you cannot remove an item from an empty stack.