SUMMATIVE EVALUATION NO.

02 of 03 2024/2025 Date: 2024

Student’s Name: Duration: 2H

Subject: COMPUTER SCIENCE Student’s Number :

Class: LSS A Number Sat :

COMPETENCE TO BE ATTAINED
….................................................................................................................................................
.....................................................................................................................................................
...............................................................................................................................................
APPRECIATION OF COMPETENCE (KINDLY TICK)
NOT ATTAINED STILL TO BE ATTAINED ATTAINED

EVALUATION MARK
Section A: ….............. Section C: …......... Total Marks: ……………
Section B: ….............. Section D: …........

PARENT’S OR GUARDIANT’S VISA

Name and surname:
………………………………………………………………………….....................................
......
Date: ….................................................... Tel: …................................................................

Parent’s remarks
…………………………………………………………………………………………………
………………………………………………………………………………………………….
....................

Parent’s Signature: …............................................................................................................

Section A: Multiple Choice Questions (MCQs)
Instructions:
- Answer all questions.
- Each question carries one mark.
- Choose the correct option from the given choices.

1. Which of the following is NOT a 4. Which sorting algorithm divides the array
characteristic of an algorithm? into two halves repeatedly?
a) Input a) Bubble Sort
b) Ambiguity b) Selection Sort
c) Finiteness c) Merge Sort
d) Output d) Insertion Sort

2. What is the time complexity of linear

search in the worst case?
5. What is the output of the following
a) O(1) pseudocode?
b) O(n) x=5
c) O(log n) y = 10
d) O(n^2) if x > y:
print("x is greater")
3. In which data structure is a stack else:
implemented?
print("y is greater")
a) Array
a) x is greater
b) Linked List
b) y is greater
c) Both a and b
c) Error
d) Queue
d) None
6. Which of the following is a recursive b) O(n)
algorithm?
c) O(log n)
a) Linear Search
d) O(n^2)
b) Binary Search
c) Bubble Sort
11. Which data structure allows dynamic
d) Selection Sort memory allocation?
a) Array
7. What is the purpose of a flowchart? b) Linked List
a) To design algorithms visually c) Stack
b) To debug programs d) Queue
c) To test software
d) To write code 12. What is the maximum number of
children a node can have in a binary tree?
a) 1
8. Which algorithm has the highest
efficiency for large datasets? b) 2
a) Bubble Sort c) 3
b) Quick Sort d) 4
c) Insertion Sort
d) Selection Sort 13. Which data structure is used to
implement a priority queue?
a) Stack
9. Which data structure follows the Last-In-
First-Out (LIFO) principle? b) Heap
a) Queue c) Queue
b) Stack d) Linked List
c) Array
d) Linked List 14. What is the difference between a stack
and a queue?
a) Size
10. What is the time complexity of inserting
an element at the beginning of a linked list? b) Order of insertion and deletion
a) O(1) c) Memory allocation
 d) None 19. What is the function of an operating
system?
a) Manage hardware resources
15. What is the advantage of using a doubly
linked list over a singly linked list? b) Provide user interface
a) Faster traversal in both directions c) Both a and b
b) Less memory usage d) None
c) Simpler implementation
d) None 20. Which scheduling algorithm prioritizes
shorter jobs?
a) First-Come-First-Served (FCFS)
16. Which part of the CPU performs
arithmetic operations? b) Shortest Job Next (SJN)
a) Control Unit c) Round Robin
b) Arithmetic Logic Unit (ALU) d) Priority Scheduling
c) Memory Unit
d) Cache 21. What is the purpose of virtual memory?
a) Increase storage capacity
17. What is the purpose of the control unit in b) Improve performance by using disk
a CPU? space as RAM
a) Perform calculations c) Reduce power consumption
b) Manage input/output operations d) None
c) Interpret and execute instructions
d) Store data 22. Which interrupt is caused by hardware
failure?
a) Software Interrupt
18. Which memory type is volatile?
b) Hardware Interrupt
a) RAM
c) System Call
b) ROM
d) Trap
c) Hard Disk
d) SSD
23. What is the role of the file system in an
operating system?
 a) Manage files and directories d) 1100
b) Control device drivers
c) Handle interrupts 29. What is the 2's complement of the binary
number 1011?
d) None
a) 0101
b) 0100
25. Which of the following is a real-time
operating system? c) 0110
a) Windows d) 0111
b) Linux
c) VxWorks 30. Convert the hexadecimal number A5 to
decimal.
d) macOS
a) 165
b) 155
26. What is the purpose of a deadlock in an
operating system? c) 145
a) Optimize resource usage d) 135
b) Prevent resource starvation
c) Ensure mutual exclusion 31. Simplify the Boolean expression: A +
AB.
d) Avoid resource contention
a) A
27. Convert the decimal number 15 to
binary. b) B
a) 1111 c) AB
b) 1101 d) A + B
c) 1011
d) 1001 32. What is the truth table for the AND gate?
a)
28. What is the 1's complement of the binary | A | B | Output |
number 1011?
|---|---|--------|
a) 0100
|0|0|0 |
b) 0101
|0|1|0 |
c) 1010
 |1|0|0 | b) AB + AC
|1|1|1 | c) A + B + C
d) ABC
b)
| A | B | Output | 35. What is the result of converting the octal
number 12 to decimal?
|---|---|--------|
a) 8
|0|0|0 |
b) 10
|0|1|1 |
c) 12
|1|0|1 |
d) 14
|1|1|1 |

36. Which of the following is a universal

c)
gate?
| A | B | Output |
a) AND
|---|---|--------|
b) OR
|0|0|1 |
c) NOT
|0|1|1 |
d) NAND
|1|0|1 |
37. Which type of memory is volatile?
|1|1|0 | A. ROM
B. RAM
C. EEPROM
33. Which logic gate corresponds to the D. Flash Memory
Boolean expression A · B? 38. What is the purpose of a cache
memory in a computer system?
a) AND A. To increase the speed of data access
b) OR B. To store data permanently
C. To manage I/O operations
c) NOT D. To provide additional storage
d) XOR 39. Which of the following is a type of
operating system?

34. Simplify the Boolean expression: (A + A. Real-time OS

B)(A + C). B. Batch OS
a) A + BC C. Time-sharing OS
 D. All of the above A. 10
B. 11
40. What is the decimal equivalent of C. 12
the binary number 1011?
D. 13

ANSWER GRID
1 6 11 16
2 7 12 17
3 8 13 18
4 9 14 19
5 10 15 20
21 22 23 24
25 26 27 28
29 30 31 32
33 34 35 36
37 38 39 40

SECTION B: ANSWER THREE QUESTIONS

Question 1: Algorithms (20 Marks)

a) Define an algorithm and explain its characteristics. (5 Marks)
b) Write an algorithm to find the factorial of a number using recursion. (5 Marks)
c) Describe the differences between a stack and a queue. (4 Marks)
d) Discuss the advantages and disadvantages of using arrays versus linked lists. (3 Marks)
e) Explain how a binary search tree works and provide an example. (3 Marks)

Question 2: Computer Architecture (20 Marks)

a) Explain the architecture of a typical CPU and its components. (5 Marks)
b) Differentiate between cache memory and main memory. (5 Marks)
c) Describe the process of instruction execution in a CPU. (5 Marks)
d) Discuss the role of interrupts in computer systems. (5 Marks)

Question 3: Number Systems and Complements (20 Marks)

b) Find the 1's and 2's complements of the binary number 11010. (2 Marks)
b) Using an 32-bits 2’s complement notation, perform the following computations:
c) - 35 + (- 11) and 19 – (- 4) (4 marks)

d) Add (93)16 and (DE)16 (2 marks)

e) -25 – (- 38) (2 marks)

f) Simplify the Boolean expression and draw its truth table: (A + B)(A' + C)(B + C). (5 Marks)
g) Design a circuit using logic gates to implement the Boolean expression: A'B'C + AB'C'. (3
Marks)
d) Explain De Morgan's laws and their application in simplifying Boolean expressions. (2 Marks)

Question 4: Operating Systems (20 Marks)

. (i) (a) What is an operating system? (2 marks)
(b) why is process management necessary in modern operating systems (4marks)
(ii) The processes p1 to p4 have burst times as shown in the table below
Process ID Burst
(PID) time (in ms)
P1 10
P2 6
P3 7
P4 15
Draw Gantt charts to show how the four processes obtain and use the processor from start to
termination following Round Robin and Shortest Remaining Time Next scheduling algorithms.
The time slice is 5ms. (assume the processes are in the same order in the ready queue)
(4 marks)
Calculate the average turnaround time (Att) for each of the algorithms (2 marks)
Which of the algorithms would be preferable to implement for these processes? (2 marks)
 R1 P1 P2 R+

P3 R2 P4 R3 P5

P6 R4 R5

R6 P7

(iii) The following is a resource allocation graph for resources R1-R6 and the processes P1 –P7,
From this graph, is there a possibility of deadlock? If yes give the deadlock cycle (3 marks)
If R+ were an instance of R3 is the possibility of deadlock completely eliminated? Explain! (3
marks)