Reg.
No :
Question Paper Code :120181
B.E./[Link] DEGREE EXAMINATION APRIL/MAY-2025
Fourth Semester
Artificial Intelligence and Data Science
CS23431 OPERATING SYSTEM
(Common to: AI&ML, IT, CSE,CSE(CS)
(Regulations 2023)
Time:Three Hours Maximum: 100 Marks
Answer ALL Questions
PART A (10x2=20 Marks)
1. What are the key functions of an operating system? [CO1] [AI]
2. List the different types of system calls in an operating system. [CO1] [A1]
3. Define inter-process communication (IPC) and its types. [CO2] [Al]
4. Consider a CPU scheduling scenario where five processes with the (CO2] [A2]
following arrival times and burst times need to be scheduled using
the Shortest Job First (SJF) algorithm. Compute the average
time and turnaround time. waiting
Process Arrival Burst
Time Time
P1 6
P2 1 3
P3 8
P4 3 4
P5 4 2
5. What is Peterson's solution, and how does it
help in process [CO3] (Al]
synchronization?
6. What is the purpose of the Banker's Algorithm in
safety? ensuring system [C03] (A2]
7. Compare paging and segmentation in memory
management. [CO4] (AI]
8. What do you meant by demand paging and
thrashing in virtual [CO4] [A2]
memory?
9 What are the different file access methods
used in an operating [COS] [AI]
system?
1|120181
10. Compare contiguous
allocation, linked allocation, and indexed [COS]
allocation in fle systems. TA21
PART B (5x13=65 Marks)
11. a. Describe the different types of
Operating System structures with [CO1] [B1]
a neat diagram.
[OR)
b. Explain the system booting process and the role
of system calls [CO1] B21
in OS with a neat diagram.
12. a. Explain the concept of multithreading models and
their [CO2] B1]
advantages in process management.
[OR]
b. Consider a CPUscheduling scenario where four
processes are (CO2] B2]
scheduled using the Round Robin algorithm with atime quantum
of 3ms. Compute the average waiting time and turnaround time.
Burst
Process
Time
P1 5
P2 8
P3 12
P4 6
13. a. With a neat diagram, explain semaphores and their role in {COS| (BI]
process synchronization.
[ORJ
[CO3] B2]
b. Consider a system with five processes (P0, P1, P2, P3, P4) and
determine
three resource types (A, B, C). The system needs to
whether it is in a safe state using the Banker's Algorithm.
Perform step-by-step calculations to verify the safe sequence.,
2|1201 81
Given the following details:
Allocation Matrix (Resources currently allocated to each
process):
ProcessABC
PO 0 10
PI 200
P2 30 2
P3 2 1 1
P4 00 2
Maximum Matrix (Maximum demand of each process):
Process ABC
& PO 753
32 2
P2 902
2 P3 222
2 P4 4 33
Available Resources (Currently available in the system):
ABC
3 3 2
paging [Co4] B1]
14. a. Witha neat sketch, explain the structure of apage table in
memory management.
[OR.
b. A system uses the FIFO and LRU page replacement algorithm {CO4] B2)
with three and four frames. Given the page reference string
below, compute the number of page faults.
Reference String: 1, 2, 3, 4,2, 1,5, 2, 4, 5,3, 2
3|120181
1s. a. Explain the various file allocation
methods in an operating [COS] [B1]
system with neat sketches.
[OR.
b. Consider a disk scheduling scenario where requests
are arriving |CO] [B2]
for the following tracks in the given order: 98, 183, 37, 122, 14.,
124, 65, 67. The read/write head is currently at track 53. Apply
the SCAN scheduling algorithm and compute the total head
movement.
PART C (1x15-15 Marks)
16. a. Design a virtual memory management systëm with appropriate
algorithms [C1]
and explain how page replacement works in an OS with a neat
diagram.
[OR]
b. Consider a case study of the Linux file system. Analyze its
directory [C2]
structure, access control, and file allocation methods.
4|120 181