92. OCR A Level (H446) SLR14 – 1.4 Data structures part 1 – Link

What is the first step in adding an item to a linked list?

• Insert the data into the new node

• Update the free pointer

• Check if the linked list is empty

• Check if there is free memory for a new node

Answer explanation

The first step in adding an item to a linked list is to check if there is free memory for a new node.

What should you do if the linked list data structure is full?

• Continue adding the item

• Stop and report an error

• Create a new linked list

• Delete an item to make space

Answer explanation

If the linked list data structure is full, the correct action is to stop and report an error, as there is no space to add more items.

How can a linked list be implemented?

• Using an array and procedural programming

• Using a stack

• Using a queue

• Using a graph

Answer explanation

A linked list can be implemented using an array and procedural programming, where each element points to the next element in the list.

What is the recommended way to learn about linked lists according to the exam board?

• Memorizing code patterns

• Watching videos only

• Understanding methods through practical experience

• Reading books only

Answer explanation

The recommended way to learn about linked lists according to the exam board is by understanding methods through practical experience, as it provides hands-on learning and a deeper understanding of the concepts.

Where should 'Cal' be added in a linked list stored in alphabetical order?

• At the beginning of the list

• After Craig

• Before Ben

• After Ben and before Craig

Answer explanation

'Cal' should be added after Ben and before Craig in a linked list stored in alphabetical order.

What is a special situation to check for when adding an item to a linked list?

• If the linked list is sorted

• If the linked list is empty

• If the linked list contains duplicate items

• If the linked list is circular

Answer explanation

When adding an item to a linked list, it is important to check if the linked list is empty to handle the insertion process correctly.

What approach eliminates the need for a second linked list to keep track of free storage locations?

• Array-based implementation

• Functional programming

• Object-oriented approach

• Procedural programming

Answer explanation

The object-oriented approach encapsulates data and methods within objects, eliminating the need for a separate linked list to manage free storage locations.

What should you do before attempting to remove an item from a linked list?

• Add a new item to the linked list

• Check if the linked list is empty

• Sort the linked list

• Duplicate the linked list

Answer explanation

Before attempting to remove an item from a linked list, you should check if the linked list is empty to avoid errors or unexpected behavior.

What happens to the contents of a node after it is 'deleted' from a linked list?

• It remains until overwritten

• It is overwritten immediately

• It is moved to another list

• It is permanently erased

Answer explanation

The contents of a node in a linked list remain until overwritten, they are not immediately erased or moved to another list.

What is the first step in traversing a linked list?

• Output the contents of the current node

• Check if the linked list is empty

• Compare each item with a value

• Move to the last node

Answer explanation

The first step in traversing a linked list is to check if the linked list is empty, ensuring there are nodes to traverse.