CAIE 9701 PAPER 3 2024 COMPLETE QUESTIONS AND
ANSWERS WITH VERIFIED SOLUTION
1. What is the primary advantage of using a graph to represent a
network of connections?
A. It provides efficient searching and sorting of data.
B. It allows for easy representation of relationships between entities,
such as in social networks or web page links.
C. It guarantees the shortest path between any two nodes.
D. It can store a large amount of data efficiently in memory.
Answer: B) It allows for easy representation of relationships between
entities, such as in social networks or web page links.
Rationale: Graphs are ideal for representing complex relationships
between entities, such as social networks (people and their connections)
or web page links.
2. Which of the following is the best description of an API (Application
Programming Interface)?
A. It provides a user interface for interacting with software
applications.
B. It defines the methods and tools for building software applications.
C. It is a specific type of database used to store user data.
D. It refers to the data format for storing information in a database.
Answer: B) It defines the methods and tools for building software
applications.
Rationale: An API defines the set of methods and tools that allow
different software components to communicate and interact with each
other.
3. Which of the following is a correct characteristic of a directed graph?
A. It has no cycles.
,B. Each edge has a direction associated with it.
C. It is always connected.
D. It has no edges.
Answer: B) Each edge has a direction associated with it.
Rationale: In a directed graph (digraph), each edge has a direction,
which indicates a one-way relationship between nodes.
4. Which of the following is the primary purpose of an algorithm?
A. To solve problems
B. To write a computer program
C. To design a user interface
D. To debug errors in code
Answer: A) To solve problems
Rationale: An algorithm is a step-by-step procedure for solving a
problem or accomplishing a task. It is not just about writing programs
or designing UIs.
5. Which of the following is an example of a primary key in a database?
A. A column that can have duplicate values
B. A column that uniquely identifies each row in a table
C. A column that stores timestamps
D. A column that stores addresses
Answer: B) A column that uniquely identifies each row in a table
Rationale: A primary key is a column or a set of columns in a database
table that uniquely identifies each row.
6. What is the main advantage of a hash table over an array?
A. Faster access time
B. Better memory utilization
C. More efficient sorting algorithms
D. No need for data indexing
, Answer: A) Faster access time
Rationale: A hash table provides constant-time O(1) access to elements
on average, whereas an array requires O(n) for searching in the worst
case.
7. Which of the following is true about a binary search algorithm?
A. It can be used on any unsorted data.
B. It requires a sorted data structure.
C. It has a time complexity of O(n).
D. It is more efficient than linear search for unsorted data.
Answer: B) It requires a sorted data structure.
Rationale: Binary search works by dividing the data in half, so it
requires the data to be sorted in order to function correctly.
8. Which of the following best describes a "Deadlock" in the context of
operating systems?
A. A state where processes are running faster than expected.
B. A state where multiple processes are waiting for each other to
release resources, causing none of them to proceed.
C. A state where processes are executing without the need for
synchronization.
D. A state where a process is terminated by the operating system.
Answer: B) A state where multiple processes are waiting for each other
to release resources, causing none of them to proceed.
Rationale: A deadlock occurs when processes are in a cyclic
dependency, each waiting for a resource held by another, preventing
any of them from proceeding.
9. What is the time complexity of accessing an element in a hash table,
on average?
A. O(1)
ANSWERS WITH VERIFIED SOLUTION
1. What is the primary advantage of using a graph to represent a
network of connections?
A. It provides efficient searching and sorting of data.
B. It allows for easy representation of relationships between entities,
such as in social networks or web page links.
C. It guarantees the shortest path between any two nodes.
D. It can store a large amount of data efficiently in memory.
Answer: B) It allows for easy representation of relationships between
entities, such as in social networks or web page links.
Rationale: Graphs are ideal for representing complex relationships
between entities, such as social networks (people and their connections)
or web page links.
2. Which of the following is the best description of an API (Application
Programming Interface)?
A. It provides a user interface for interacting with software
applications.
B. It defines the methods and tools for building software applications.
C. It is a specific type of database used to store user data.
D. It refers to the data format for storing information in a database.
Answer: B) It defines the methods and tools for building software
applications.
Rationale: An API defines the set of methods and tools that allow
different software components to communicate and interact with each
other.
3. Which of the following is a correct characteristic of a directed graph?
A. It has no cycles.
,B. Each edge has a direction associated with it.
C. It is always connected.
D. It has no edges.
Answer: B) Each edge has a direction associated with it.
Rationale: In a directed graph (digraph), each edge has a direction,
which indicates a one-way relationship between nodes.
4. Which of the following is the primary purpose of an algorithm?
A. To solve problems
B. To write a computer program
C. To design a user interface
D. To debug errors in code
Answer: A) To solve problems
Rationale: An algorithm is a step-by-step procedure for solving a
problem or accomplishing a task. It is not just about writing programs
or designing UIs.
5. Which of the following is an example of a primary key in a database?
A. A column that can have duplicate values
B. A column that uniquely identifies each row in a table
C. A column that stores timestamps
D. A column that stores addresses
Answer: B) A column that uniquely identifies each row in a table
Rationale: A primary key is a column or a set of columns in a database
table that uniquely identifies each row.
6. What is the main advantage of a hash table over an array?
A. Faster access time
B. Better memory utilization
C. More efficient sorting algorithms
D. No need for data indexing
, Answer: A) Faster access time
Rationale: A hash table provides constant-time O(1) access to elements
on average, whereas an array requires O(n) for searching in the worst
case.
7. Which of the following is true about a binary search algorithm?
A. It can be used on any unsorted data.
B. It requires a sorted data structure.
C. It has a time complexity of O(n).
D. It is more efficient than linear search for unsorted data.
Answer: B) It requires a sorted data structure.
Rationale: Binary search works by dividing the data in half, so it
requires the data to be sorted in order to function correctly.
8. Which of the following best describes a "Deadlock" in the context of
operating systems?
A. A state where processes are running faster than expected.
B. A state where multiple processes are waiting for each other to
release resources, causing none of them to proceed.
C. A state where processes are executing without the need for
synchronization.
D. A state where a process is terminated by the operating system.
Answer: B) A state where multiple processes are waiting for each other
to release resources, causing none of them to proceed.
Rationale: A deadlock occurs when processes are in a cyclic
dependency, each waiting for a resource held by another, preventing
any of them from proceeding.
9. What is the time complexity of accessing an element in a hash table,
on average?
A. O(1)
