Advanced level 2025 Holy Infant High School mock Computer science 1
Advanced level 2025 Holy Infant High School mock Computer science 1
What is the equivalent in hexadecimal
representation of the decimal number 973?
A. 4BC.
B. 3DC.
C. 4CB.
D. 3CD.
2. The equivalence of the Boolean expression:
𝑧 = 𝑥(𝑥̅ + ̅𝑦) is
A. 𝑧 = 𝑥(𝑥𝑦)
B. 𝑧 = 𝑥̅𝑦
C. 𝑧 = 𝑥𝑦̅
3. The circuit used to memorize one bit of data is
known as a/an
A. Register
B. Encoder
C. Cell
D. Flip-Flop
4. Which of the following sorting algorithms
repeatedly compares adjacent elements and
swaps them if they are in the wrong order?
A. Quick sort
B. Merge sort
C. Bubble sort
D. Selection sort
5. Recursive algorithms use a
A. Divide-and-conquer approach
B. Modular approach
C. Structural approach
D. Hierarchical approach.
6. The time complexity for the following c
function assuming that n>0:
int func(int n)
{
if (n == 1)
return 1;
else
return n + func(n-1);
}
A. O(n)
B. O(log n)
C. O(n2)
D. O(n!)
7. A type of memory that requires continuous
refreshing to retain data:
A. SRAM
B. DRAM
C. ROM
D. Flash memory
8. In terms of minimizing the average waiting
time of a given set of processes, the optimal
scheduling algorithm is:
A. First Come First Served
B. Shortest Job First
C. Round Robin
D. Priority Job First
9. A time sharing system implies
A. More than one processor in the system
B. More than one program in memory
C. More than one memory in the system
D. More than one operating system in the
