Reg. No.

Question Paper Code : 18041

B.E. / B.TECH. DEGREE EXAMINATION, NOVEMBER / DECEMBER 2021

Fifth Semester
B.E. – Computer Science and Engineering
19CS501 – OPERATING SYSTEMS
(Regulations: Mepco – R2019)
Duration: 3 Hours Max. : 100 Marks
Answer ALL Questions

BTL, CO PART A – (10  2 = 20 Marks)

R, CO1 1. List out some system calls required to control the communication system.
U, CO1 2. Which of the following scheduling policy is most suitable for time-shared
operating systems? Justify your answer.
A) Shortest Job First B) Round Robin
C) First come First serve D) Elevator
U, CO2 3. Is it possible to have a deadlock involving only one process?
R, CO2 4. Which of the following is NOT a valid deadlock prevention scheme? Justify your
answer.
A) Release all resources before requesting a new resource
B) Number the resources uniquely and never request a lowered numbered
resource than the last one requested
C) Never request a resource after releasing any resource
D) Request and all required resources be allocated before execution
E, CO3 5. Justify, Why page sizes are always power of 2?
U, CO3 6. Which memory allocation scheme is faster? Justify your answer.
A) First fit B) Best fit C) Worst fit D) None of the above
U, CO4 7. Outline the importance of swap space management.
A, CO4 8. Consider the virtual page reference string: 1, 2, 3, 2, 4, 1, 3, 2, 4, 1, 2 with main
memory of size 3 frames that are initially empty. The number of page faults
under LRU page replacement policy is __________. Justify your answer.
A) 5 B) 6 C) 7 D) 8
E, CO5 9. The Unix Kernel maintains two key data structures related to processes, the
process table and the user structure. Which of the following information is not
the part of user structure? Justify your answer.
A) File descriptor table B) System call state
C) Scheduling parameters D) Kernel stack
U, CO5 10. Infer the responsibility of kernel in LINUX operating system.

1
18041
 PART B – (5  16 = 80 Marks)
U, CO1 11. a) i. Illustrate how Resource Management is done by the operating
system. (8 Marks)
U, CO1 11. a) ii. Categorize the common services provided by an operating system. (8 Marks)
OR
U, CO1 11. b) i. Examine the Operations that can be used in processes scheduling. (8 Marks)
U, CO1 11. b) ii. Identify different approaches involved in implementing
interprocess communication. (8 Marks)

A, CO2 12. a) i. Evaluate the FCFS, preemptive and non-preemptive versions of

Shortest Job First and Round Robin (time-slice2) scheduling
algorithms with Gantt Chart for the four processes given.
Compare their average turn around and waiting time.
Process Arrival Time Burst Time
P1 0 8
P2 1 4
P3 2 9
P4 3 5
P5 4 3 (10 Marks)
U, CO2 12. a) ii. Explain about deadlock detection algorithm in detail. (6 Marks)
OR

A, CO2 12. b) i. Explain the Dining philosopher’s problem and derive the Pseudo
code using monitors. (10 Marks)
U, CO2 12. b) ii. Narrate the methods for prevention of deadlocks. (6 Marks)

A, CO3 13. a) i. A computer installation has 1000 K of main memory. The jobs
arrive and finish in the following sequence:
Job 1 requiring 200 k arrives
Job 2 requiring 350 k arrives
Job 3 requiring 300 k arrives
Job 1 finishes
Job 4 requiring 120 k arrives
Job 5 requiring 150 k arrives
Job 6 requiring 80 k arrives
A) Draw the memory allocation table using Best fit and First fit
algorithm.
B) Which algorithm performs better for the above said sequence? (8 Marks)
2
18041
U, CO3 13. a) ii. Explain in detail about page replacement algorithm used in
demand paging. (8 Marks)
OR
U, CO3 13. b) i. Explain in detail about different page table structure with a neat
diagram. (8 Marks)
A, CO3 13. b) ii. Let the page reference and the working set window be c c d b c e
c e a d and 4, respectively. The initial working set at time t = 0
contains the pages {a, d, e}, where a was referenced at time t = 0,
d was referenced at time t = −1, and e was referenced at time
t = −2. Determine the total number of page faults and the average
number of page frames used by computing the working set at each
reference. (8 Marks)

U, CO3 14. a) i. Explain in detail about various file allocation methods. (8 Marks)
L, CO4 14. a) ii. Assuming the current disk cylinder to be 50 and the sequence for
the cylinders to be 1,36,49,65,53,12,3,20,55,16,65 and 78 find the
sequences of servicing using
A) Shortest-Seek Time First (SSTF)
B) Elevator Disk Scheduling Polices (8 Marks)
OR
U, CO4 14. b) i. Explain in detail about different directory structures used in file
system management. (8 Marks)
L, CO4 14. b) ii. The head of a moving head disk with 100 tracks numbered 0
to 99 is currently serving a request at tract 55. If the queue of
requests kept in FIFO order is 10, 70, 75, 23, 65. Which of the
two disks scheduling algorithms FCFS (First Come First Served)
and SSTF (Shortest Seek Time First) will require less head
movement? Find the head movement for each of the algorithms. (8 Marks)

U, CO5 15. a) i. Describe the components of Linux system with a neat sketch. (8 Marks)
U, CO5 15. a) ii. Discuss the various system administrator roles in LINUX OS. (8 Marks)
OR
U, CO5 15. b) i. Elaborate the history of Windows operating system. (8 Marks)
U, CO5 15. b) ii. Summarize Android software stack with its architecture. (8 Marks)

3
18041
4
18041