Scribd
Upload
41 views2 pages

21CS404 Operating Systems

Uploaded by

jothishwar007
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
41 views2 pages

21CS404 Operating Systems

Uploaded by

jothishwar007
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Reg. No.

R.M.D. ENGINEERING COLLEGE


(An Autonomous Institution)
RSM Nagar, Kavaraipettai – 601 206
QP CODE: 244312
B.E./B.TECH.- END SEMESTER SUPPLEMENTARY ARREAR THEORY EXAMINATIONS-FEB/MAR 2024
Third Semester
Information Technology
21CS404-Operating Systems
(Regulations 2021)
COs Course Outcome: The students, after the completion of the course, are expected to ….
CO1 Implement the basic concepts of operating systems and process.
CO2 Analyze various CPU scheduling algorithms and thread mechanism.
CO3 Implement the concepts of process synchronization and deadlocks.
CO4 Design various memory management schemes to given situation
CO5 Implement various I/O and file management techniques.
Time : 3 Hours Answer ALL Questions Max. Marks : 100
Part-A (10 x 2 = 20 Marks)
1. Is timesharing different from multiprogramming? If so, how?
2. How does an interrupt differ from a trap?
3. Define Threads. State the advantages of Threads.
4. What is the difference between user level thread and kernel level threads?
5. What is Race condition?
6. Define deadlock.
7. Differentiate between internal and external fragmentation.
8. What is the use of TLB?
9. What are the different accessing methods of a file?
10. What is DMA?
Part – B (5 x 13 = 65 Marks)
11.a. Draw the state diagram of a process from its creation to termination, including all transitions, and
briefly illustrate every state and every transition. (13)
Or
11.b. Explain in detail about Inter Process communication using message passing system. (13)

12.a. Discuss in detail about threads and various threading models. (13)
Or
12.b. Consider the following process with the CPU burst time given in milliseconds
Process Burst time Priority
P1 5 2
P2 1 1
P3 7 3
P4 1 4
P5 3 2
Processes are arrived in P1,P2,P3,P4,P5 order of all at time 0
i) Draw Gantt charts to show execution using FCFS, SJF (Non-Preemption), Priority (Non
Preemption) and RR (Quantum=2ms) Scheduling. (7)
ii) Also calculate the waiting time and Turnaround time. (6)
13.a. Explain bounded buffer problem and justify how to solve them from race condition. (13)
Or
13.b. Explain deadlock in detail with the system model and characterization. (13)

14.a. Given memory partitions of 100k, 50k,600k,450k,200k,600k


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 i) FIRST FIT ii) BEST FIT and iii) WORST FIT algorithms. (5+4+4)
Or
14.b. Consider the page reference string: 7,0,1,2,0,3,0,4,2,3,0,3,2,1,2,0,1,7,0,1. How many page faults would
occur for FIFO, Optimal, LRU page replacement algorithm when the number of frames is 3. (5+4+4)

15.a. Write short notes on file protection and sharing. (13)


Or
15.b. Explain in detail about IO hardware and IO devices. (13)
Part – C (1 x 15 = 15 Marks)

16.a. Consider the following snapshot of a system


Allocation Max Available
ABC ABC ABC
P0 010 753 332
P1 200 322
P2 302 902
P3 211 222
P4 002 433
i. Is the system in a safe state? (6)
ii. What is the content of matrix Need? (4)
iii. What are the total number of resources available for each resource type? (2)
iv. If a request from process P1 arrives for (1,2,1) can the request be granted immediately? (3)

Or
16.b. Suppose that the head of moving head disk with 200 tracks numbered 0 to 199 is currently serving the
request at track 143 and has just finished a request at track 125.If the queue request is kept in FIFO
order,86, 147, 91, 177, 94, 150, 102, 175, 130What is the total head movement to satisfy these requests
for i) FCFS ii) SSFT iii) SCAN iv) C-SCAN v) LOOK vi) C LOOK disk scheduling algorithm.
(3+3+3+2+2+2)

Knowledge Level (Blooms Taxonomy)
K1 Remembering (Knowledge) K2 Understanding (Comprehension) K3 Applying (Application of Knowledge)
K4 Analyzing (Analysis) K5 Evaluating (Evaluation) K6 Creating (Synthesis)

Knowledge Level and Course Outcome – Question wise Mapping


Part Part A
Question 1 2 3 4 5 6 7 8 9 10
K Level K2 K2 K2 K2 K2 K2 K2 K2 K2 K2
CO CO1 CO1 CO2 CO2 CO3 CO3 CO4 CO4 CO5 CO5
Part Part B Part C
Question 11 (a) 11(b) 12 (a) 12 (b) 13 (a) 13 (b) 14 (a) 14 (b) 15 (a) 15 (b) 16 (a) 16 (b)
K Level K2 K2 K2 K3 K2 K2 K3 K3 K2 K2 K3 K3
CO CO1 CO1 CO2 CO2 CO3 CO3 CO4 CO4 CO5 CO5 CO3 CO5

You might also like