OCR A Level Computer Science Data Structures

What is an array in computer science?

• A collection of elements identified by index or key

• A protocol for data transmission

• A type of function in programming

• A data structure that allows elements to be accessed in a fixed sequential order

Which data structure uses LIFO (Last In, First Out) principle?

• Queue

• Stack

• Array

• Linked List

What is the time complexity of accessing an element in an array?

Which of the following is not a type of linked list?

• Single linked list

• Double linked list

• Circular linked list

• Infinite linked list

In a binary search tree (BST), the left child’s value is:

• Greater than the parent’s value

• Less than the parent’s value

• Equal to the parent’s value

• Not related to the parent’s value

Which data structure is primarily used for implementing undo functionality in text editors?

• Queue

• Stack

• Array

• Hash Table

What does FIFO stand for and which data structure is it associated with?

• First In, First Out; Stack

• First In, First Out; Queue

• First In, Last Out; Stack

• First In, Last Out; Queue

Which of the following is a disadvantage of using arrays?

• Fixed size

• Slow access time

• Difficult to program

• Non-linear data storage

In a hash table, what is a collision?

• A situation where a hash function does not have any more space to store values

• A situation where two keys hash to the same index

• A failure in the hash function algorithm

• A situation where the hash table reaches its load factor

What is the primary advantage of a linked list over a conventional array?

• Better memory utilization

• Faster access time

• Elements can be easily inserted or removed without reallocation

• Simpler implementation