Reg. No.

Question Paper Code : 17071

B.E. / B.TECH. DEGREE EXAMINATION, APRIL / MAY 2021

Fourth Semester
B.Tech. – Information Technology
19IT401 - PRINCIPLES OF OPERATING SYSTEMS
(Regulations: Mepco – R2019)
Duration: 3 Hours Maximum Marks:100
Max. : 100 Marks
Answer ALL Questions
BTL,CO
PART A – (10  2 = 20 Marks)
U,CO1 1. What are the advantages of client server systems?
U, CO1 2. Which of the following statements about synchronous and asynchronous
I/O is NOT true? Justify your answer.
A) An ISR is invoked on completion of I/O in synchronous I/O but not
in asynchronous I/O
B) In both synchronous and asynchronous I/O, an ISR (Interrupt
Service Routine) is invoked after completion of the I/O
C) A process making a synchronous I/O call waits until I/O is
complete, but a process making an asynchronous I/O call does not
wait for completion of the I/O
D) In the case of synchronous I/O, the process waiting for the
completion of I/O is woken up by the ISR that is invoked after the
completion of I/O
A, CO2 3. Consider the 3 processes, P1, P2 and P3 shown in the table
Process Arrival time Time unit required
P1 0 5
P2 1 7
P3 3 4
The completion order of the 3 processes under the policies FCFS and RRS
(round robin scheduling with CPU quantum of 2 time units) are ________.
Justify your answer.

1
17071
 A) FCFS: P1, P2, P3 RRS: P1, P2, P3
B) FCFS: P1, P3, P2 RRS: P1, P3, P2
C) FCFS: P1, P2, P3 RRS: P1, P3, P2
D) FCFS: P1, P3, P2 RRS: P1, P2, P3
U, CO2 4. Consider a set of n tasks with known runtimes r1, r2, …rn to be run on a
uniprocessor machine. Which of the following processor scheduling
algorithms will result in the maximum throughput? Justify your answer.
A) Round-Robin B) Shortest-Job-First
C) Highest-Response-Ratio-Next D) First-Come-First-Served
A, CO3 5. Consider a machine with 64 MB physical memory and a 32-bit virtual
address space. If the page size is 4KB, what is the approximate size of the
page table? Justify your answer.
A) 16 MB B) 8 MB C) 2 MB S) 24 MB
R, CO3 6. Define Internal and External Fragmentation.
U, CO4 7. In which one of the following page replacement policies, Belady’s anomaly
may occur? Justify your answer.
A) FIFO B) Optimal C) LRU D) MRU
U, CO4 8. Mention the different file attributes and file types.
U, CO5 9. What is the use of kernel modules in Linux?
U, CO5 10. What are the functions of virtual file system (VFS)?

PART B – (5  16 = 80 Marks)
U,CO1 11. a) i. Discuss the essential properties of the following types of
systems:
A) Time sharing systems
B) Multi-processor systems
C) Distributed systems (8 Marks)
U,CO1 11. a) ii. Draw the state diagram of a process from its creation to
termination, including all transitions, and briefly elaborate
every state and every transition. (8 Marks)
OR

2
17071
U,CO1 11. b) i. What are threads? Why are they required? Discuss the
difference between Kernel level and user level threads. (8 Marks)
U,CO1 11. b) ii. Some computer systems do not provide a privileged mode of
operation in hardware. Is it possible to construct a secure
operating system for these computer systems? (8 Marks)

A,CO2 12. a) i. Compute the average waiting time for the processes using non-
pre-emptive SJF scheduling algorithm.
Process Arrival time Burst Time
P1 0.0 7
P2 2.0 4
P3 4.0 1
P4 5.0 4 (8 Marks)
U,CO2 12. a) ii. Discuss in detail about the critical section problem and also
write the algorithms for Readers – Writers problems with
semaphores. (8 Marks)
OR
A,CO2 12. b) i. A system with following processes and resources exits. In the

context of Dijkstra’s Banker’s Algorithm discuss:

I. Whether the system is safe state or unsafe state?

II. If a state is safe, show it is possible for all processes to

complete.If a state in unsafe, show how it is possible
for deadlock to occur.

Process Current Loan Max. Need Available

Resources
R1 R2 R3 R4 R1 R2 R3 R4 R1 R2 R3 R4
P0 0 0 1 2 0 0 1 2 1 5 2 0
P1 1 0 0 0 1 7 5 0
P2 1 3 5 4 2 3 5 6
P3 0 6 3 2 0 6 5 2
P4 0 0 1 4 0 6 5 6

A) What is the content of the matrix Need?

3
17071
 B) Is the system in a safe state?
C) If a request from process P2 arrives for (0,3,1,0), can
the request be granted immediately. (8 Marks)
U,CO2 12. b) ii. Discuss how the following pairs of scheduling criteria conflict
in certain settings:
A) CPU utilization and response time
B) Average turnaround time and maximum waiting time
C) I/O device utilization and CPU utilization (8 Marks)

A,CO3 13. a) i. The available space list of a computer memory is specified as

follows:
Start address block address in words
100 50
200 150
450 600
1200 400
Determine the available space list after allocating the space for
the stream of requests consisting of the following block sizes:
25,100,250,200,100,150
Use A) FIRST FIT B) BEST FIT and C) WORST FIT
algorithms. (8 Marks)
U,CO3 13. a) ii. Explain the following memory management techniques.
A) Partitioned allocation
B) Paging and Translation look-aside buffer (8 Marks)
OR
A,CO3 13. b) i. What are various page replacement algorithms? For the
memory with 3 page frames and the following reference
strings 4 ,3, 4, 1, 2, 5, 3, 2, 1. Find out the number of page
faults for the following page replacement algorithm:
A) FIFO
B) Optimal
C) LRU (8 Marks)

4
17071
U,CO3 13. b) ii. Explain the concept of demand paging and the performance
issue of demand paging. (8 Marks)

A,CO4 14. a) i. The queue of requests in FIFO is

90,151,95,181,98,154,106,179,134 What is the total head
movement needed to satisfy the requests for the following
Scheduling algorithms FCFS, SJF, SCAN, LOOK and
C-SCAN. (8 Marks)
U,CO4 14. a) ii. What are the drawbacks of Contiguous Allocation of Disk
Space? (8 Marks)
OR
A,CO4 14. b) i. A file system on a disk has both logical and physical block
sizes of 512 bytes. Assume that the information about each file
is already in memory using contiguous, linked, and indexed
allocation strategies. How is the logical-to-physical address
mapping accomplished in this system? (For the indexed
allocation, assume that a file is always less than 512 blocks
long). (8 Marks)
U,CO4 14. b) ii. Explain different types of directory implementation methods. (8 Marks)

U,CO5 15. a) i. Discuss in detail about process and memory management in

LINUX. (8 Marks)
U,CO5 15. a) ii. UNIX coordinates the activities of the kernel I/O components
by manipulating shared in-kernel data structures, whereas
Windows NT uses object-oriented message passing between
kernel I/O components. Discuss three pros and three cons of
each approach. (8 Marks)
OR
U,CO5 15. b) i. What scheduling algorithm is used in Linux to schedule jobs? (8 Marks)
U,CO5 15. b) ii. Explain the concept of Domain name system and multi-
function server. (8 Marks)

5
17071
6
17071