Cambridge Institute of Technology, Bengaluru

An Autonomous Institution
Approved by UGC & AICTE, New Delhi, Approved with 2(f) status by UGC
Affiliated to VTU, Accredited by NAAC with A+ Grade, UG programs, ECE, EEE, ISE and
CSE, Accredited by NBA, Certified by ISO 9001:2015

MODEL QUESTION PAPER

2024-2025
Semester : 3rd Maximum marks : 100
Course Title : Operating Systems with Unix Duration : 3 hours
Course Code : CS221 Total No. of Pages used : 4

Q.No. Question BL CO PO Marks

Define following terms 1 1 1 2

1 a) Throughput
b) Turnaround Time
c) Response Time
2 Explain Hard and Soft Real – Time systems with example. 1 1 1 2

3 What are the benefits of Child Process? l 2 1 2

4 Explain long term scheduling. 1 2 1 2

5 What is the purpose of short-term scheduler? 1 3 1 2

6 Explain safe allocation state in deadlock avoidance. 1 3 1 2

7 Differentiate between paging and segmentation. 1 4 1 2

8 What is page table? List the fields of page table. 1 4 1 2

9 What is file? List of the operations of files? 1 5 1 2

10 Explain Disk Transfer Rates. 1 5 1 2

PART-B
Q.No. Question BL CO PO Marks

Module-1
1 a) Explain five fundamental classes of Operating System 2 1 1 5

b) With a neat diagram, explain the Operation of an OS? 2 1 1 5

c) With a neat diagram, explain the concept of the virtual machine 2 1 1 6

OR

CITECH, Bengaluru -1-

2 a) Explain the concepts of virtualization and paravirtualization. 2 1 1 5

b) Compare various architectural supporting techniques for 2 1 1 6

multiprogramming.
c) Explain portability and extensibility of an operating system. 2 1 1 5

Module-2
3 a) Illustrates how the data logging system of Real Time OS benefits from use 2 2 2 5
of child processes.

b) With neat diagram, explain the different state of process. 2 2 2 5

c) Discuss how Reader-writers problem can be solved using semaphores. 3 2 2 6

OR
a) Explain the different types of threads. 2 2 2 5
4
b) Explain dining philosophers’ problem with code snippet. 2 2 2 6
c) Explain the uses of semaphores in concurrent systems. 3 2 2 5

Module-3
5 a) Explain about User-Centric Scheduling Concepts and System-Centric 2 3 2 5
Scheduling Concepts.
b) Explain three Fundamental Techniques of Scheduling to provide good user 2 3 2 5
service.
c) Consider the following set of process, with arrival time and burst time. 3 3 3 6
Draw Gantt charts, and find Completion Time, Turnaround time, Waiting
time and Response time using FCFS.
Process Name Arrival Time Burst Time
P1 0 2
P2 1 2
P3 5 3
P4 6 4
OR
6 a) A system with 5 resources (A, B, C, D, E) and 4 processes (P1, P2, P3, P4) 2 3 2 5
has 3 instances of A, 3 instances of B, 2 instances of C, 2 instances of D,
and 3 instances of E. Following is the allocation and need matrix for the
processes:
Allocation Need
Process
A B C D E A B C D E

P1 2 1 1 1 0 3 3 3 2 2

P2 1 1 2 0 2 3 2 3 1 2

P3 3 2 2 1 1 5 2 3 2 2

P4 1 0 1 1 2 2 2 2 1 3

CITECH, Bengaluru -2-

 i) Using the Banker's Algorithm, find a safe sequence for the system.

Is the system in a safe state at the moment? If not, what action can be taken
to prevent deadlock?
b) Calculate the average waiting time and turnaround time for the following 2 3 2 5
snapshot of process using: i) Non-preemptive SJF ii) Non-preemptive
priority iii) Round Robin (TQ = 1ms)

Burse Time
Processes Priority
(m sec)
P1 3 10
P2 1 1
P3 3 2
P4 4 1
P5 2 5
c) Explain the necessary condition for deadlock with example. 3 3 3 6

Module-4
7 a) With a neat diagram, explain the transformation and execution of a 2 4 2 5
program.
b) Explain two methods of Memory Allocation to a process. 2 4 2 5
c) Consider the following page reference string : 3 2 1 3 4 1 6 2 4 3 4 3 4 3 6
2 1 4 5 2 1 3 4 Assuming there are 3 frames, how many page faults
would occur in the case of FIFO.
OR
8 a) Explain LRU and FIFO page replacement algorithm with frame size 3 for 2 4 2 5
the reference string 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6.
b) Describe paging with its physical organization. 2 4 2 5
c) Explain the following concept in virtual memory management. 3 4 3 6
i) Page replacement
ii) Page Fault

Module-5
9 a) What is a file? What are its attributes, explain file operations. 2 5 2 5

b) Discuss about the various file access methods. 2 5 2 5

Given the following sequence 98, 183, 37,122, 14, 124, 65, 67 with the 3 5 3 6
c) head initially at track 53 and ending at track 199. What is the total disk
traveled by the disk arm to satisfy the request using FCFS, SSTF and
compare the average head movement of FCFS and SSTF.

OR
10 a) Explain fundamental file organizations and access methods. 2 5 2 5

b) Suppose that a disk drive has 50000 cylinders , numbered 0 to 49999. 2 5 2 5

The drive is currently serving a request at cylinder 143. The pending
requests are 86,1470, 913,1774,948,1509,1022,1750, 130. Starting from
the current head positions, what is the total distance that the disk arm

CITECH, Bengaluru -3-

 moves to satisfy all the pending requests for each of the following disk
scheduling algorithms?

a. SCAN

b. C-SCAN

c. C-LOOK

c) Explain Directory Trees of MULTICS file system. 3 5 3 6

CITECH, Bengaluru -4-