Cambridge International A Level · Computer Science (9618)

Data Types and Structures: Practice Questions

5 multiple-choice questions marked as you go, and 5 written questions with worked solutions. All on Data Types and Structures.

10 questions24 marksFree, no account

Question 1

1 mark

In the context of 1D arrays, which term refers to the index value of the very first element in the array?

Question 2

1 mark

Which statement best describes an Abstract Data Type (ADT)?

Question 3

1 mark

A linked list is implemented using a 1D array of records, where each record contains a Data field and a NextPointer. If FreePointer points to the first available node in the list of empty nodes, which sequence of pseudocode steps is required to correctly remove the first node from the Free List to prepare it for new data storage?

Question 4

1 mark

In the context of Data Types and Structures, what term is used to describe an individual data item within a record structure, such as ISBN or Price in a book database?

Question 5

1 mark

A circular queue is implemented in Data Types and Structures using a 1D array of size 10 (with indices 1 to 10). Currently, FrontPointer = 8 and RearPointer = 10. If one more item is added to the queue and then two items are subsequently removed, what will be the new values for FrontPointer and RearPointer? (Assume FrontPointer points to the first item and RearPointer points to the last item added).

Question 6

2 marks

Explain why a record structure is more appropriate than a 1D array for storing a student's name, date of birth, and enrollment status.

Write your answer out first, then check it against the worked solution.

Question 7

3 marks

In the context of hashing algorithms for file access, define the term collision and identify one method used to resolve it.

Write your answer out first, then check it against the worked solution.

Question 8

5 marks

When implementing a Queue as a static 1D array of size \( n \), explain why a circular queue implementation is more efficient than a linear implementation that shifts elements forward after every dequeue operation.

Write your answer out first, then check it against the worked solution.

Question 9

4 marks

Abstract Data Types (ADTs) allow programmers to manage data based on behavior rather than implementation.
a) Define a Stack and describe how the Stack Pointer changes during PUSH and POP operations.
b) Explain why a Linked List is considered a dynamic data structure compared to a standard 1D array.
c) Identify one specific scenario where a Queue would be more appropriate than a Stack.

Write your answer out first, then check it against the worked solution.

Question 10

5 marks

A 2D array named SubjectMarks is used to store the results of 30 students in 5 different subjects. The rows represent students (1 to 30) and the columns represent subjects (1 to 5).

a) Explain the difference between the lower bound and the upper bound of an array dimension.

b) Write a pseudocode algorithm that calculates the average mark for Student 15 across all 5 subjects and outputs the result.

c) The school wants to store the name of each student alongside their marks. Justify why a 2D array is not suitable for this purpose and identify a more appropriate data structure that combines different data types.

Write your answer out first, then check it against the worked solution.

* The content provided by thinka is generated by AI and may not always be accurate or up-to-date. Please use it as a supplementary resource and verify with official materials.

You've seen the model answer. Now get yours marked.

This page can show you how a good answer looks. It cannot tell you what your answer was missing. thinka marks your written work against the real mark scheme in about 15 seconds.

Get My Answers Marked Back to the notes

Want more questions like these? Get a fresh set on this topic, marked as you go.