1a.
What is the difference between a variable and a constant in programming?
[1 mark]
1b.
Write a Boolean expression to check if a variable x is greater than or equal to 10 and less than
or equal to 20.
[2 marks]
1c.
You are asked to write a function sumEvenNumbers in a procedural programming style. The
function takes an array of integers and returns the sum of all even numbers in the array.
Describe the steps needed to implement this function. Explain why using local variables in the
function is good practice.
[3 marks]
2a.
What is the purpose of a hash table in programming?
[1 mark]
2b.
Describe the difference between a linear queue and a circular queue.
[2 marks]
2c.
You are tasked with implementing a binary search tree (BST). Describe the basic properties of a
binary tree and explain how the structure of a binary search tree ensures ef cient searching.
[3 marks]
3a.
What is the main advantage of using Breadth-First Search (BFS) over Depth-First Search (DFS)
in graph traversal?
[1 mark]
fi
,3b.
Explain the difference between pre-order, in-order, and post-order tree traversal algorithms, and
provide an example use case for each.
[2 marks]
3c.
Consider the following list of numbers: [5, 3, 8, 4, 2, 7, 6, 1]. Trace the steps of the Bubble Sort
algorithm as it sorts the list, and analyse its time complexity.
[3 marks]
4a.
What is procedural abstraction and how does it differ from functional abstraction in terms of
computation?
[1 mark]
4b.
Explain the concept of data abstraction and provide an example of how it can be used to hide the
details of data representation.
[2 marks]
4c.
Given the following pseudo-code algorithm:
1. Start
2. Set x = 5
3. If x > 3 Then
4. Set y = x * 2
5. Else
6. Set y = x + 2
7. End If
8. Print y
9. End
Hand-trace the algorithm for x = 5, and explain how the values of x and y are determined.
[3 marks]
4d.
, Describe Dijkstra's shortest path algorithm, explaining the steps involved and its typical
applications.
[4 marks]
4e.
Explain the Halting problem and its signi cance in the theory of computation. Why is it considered
unsolvable?
[5 marks]
5a.
What is the difference between rational and irrational numbers, and provide an example of each?
[1 mark]
5b.
Convert the decimal number 45 to binary and hexadecimal.
[2 marks]
5c.
Explain the concept of two’s complement representation in signed binary numbers. How is it used
to represent negative numbers?
[3 marks]
5d.
Describe how bitmapped graphics are represented in a computer system. What factors affect the
storage requirements of an image?
[4 marks]
5e.
Compare the vector graphics approach with the bitmapped graphics approach. Discuss the
advantages and disadvantages of each.
[5 marks]
6a.
De ne the term hardware.
[1 mark]
fi
fi
What is the difference between a variable and a constant in programming?
[1 mark]
1b.
Write a Boolean expression to check if a variable x is greater than or equal to 10 and less than
or equal to 20.
[2 marks]
1c.
You are asked to write a function sumEvenNumbers in a procedural programming style. The
function takes an array of integers and returns the sum of all even numbers in the array.
Describe the steps needed to implement this function. Explain why using local variables in the
function is good practice.
[3 marks]
2a.
What is the purpose of a hash table in programming?
[1 mark]
2b.
Describe the difference between a linear queue and a circular queue.
[2 marks]
2c.
You are tasked with implementing a binary search tree (BST). Describe the basic properties of a
binary tree and explain how the structure of a binary search tree ensures ef cient searching.
[3 marks]
3a.
What is the main advantage of using Breadth-First Search (BFS) over Depth-First Search (DFS)
in graph traversal?
[1 mark]
fi
,3b.
Explain the difference between pre-order, in-order, and post-order tree traversal algorithms, and
provide an example use case for each.
[2 marks]
3c.
Consider the following list of numbers: [5, 3, 8, 4, 2, 7, 6, 1]. Trace the steps of the Bubble Sort
algorithm as it sorts the list, and analyse its time complexity.
[3 marks]
4a.
What is procedural abstraction and how does it differ from functional abstraction in terms of
computation?
[1 mark]
4b.
Explain the concept of data abstraction and provide an example of how it can be used to hide the
details of data representation.
[2 marks]
4c.
Given the following pseudo-code algorithm:
1. Start
2. Set x = 5
3. If x > 3 Then
4. Set y = x * 2
5. Else
6. Set y = x + 2
7. End If
8. Print y
9. End
Hand-trace the algorithm for x = 5, and explain how the values of x and y are determined.
[3 marks]
4d.
, Describe Dijkstra's shortest path algorithm, explaining the steps involved and its typical
applications.
[4 marks]
4e.
Explain the Halting problem and its signi cance in the theory of computation. Why is it considered
unsolvable?
[5 marks]
5a.
What is the difference between rational and irrational numbers, and provide an example of each?
[1 mark]
5b.
Convert the decimal number 45 to binary and hexadecimal.
[2 marks]
5c.
Explain the concept of two’s complement representation in signed binary numbers. How is it used
to represent negative numbers?
[3 marks]
5d.
Describe how bitmapped graphics are represented in a computer system. What factors affect the
storage requirements of an image?
[4 marks]
5e.
Compare the vector graphics approach with the bitmapped graphics approach. Discuss the
advantages and disadvantages of each.
[5 marks]
6a.
De ne the term hardware.
[1 mark]
fi
fi
