0% found this document useful (0 votes)
256 views3 pages

Computer Science 1 2025 Smuyfjlxrc

This document outlines the structure and instructions for a regional mock general certificate examination in Computer Science for candidates in Cameroon. It includes various questions covering topics such as CPU functions, memory management, database design, networking, and programming concepts. Candidates are instructed to answer six questions, with each question carrying a specific mark distribution.

Uploaded by

tawedivine2
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
256 views3 pages

Computer Science 1 2025 Smuyfjlxrc

This document outlines the structure and instructions for a regional mock general certificate examination in Computer Science for candidates in Cameroon. It includes various questions covering topics such as CPU functions, memory management, database design, networking, and programming concepts. Candidates are instructed to answer six questions, with each question carrying a specific mark distribution.

Uploaded by

tawedivine2
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

REPUBLIQUE DU CAMEROUN REPUBLIC OF CAMEROON

Paix – Travail - Patrie Peace – Work – Fatherland


********** **********
MINISTERE DES ENSEIGNEMENTS SECONDAIRES MINISTRY OF SECONDARY EDUCATION
********** **********
DELEGATION REGIONALE DE L’ADAMAOUA ADAMAWA REGIONAL DELEGATION
*********** ***********
ANTENNE REGIONALE DE LA CELLULE REGIONAL BRANCH OF TEACHERS
D’APPUI À L’ACTION PÉDAGOGIQUE RESOURCE UNIT
*********** ***********
B.P: 54 Ngaoundéré Tél: 22 25 11 65 P.O BOX: 54 Ngaoundéré Tel: 22251165

Subject Code Paper Number


Number: 0795
The Teachers’ Resource Unit and the Regional Inspectorate 2
of Pedagogy, in collaboration with the Adamawa Computer
Science Teachers’ Association (ACOSTA) SUBJECT TITLE:

COMPUTER SCIENCE

CANDIDATE NAME ……………………..............………


REGIONAL MOCK GENERAL
CANDIDATE NUMBER…………………...............……… CERTIFICATE OF EDUCATION
EXAMINATION
CENTER NUMBER…………………………............………
ADVANCED LEVEL DATE
TWO and a Half (2 1/2) hour MARCH

INSTRUCTIONS TO CANDIDATES:

Answer any SIX questions.

All questions carry 17 marks each. For your guidance, the approximate mark for each part of a question is
indicated in brackets.

You are reminded of the necessity for good English and orderly presentation in your answers.

In calculations, you are advised to show all the steps in your working, giving your answer at each stage.

Turn Over
TRU/RPI/0795/2025
1. (a) (i) Explain the roles of the Control Unit and the Arithmetic and Logic Unit (ALU) in a CPU (2 marks)
(ii) How does the word size of a CPU affect its performance? (2 marks)
(iii) Describe the steps involved in the machine cycle. (2 marks)
(b) (i) How much memory can a 32-bit address bus address? (2 marks)
(ii) How many bits are needed to address 512 MB of memory? (2 marks)
(iii) Distinguish between direct addressing and indirect addressing. (2 marks)
(c) (i) Explain the concept of virtual memory and how it allows a computer to run larger programs (3 marks)
than its physical RAM would normally allow.
(ii) State and explain two factors that can affect the computer performance. (2 marks)

2. (a) (i) Represent the decimal number -45 in 8-bit two’s complement form. (2 marks)
(ii) Perform the binary addition of 1101 and 1011. (2 marks)
(b) (i) Design a truth table for a logic circuit that outputs 1 when the number of 1s in inputs A, B, (2 marks)
C is even.
(ii) Derive the Boolean expression for the output X of the circuit. (2 marks)
(iii) Draw the logic circuit using XOR gates. (2 marks)
(c) (i) Compare sequential access and direct access storage methods, giving an example of each. (3 marks)
(ii) Explain the difference between half-adder and full-adder circuits. Provide their truth tables (4 marks)
and expressions of their outputs.

3. (a) (i) What is deadlock in an operating system? (1 mark)


(ii) Draw a resource allocation graph showing a deadlock between three processes P1, P2, P3. (3 marks)
(iii) Describe two methods for deadlock recovery. (2 marks)
(b) The table below shows attributes of 4 processes in a computer operating system.
PROCESSES ARRIVAL TIME (in se BURST TIME (in sec)
P1 0 5
P2 1 3
P3 2 8
P4 3 6
(i) Using the Shortest Job First (SJF) scheduling algorithm, draw a Gantt chart for the (3 marks)
following processes:
(ii) Calculate the average waiting time and turnaround time for the processes. (3 marks)
(C) (i) Distinguish between preemptive and non-preemptive scheduling strategies. (3 marks)
(ii) Explain the concept of paging in memory management. (2 marks)

4. (a) Define the following terms:


(i) Primary key (1 mark)
(ii) Entity (1 mark)
(iii) Cardinality (1 mark)
(b) What is referential integrity in a database? (2 marks)
(c) The principal of GBHS MORA wants to put in place a new information system to manage students results during
examination. He calls upon your expertise to help them in the creation of the database component. Actually, all
their information are stored in the table below.
studentID studName CourseID CourseName Grade
M001 EWOH 0795 Comp. science A
M002 AHANDA 0765 Maths B
MC003 NYEBE 0780 physics C
(i) Explain why the following table is in First Normal Form (1NF): (2 markS)
(ii) Draw the entity relationship diagram of this database. (3 markS)
(iii) Write an SQL query to retrieve the names of students who scored an A in the (2 marks)
course COMPUTER SCIENCE.
(d) (i) Explain the concept of normalization in database design. (2 marks)
(iv) Normalize this table to the third Normal Form (3NF) (3 marks)

1 of 2
TRU/RPI/0795/2025
5. (a) (i) Distinguish between a Local Area Network (LAN) and a Wide Area Network (WAN) (2 marks)
(ii) Describe the star topology and explain why it is easy to manage and troubleshoot. (2 marks)
(b) (i) 1 of 2
A company has offices in three cities. Suggest a suitable WAN topology for connecting (3 marks)
these offices.
(ii) Explain the role of a router in such a network. (2 marks)
(iii) State and give the role of two other network equipments that can be used in that network. (4 marks)
(c) (i) Compare synchronous and asynchronous data transmission. (2 marks)
(ii) Explain the purpose of a firewall in network security. (2 marks)

6. (a) (i) Distinguish between recursion and iteration. (2 marks)


(ii) Write a recursive function in pseudocode to calculate the factorial of a number. (2 marks)
(b) (i) Perform a bubble sort on the array [5, 3, 8, 1, 4]. Show the array after each pass. (2 marks)
(ii) What is the time complexity of the bubble sort algorithm? (2 marks)
(c) (i) Explain the concept of dynamic data structures and give an example. (2 marks)
(ii) Write a pseudocode algorithm to find the maximum value in an array. (3 marks)
(d) Consider the following arithmetic expression written in C-style infix notation:
(a + b) * (c - d)
(i) Convert the expression into a binary tree representation. Draw the tree and label each node (2 marks)
with the appropriate operator or operand.
(ii) Traverse the tree using the following methods and write the sequence of nodes visited: (2 marks)
• Preorder traversal
• Inorder traversal

7. (a) (i) Describe the stages of the System Development Life Cycle (SDLC). (4 marks)
(ii) What is the purpose of a feasibility study in system development? (2 marks)
(b) (i) Describe two methods a systems analyst can use to gather information about an existing (4 marks)
system.
(ii) Explain the parallel changeover method in system implementation. (2 marks)
(c) (i) Distinguish between black box testing and white box testing. (3 marks)
(ii) Explain the importance of user documentation in system development. (2 marks)

8. (a) (i) Design test data for a program that checks if a person is eligible to vote (age >= 18). (3 marks)
(ii) Why might a software developer provide only the object code to the user? (2 marks)
(b) (i) Identify a logic error in the following pseudocode: (2 marks)
IF age > 18 THEN OUTPUT "You can vote" ELSE OUTPUT "You cannot vote"
(c) (i) Explain the concept of encapsulation in object-oriented programming. (2 marks)
(ii) Write a pseudocode algorithm to calculate the sum of the first N natural (4 marks)
(d) Consider the following algorithm written in pseudocode:
FUNCTION MysteryAlgorithm(A, n):
sum ← 0
FOR i ← 1 TO n DO
IF A[i] > 0 THEN
sum ← sum + A[i]
ELSE
sum ← sum - A[i]
END IF
END FOR
RETURN sum
END FUNCTION
Dry run the algorithm for the array A = [3, -2, 5, -1, 4] and n = 5. Complete the trace table (4 marks)
below, showing the values of i, A[i], and sum at each step.
Iteration Value of i Value of A[i] Value of sum

2 of 2
TRU/RPI/0795/2025

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy