Advanced level 2025 North West regional mock computer science 1

Advanced level 2025 North West regional mock computer science 1

Advanced level 2025 North West regional mock computer science 1

location through n pointer A , Direct access
It , Address access
C\ Pointer ac cess
p. Indirect access
2. A haiitware component of the computer responsible lot
convening sound to a form that can be heard by
humans
A . System unit.
B. Mother board.
C. Speaker.
D. Sound Card. _

is used for poinMo»point communication or
unicast communication such as radar and satellite?
A. Infrared Waves.
Microwavcs.
C. Radio waves.
__ D. Bluetooth
4
– Tila is a graphic designer that has used a software
DocoDcsign lor a few days. She cannot continue
using it because she cannot pay for all the features.
Deco design must be:
A Bespoke software
B. Close Source Software
C. Public Domain Software
P. Shareware
5. fhe Hexadecimal l iquivalcnt of the denary number
70.625 is?
A. 64.Alt
B. C4.Al6
C. 46.Aa 6
D. 112Ju
6. Contains the programmers code recognizable by the epu
that can be executed only when the right library files are
linked:
A. Source code.
B. Assembly code.
C. Executable code.
D. Object code.
7. A computer has a 32–bits address bus of 32 lines. It can
access 4 gigabytes of main memory for all forms of
interna! use. How many additional lines docs the
address bus need for it to be capable of addressing up to
8 gigabytes?
A. 1
B. 33
C. 4
3.
B.
D. Sequential Access
15. Below‘ is a movie table with candidate key { movieTitle
Year }.
Movie

rifle Year Type Comic Director i Actor Hulk
The Query (Select COUNT(MovicTitle) FROM movie
where Director^Temka‘ ) returns
A. 2
1X 6 B. 3
Questions l and 9 are based on the Entity Relationship
Diagram (ERD) diagram below
<(u5l*fiedPaf£
C. 1
D. 0
16. A binary tree has maximum number of nodes at all
levels except the last. If any node in the last level has
only one child it will be a left child. The tree is a:
A. Full binary tree
B. Binary search tree
C. Partial binary tree.
D. Complete binary tree.
Below‘ is a precedence graph for a set of tasks to be
executed on a parallel processing system .S‘

8. The relationship best described by the ERD.
A. An exain may be taken by many students
B. A Qualified student can take an exams
C. A student must write an exam
D. A student must write many exams
9. Which of the following possible relations will not hold
if the ERD is mapped into a relational model?
A . Srudent (NID, Name).
B. Exam (ExamID, ExamName).
C. Qualification ( N I D, ExamID, QualificationDute).
D. Exam (ExamID, NID, ExamName).
17.

Efficiency is defined as the ratio between the speedup
and the number of processors. (The speedup is
defined as the ratio of the time taken to perform a set