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

What is a linked list?

• A type of function

• A data structure

• A type of algorithm

• A programming language

Answer explanation

A linked list is a data structure that consists of a sequence of elements where each element points to the next one, forming a chain-like structure.

What can be built upon a linked list?

• Stacks, cues, graphs, and trees

• Only stacks

• Only arrays

• Only graphs

Answer explanation

A linked list can be used to build stacks, queues, graphs, and trees, making it a versatile data structure for various applications.

What does each node in a linked list contain?

• Only data

• Data and multiple pointers to other nodes

• Data and a pointer to the next node

• Only a pointer to the next node

Answer explanation

Each node in a linked list contains data and a pointer to the next node, allowing traversal through the list by following these pointers.

What is a doubly linked list?

• A list with nodes pointing to the previous and next items

• A list with nodes that have no pointers

• A list with nodes pointing only forward

• A list where each node points to two random nodes

Answer explanation

A doubly linked list is a list with nodes pointing to the previous and next items, allowing for traversal in both directions.

How can a circular linked list be created?

• By linking all nodes to a central node

• By removing all pointers

• By making the last node point to the first node

• By storing all nodes at the same memory address

Answer explanation

A circular linked list can be created by making the last node point to the first node, creating a loop structure.

What is the benefit of using object-oriented techniques with linked lists?

• Nodes must be stored contiguously

• Any available memory address can be used to store data

• It reduces the memory footprint at compile time

• It eliminates the need for pointers

Answer explanation

Using object-oriented techniques with linked lists allows any available memory address to be used to store data, providing flexibility and efficient memory management.

What type of data structure is a linked list considered when it can change dynamically at runtime?

• Immutable

• Dynamic

• Fixed

• Static

Answer explanation

A linked list is considered dynamic when it can change dynamically at runtime, making the correct choice 'Dynamic'.

Which of the following is NOT a typical application of linked lists?

• Managing processor tasks in operating systems

• Storing tracks in a music playlist

• Performing complex mathematical calculations

• Navigating through a list of visited web pages

Answer explanation

Performing complex mathematical calculations is NOT a typical application of linked lists as they are more commonly used for managing tasks, storing data, and navigating through lists.

How can linked lists be used in hash tables?

• As an overflow for collision resolution

• For sorting the keys

• To reduce the size of the table

• To encrypt data

Answer explanation

Linked lists can be used in hash tables as an overflow for collision resolution, allowing multiple values to be stored at the same index in the table.

What operations can be performed on a linked list?

• Only deleting nodes

• Encrypt and decrypt data

• Add a node, delete a node, move to the next and previous node

• Only adding nodes

Answer explanation

The correct operations that can be performed on a linked list are adding a node, deleting a node, and moving to the next and previous node.