NAL MOCK 2024, 795 COMPUTER SCIENCE PAPER 1

NAL Bilingual Academic Complex REPUBLIQUE DU CAMEROUN

Bonamoussadi.Bangue REPUBLIC OF CAMEROON
POBOX: 3712 Douala Paix – Travail - Patrie
Tél. :242 663 521 Peace - Work- Fatherland
www.cosbinal.cm AcademicYear 2023/2024

GENERAL CERTIFICATE OF EDUCATION MOCK EXAMINATION

ADVANCED LEVEL
SUBJECT TITLE 0795 - COMPUTER SCIENCE MARCH 2024
PAPER NUMBER 1

Mobile phones are NOT allowed in the examination room

Time Allowed : One Hour Thirty Minutes(1H:30M)
INSTRUCTIONS TO CANDIDATES
Read the following information carefully before you start answering the questions in the answer paper.
Make sure you have a soft HB pencil and an eraser for this examination
1 USE A SOFT HB PENCIL THROUGHOUT THE EXAMINATION
2 DO NOT OPEN THIS BOOKLET UNTIL YOU ARE TOLD TO DO SO
Before the examination begins
3 Check that this question booklet is headed “0795 – COMPUTER SCIENCE 1”
4 Insert the information required in the space provided above
5 Insert the information required in the spaces provided in the answer sheets using your HB pencil:
Candidate Name, Centre Number and Name, Subject Code Number and Paper Number
How to answer the questions in this examination
6 Answer ALL the 50 questions in this Examination. All Questions carry equal marks
7 Non-programmable calculators may be used
8 Each question has FOUR suggested answers A, B, C, D) Decide on which answer is correct, find the
number of the question on the Answer Sheet and Draw a horizontal line across the corresponding letter
to join the square brackets for the answer you have chosen. For example, if your correct answer is D,
mark D as shown below
[A] [B] [C] [D]
9 Mark only one answer for each question. If you mark more than one answer, you will score a zero for
that question. If you change your mind about answer, erase the first mark carefully and then mark your
new answer.
10 Avoid spending too much time on any one question. If you find a question difficult, move on to the next
question. You can come back to the question later.
11 Do all rough work in this booklet, using, where necessary, the blank spaces in the question booklet.
You must not take this question booklet out of the examination room.
ALL QUESTIONS BOOKLETS AND ANSWER SHEETS WILL BE COLLECTED AT THE END
OF THE EXAMINATION

1MOCK/NAL/0795/1/2024/ Turn Over

 NAL MOCK 2024, 795 COMPUTER SCIENCE PAPER 1

1. What are the 2 parts of a computer d. is the method by which the user interacts
instruction? with the computer system
a. Op-code and operator _______________________________________
b. Op-code and operand 7. During your systems boot process what is
c. Op-code and opState the first thing that happens.
d. Op- and opmemory a. The operating system is started
_______________________________________ b. The device drivers for each connected
2. Black box testing means... device are loaded
a. The tester is familiar with the code and is c. POST occurs
checking that all routes through the code work d. The BIOS switches on each connected
correctly device in a pre-defined sequence
b. The software is nearly ready for release _______________________________________
c. The tester is focused on the functionality of 8. What is the difference between paging and
the code segmentation in memory management?
d. The maximum load on the system is being a. Paging splits the process to be loaded into
checked. equal size blocks
_______________________________________ b. Paging allocates frames to hold the data on
3. What is the kernel of the operating system? the hard drive
a. The parts of the OS that interact with c. Paging splits the process to be loaded into
peripherals. variable sized, logical blocks
b. Central components of the operating d. Paging is used on Windows computers,
system segmentation on MacOS
c. The part of the OS that are not loaded into _______________________________________
memory 9. Which of the following is not a state that a
d. The start-up instructions for the computer. process in memory can be in?
_______________________________________ a. Ready to run
4. What is a multitasking computer? b. Running
a. Multiple users can be logged in at the same c. Blocked
time d. paused
b. A CPU core that can run more than one 10. The rules of a programming language
process at a time constitute its __________.
c. Multiple programs can be running at the a. Syntax
same time b. Object
d. A computer that can handle multiple input c. Logic
devices. d. Format
_______________________________________ _______________________________________
5. A signal sent by a hardware or software to 11. A __________ translates high-level
the CPU indicating that something needs language statements into machine code
attention is... a. Programmer
a. a system call b. Compiler
b. paging c. Syntax Detector
c. interrupt d. Decipherer
d. blocking _______________________________________
_______________________________________ 12. The main focus of the spiral development
6. Process management.... model is managing....
a. allocates time for processes to use the CPU a. Risks
b. stores programs and data that are presently b. Budget
being used by the CPU c. Developers
c. is responsible for creating, deleting, d. Timeline
renaming of files and folders _______________________________________

2MOCK/NAL/0795/1/2024/ Turn Over

 NAL MOCK 2024, 795 COMPUTER SCIENCE PAPER 1

13. The 6 stages of the waterfall method are c. Distributed

typically.... d. Multi-tasking
a. Analysis, development, creation, testing, _______________________________________
production, up keeping 19. Defragmentation software is an example of
b. Code, test, fix, launch, maintain update a(n)....
c. Interview, make, code, validate, check, a. Application
prototype, fix b. Operating system
d. Analysis, design, develop, test, install, c. Utility
maintain d. Anti-malware
_______________________________________ _______________________________________
14. The waterfall method is...... 20. Which of the following is not true about
a. Pouring water on your keyboard and the program counter?
hoping it makes software a. Holds addresses
b. A linear approach to software development b. Can be changed during the execution of an
c. A way to develop software quickly and instruction
responsively c. Increments after every cycle
d. Undocumented d. Holds data
_______________________________________ _______________________________________
15. What is the purpose of Memory Data 21. What is virtual memory?
Register? a. Where part of the hard drive is used as
a. Holds the memory location of data that additional memory when RAM is full.
needs to be accessed b. Storage that is non-physical
b. Where intermediate arithmetic and logic c. Multiple physical discs represented as a
results are stored single logical storage area
c. Holds data that is being transferred to or d. Storage using solid state technology
from memory _______________________________________
d. Contains the address of the next instruction 22. The amount of time taken by a device to
to be executed begin reading data is called
_______________________________________ a. Writing time
16. In this scheduling algorithm, the process b. Reading time
that comes first will be executed first and next c. Access time
process starts only after the previous gets fully d. Seek time
executed. _______________________________________
a. First-come, first-serve 23. Keys involved in relationship between
b. Round-robin scheduling tables is called
c. Priority scheduling a. Primary key
d. Shortest-job-first scheduling b. Secondary key
_______________________________________ c. Composite key
17. This is scheduling policy that selects for d. Candidate key
execution the waiting process with the smallest _______________________________________
execution time. 24. OSI stands for
a. First-come, first-serve a. open system interconnection
b. Round-robin scheduling b. operating system interface
c. Shortest job first scheduling c. optical service implementation
d. Priority scheduling d. none of the mentioned
_______________________________________ _______________________________________
18. Which type of operating system are you 25. Segmentation and reassembly is the
likely to find in a mission critical situation, for responsibility of
example, a flight management system? a. Transport layer
b. Session layer
a. Real time
c. Network layer
b. Multi-user
3MOCK/NAL/0795/1/2024/ Turn Over
 NAL MOCK 2024, 795 COMPUTER SCIENCE PAPER 1

d. Data link layer d. There is a Sequential entry that is one by

e. one
_______________________________________
26. The_________ layer uses data 31. What is the value of the postfix expression
compression to reduce the number of bits to be 6324+– *?
transmitted. a. 1
b. 40
a. Transport layer c. 74
b. Application layer d. -18
c. Session layer _______________________________________
d. Physical layer 32. Sets of rules or guidelines, which an
_______________________________________ organization
27. In a timeshare operating system, when the establishes for the use of a computer-
time slot assigned to a process is completed, the based information system. This refers to
process switches from the current state to? ____________________________________
a. Suspended a. Data
b. Ready b. Hardware
c. Blocked c. Software
d. Terminated d. Procedure
_____________________________________ _______________________________________
28. The portion of the process scheduler in an 33. Which of the following device is used to
operating system that dispatches processes is connect two systems, especially if the systems
concerned with ____________ use different protocols?
a. Assigning ready processes to waiting a. Router
queue b. Bridge
b. Assigning running processes to blocked c. Gateway
queue d. Firewall
c. Assigning ready processes to CPU ___________________________________
d. Selecting the next process 34. The number 23.25 translated into a
_______________________________________ normalized floating-point binary number in
half precision is.
29. For the tree below, write the pre-order a. 1 10100 0111010000
traversal. b. 0 10101 0111010000
c. 0 10100 0111010000
d. 0 10100 0111011000
_______________________________________
35. The address bus of a certain computer has
8 lines. What is the maximum number of
addressable memory cells?
a. 265
b. 256
a. 2, 7, 2, 6, 5, 11, 5, 9, 4 c. 252
b. 2, 7, 5, 2, 6, 9, 5, 11, 4 d. 255
c. 2, 5, 11, 6, 7, 4, 9, 5, 2 _______________________________________
d. 2, 7, 5, 6, 11, 2, 5, 4, 9 36. Decimal equivalent of the binary number
_______________________________________ 101001.1011 is:
30. Entries in a stack are “ordered”. What is A. 41.7875.
the meaning of this statement? B. 41.5875
a. A collection of stacks is sortable C. 41.6875
b. Stack entries may be compared with the ‘<‘ D. 41.1875
operation _______________________________________
c. The entries are stored in a linked list
4MOCK/NAL/0795/1/2024/ Turn Over
 NAL MOCK 2024, 795 COMPUTER SCIENCE PAPER 1

37. Consider the following set of processes, c. The delay that is tolerated for a task without
with the length of the CPU-burst time given in disturbing the entire project
milliseconds d. The delay between two dependent tasks
_______________________________________
Process Burst Priority 42. Three constraints of a project are
Time a. Time, cost, scope
P1 10 3 b. Time, resources, cost
P2 1 1 c. Cost, space, scope
P3 2 3 d. Time, space, scope
P4 1 4 ________________________________________
P5 5 2 43. PERT stands for
Using a non-preemptive priority scheduling and a. Program Evaluation and Review Technique
considering that a smaller priority number implies b. Project Execution and Review Technique
a higher priority, the order of termination of the c. Personal Evaluation and Resources Team
processes are: d. Program Execution and Rapid Testing
a. P1, P2, P3, P4, P5 ________________________________________
b. P4, P1, P3, P5, P2 44. Critical path is
c. P2, P5, P1, P3, P4 a. A set of tasks that determine the earliest time
d. P2, P4, P3, P5, P1 for delivering the final product.
______________________________________ b. The set of all tasks that are executed in the
38. Given the algorithmic statements below project.
If(A>N) or (B<0), then c. The set of tasks that all a delay without
A<A+1 disturbing the project
B<B – 1 d. The shortest path between the first and last
Else task.
A<B +N ________________________________________
End 45. Transaction in DBMS must be atomic
The statement A<B+N is only executed means that
a. When A>N or B < 0 a. There must be only one transaction running
b. When A<N or B <0 at a given time.
c. When A>N and B<0 b. A transaction must complete all its steps
d. When A>N A and B<0 before being committed
_______________________________________ c. A committed transaction modifies the state of
39. Using Round Robin scheduling with the the database permanently.
time quantum = 1, the average waiting time of d. Once a transition is committed the data
the processes is cannot be updated anymore.
a. 9.6 _______________________________________
b. 5.4 46. Broadband system are transmission
c. 3.2 systems that:
d. 8.2 a. Communicate data in both directions.
________________________________________ b. Uses the whole bandwidth for data
40. Slack time is transmission
a. The earliest time to start a task c. Can apply frequency multiplexing
b. The latest time to start a task d. Communicate in half-duplex mode
c. The delay that is tolerated for a task without _________________________________
disturbing the entire project 47. The set of operations that make up the data
d. The delay between two dependent tasks. manipulation language in SQL is summarized as
_______________________________________ a. ISUD
41. Lag time is b. CRMD
a. The earliest time to start a task c. ISMD
b. The latest time to start a task d. CRUD
______________________________________
5MOCK/NAL/0795/1/2024/ Turn Over
 NAL MOCK 2024, 795 COMPUTER SCIENCE PAPER 1

48. Stacks are data structures that

a. Allows elements to be added at both ends.
b. Apply the principle of FIFO
c. Allows elements to be added at the top only.
d. That allows elements to be removed from
any point.

49. The correct order for program execution is

a. Link, load, execute and translate
b. Translate, load, execute and link
c. Translate, execute, link and load
d. Translate, link, load and execute
_______________________________________
50. Which of the following is not a device
management technique?
a. Fragmentation
b. Spooling
c. Buffering
d. Polling
_______________________________________

6MOCK/NAL/0795/1/2024/ Turn Over