SECTION A: 30 MARKS

INSTRUCTION: This section consists of THIRTY (30) objective questions. Mark your answers in the
SECTION provided.

1. Identify ONE (1) advantage of using monolithic structure.

a. Easy to isolate any error and debugging
b. High robustness against erroneous code
c. Each layer only communicates to its upper or lower layer
d. Every procedure can communicate directly with other procedures

2. Choose THREE (3) basic functions of modern operating system.

i. Provide user interface
ii. Help user to use computer
iii. Manage computer resources
iv. As a platform to install application program
v. Give electrical power to each device connected to the computer

a. i, ii, iii c. i, iii, iv

b. ii, iii, v d. ii, iv, v

3. State the operating system that has no structure

a. Layered c. Distributed
b. Monolithic d. Microkernel

4. Select an open source operating system

a. iOS c. Windows 10
b. RedHat Linux d. Mac OS X

5. Choose ONE (1) the following statements that explain the situation in a single processor system
a. Allow to or more system to share storage
b. Only one process can run or execute at a time
c. A group of server and other resources that act like a single system
d. It uses two or more central processing unit within a single computer system

6. Miss Isyana is doing color correction for her short film using DaVinci Resolve software. At the
same time, she is downloading song using Frostwire software. Select the suitable concept in
relation to operation system
a. Caching c. Time sharing
b. Buffering d. Multiprogramming

7. Choose the technique that can used to overcome when two users are trying to print at the same
time.
a. Sniffing c. Spoofing
b. Spooling d. Buffering

1
8. Identify the example of resident routine in a computer system
a. Microsoft Word c. Adobe Photoshop
b. Internet Explorer d. Data and time system

9. Select the non-volatile memory

a. Main memory c. Disk storage
b. Random access memory d. Cache

10. State the memory management strategy that decides which piece of data to load next.
a. Fetch c. Swapping
b. First fit d. Placement

11. Identify the following Figure 1 and choose the appropriate concept name that used this
technique.

Figure 1

a. Deadlock c. Virtual memory

b. System cache d. Free space management

12. Identify the purpose of scheduling algorithm

a. Adjust the process
b. Queuing the process
c. Identify the best process
d. Identify the next process to execute

13. Identify the memory management strategy which produce the largest leftover spaces
a. Best fit c. Worst fit
b. First fit d. Last fit

14. Select the correct method for handling deadlock in an operating system
a. Circular wait c. Ignore deadlock
b. Wait deadlock d. Protect deadlock

15. Choose the free segment which should be inserted for a program with the size of 13KB by using
best-fit memory management strategy
a. 6 KB c. 25 KB
b. 17 KB d. 30 KB

2
16. Select the correct answer to describe the process of Round Robin
a. Executed according to their priority
b. Having the smallest burst time is executed first
c. The process which comes first is executed first without preemption
d. Executed for a time quantum and when the time quantum expires, the process enters into
waiting time

17. Refer to Figure 2, _____________ process have to wait for some event to occur.

Figure 2

a. New c. Waiting
b. Ready d. Terminated

18. Based on Table ABC, calculate the memory mapping value for <1, 111>

Segments Limit Base

0 320 2860
1 260 1600
2 641 3680
Table ABC

a. 149 c. 1489
b. 371 d. 1711

19. Which type of scheduling algorithm is shown in Figure 3.

Figure 3

3
 A. Multilevel Feedback Queue C. First In First Out
B. Multilevel Queue D. Priority

Refer to Table DEF for question below. Schedule the process by using FIFO algorithm. Assumed
that all process arrived at 0ms in order of A, B, & C.

Process Burst Time

A 4
B 8
C 2
Table DEF

20. Refer Table DEF. Calculate the waiting time for process B
a. 2 ms c. 12 ms
b. 4 ms d. 14 ms

21. Refer Table DEF. Calculate the average turnaround time

a. 4 ms c. 10 ms
b. 8 ms d. 14 ms

22. Select THREE (3) file access technique in file management system
a. Bit map c. Directional
b. Sequential d. Index sequential

23. Consider a disk of 16 bits where block 2 3 4 5 8 9 10 11 12 and 13 are free, what is the correct
bitmap free space list in the disk
a. 0011 0000 0111 0011 c. 0011 1100 1111 1100
b. 1100 0011 0000 0011 d. 1110 0011 0000 0011

Refer to Table XYJ for question below.

DFC2063 Rootdb Driverdb

Vidya rwx rx rw
Shareza rwx rwx rwx
Ziqry rw rx -
Table XYJ

24. Refer table XYJ. Determine the access control list of file name Rootdb
a. Rootdb – Vidya:rw, Shareza:rwx, Ziqry:-
b. Rootdb – Vidya:rx, Shareza:rwx, Ziqry:rx
c. Rootdb – Vidya:rx, Shareza:rwx, Ziqry:rwx
d. Rootdb – Vidya:rwx, Shareza:rwx, Ziqry:rw

4
25. Refer table XYJ. Identify which user is considered ad the administrator?
a. Vidya c. Ziqry
b. Shahreza d. Vidya & Shahreza

26. Select the correct statement for linked file allocation

a. Each block contains pointer to the next block
b. All the attributes for the file are stored in an index-node entry, which is loaded into
memory when the file is opened.
c. In the computer memory there is an index of pointers where each element in the ind ex
refers to a physical disk block
d. Keep track of the blocks allocated to a file which is reduced to store the first block that
the file occupies and its length

27. Figure 4 shows the illustration of linked file allocation of a disk space. Identify the correct pointer
of the diagram

1 2 3 4 File Start End

DFC2063 16 6
5 6 7 8

9 10 11 12

13 14 15 16

17 18 19 20
Figure 4

a. Start → 18 → 13 → 8 → End
b. Start → 18 → 13 → 9 → 6 → End
c. Start → 16 → 18 → 13 → 8 → End
d. Start → 16 → 18 → 13→ 8 → 6 → End

28. Operating system will use certain techniques to prevent data loss. Identify the name of the
technique used where files or data are store into the hard disk or pen drive
a. Buffer backup c. Logical backup
b. Cache backup d. Physical backup

29. File system is one of the main components in any operating system. File system are exclusively
used in _____________________.
a. input devices c. memory devices
b. storage devices d. processing devices

30. ____________ access is the easiest file access technique because records are stored and retrieved
serially one after another
a. Direct c. Indexed
b. Linked d. Sequential

5
SECTION B: 20 MARKS
INSTRUCTION: This section consists of ONE (1) subjective question. Answer all questions.

QUESTION 1

i. Define the meaning of operating system (2 marks)

ii. Explain TWO (2) types of interfaces of an operating system (2 marks)

iii. Describe the following directory structure (4 marks)

a. Single-level directory

b. Two-level directory

iv. List FOUR (4) conditions for deadlock to occur in an operating system (2 marks)

v. Based on the following table, calculate waiting time for each process involved using the Shortest
Job First scheduling. Draw the bar diagram / Gantt chart and compute the average waiting time for
the process.
a. Bar diagram / Gantt chart (2 marks) Process Arrival Time Burst Time
b. Waiting time for each process (2 marks) A 0 4
c. Average waiting time (1 marks) B 0 5
C 2 2
D 3 3

vi. Differentiate between file allocation method for contiguous allocation and index allocation. Support
your answer with diagram for each method.
(5 marks)