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 _______________________________________

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

b. Code, test, fix, launch, maintain update a. Application

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

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

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
c. The delay that is tolerated for a task without ______________________________________
disturbing the entire project 48. Stacks are data structures that
d. The delay between two dependent tasks a. Allows elements to be added at both ends.
_______________________________________ b. Apply the principle of FIFO
42. Three constraints of a project are c. Allows elements to be added at the top only.
a. Time, cost, scope d. That allows elements to be removed from
any point.
5MOCK/NAL/0795/1/2024/ Turn Over
 NAL MOCK 2024, 795 COMPUTER SCIENCE PAPER 1

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