AB Sir’s Coaching

Department of Computer Science

B.Sc. Honours (3rd Semester)

Class Test, 2023

CC7 (Operating Systems)

Full Mark: 50 Time: 2 Hours

[Answer question no. 1 and any four questions from the rest]

1. Answer any five questions. (5x2=10)

a. What is Deadlock?
b. What is SPOOLing?
c. Distinguish between Short-Term and Medium-Term Scheduling.
d. What is pure demand paging?
e. Distinguish between paging and segmentation.
f. What is system call?
g. What do you mean by aging?

2. a) Distinguish between thread and process.

b) What are the criteria of CPU scheduling?
c) Consider a set of four processes with their arrival times and burst times given below:

Process Burst Time (ns) Arrival Time (ns)

P1 10 0
P2 5 1
P3 4 2
P4 7 6

Draw the Gnatt chart and find out average turn-around time and waiting time. For SJF,
SRTF and Round Robin Scheduling with time quantum=2 ns. (2 + 3 + (1+2+2))

3. a) What is PCB?
b) Distinguish between binary semaphore and counting semaphore. Explain Reader-
Writers problem.
c) Explain the concept of “wait for” graph in deadlock detection. (1+ (2+4) + 3)

4. a) Explain Multiprogramming.
b) Explain best fit and worst fit memory placement strategies with appropriate example.
c) Explain the concept of “Critical Section” and “Race around” condition (2 + 4 + (2+2))

5. a) Write Banker’s safety and resource request algorithm.

b) Consider the following snapshot of a system:

Process No. Allocation Max Available

A B C A B C A B C
P0 0 1 0 7 5 3 3 3 2
P1 2 0 0 3 2 2
P2 3 0 2 9 0 2
 P3 2 1 1 2 2 2
P4 0 0 2 4 3 3

Answer the following questions using Banker’s Algorithm:

(i) What is the content of the need matrix?
(ii) Is the system in a safe state? (5 + (1 + 4))

6. a) Explain how external fragmentation affects performance of variable partition

multiprogramming. What are the possible solutions?
b) Given references to the following pages by a process:
0,1,4,2,0,4,3,5,1,6,3,2,3,2,6,2,1,3,4,2,1,0 find number of page. Faults if the process
has 3 page frames available to it and page replacement algorithms are both LRU and
Optimal. ((3+2) + (2.5 + 2.5))

7. a) What is Belady’s anomaly?

b) What is I-Nodes?
c) Explain Virtual Memory and locality of reference.
d) Distinguish between protection and security aspect of an operating system.
(2 + 2 + 3 + 3)
8. a) What is the purpose of a FAT?
b) Distinguish between monolithic and microkernel?
c) Consider a paging system with a TLB. Each memory reference takes 300 ns, and each
look up of the TLB takes 20 ns. What is the effective memory reference time if 80% of
page-table references are found in the TLB? (3 + 3 + 4)