FRIENDS COLLEGE KAIMOSI

DICT 1
OPERATING SYSTEM
TIME 3: HOURS
INSTRUCTION TO CANDIDATES
1. ALL QUESTIONS CONTAIN EQUAL MARKS
2. ANSWER ANY FIVE QUESTIONS
3. MARKS FOR EACH QUESTION ARE INDICATED

1 a) Define inter-process communication(IPC) [1 mark]

b) Explain the following as applied to process management in operating system
i) Race conditions
ii) Mutual Exclusion
iii) Critical section [9 marks]

c) Explain with the aid of a diagram three process states [6 marks]

d) Explain any two ways of avoiding race conditions [4 marks]

2. a) Differentiate between the following

i) Process and file

ii) System call and The Shell
iii) Master file and transaction file [12 marks]

b) Explain the following terms in respect to operating system structure

i) Monolithic
ii) Layered
iii) Client server Model
iv) Virtual machines [8 marks]

3 a) Describe the following terms as applied to process scheduling

i) Jobs
ii) FCFS
iii) Round robin
iv) Priority
v) Pre-emptive
vi) Multiple queues
vii) SJF [ 14 marks ]
b) Explain any Three types of operating system [ 6 marks ]

4 a) Distinguish between the following

i) Message passing and Semaphores
ii) Monitors and Sleep and wake up
iii) Critical section and Mutual exclusion with busy waiting
[12 marks ]

b) Explain the following job control

i) Command language
ii) Job control language
iii) System messages
iv) Error diagnosis [8 marks ]

5. a) Describe the following as applied to Deadlock

1
 i) Deadlock
ii) Deadlock detection
iii) Deadlock recovery
iv) Deadlock Avoidance
v) Deadlock diagnosis
vi) Deadlock prevention [12 marks]
b) Explain the four conditions for a deadlock [ 8 marks ]

6. a) Table I shows a number of processes with their corresponding burst and arrival
times. Use it to answer the questions that follow:

Process Burst time Arrival time

P1 8 0
P2 4 1
P3 9 2
P4 5 3
Assuming round robin scheduling algorithm, with a time slot of 2 units;
i) Determine average turn around time; [15 marks]
iii) State two advantages and one disadvantage of this scheduling algorithm [3 marks]

7) a) Outline four advantages of distributed operating systems [4 marks ]

b) Jane intends to design a system that should ensure efficient mutual exclusion.
during process execution State any four ways of ensuring mutual exclusion. [8marks ]
c) Distinguish between Static and dynamic scheduling [ 4 marks ]
d) Distinguish between asymmetric and symmetric multiprocessing systems [ 4 marks ]

8) a) How do you handle deadlock conditions [10 marks ]

. b) How do consider programs which share data. [ 6 marks ]

c) How should we handle a collision between processes [ 4 marks ]

d) Differentiate between synchronous and asynchronous as applied to process

Management [ 4 marks ]

By kemei Julius