Printed Page: 1 of 2

Subject Code: KCA203

0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

MCA
(SEM II) THEORY EXAMINATION 2023-24
OPERATING SYSTEMS
TIME: 3 HRS M.MARKS: 100
Note: 1. Attempt all Sections. If require any missing data; then choose suitably.

SECTION A
1. Attempt all questions in brief.
Q no. Question Marks CO
a. What are the advantages of Multiprocessor systems? 2 1
b. List the Services of operating system function. 2 2
c. Define the term trap or exception? 2 1
d. What is Process control block? List out the data field associated with 2 2
PCB.
e. What are the methods for handling deadlocks? 2 3
f. Define request edge and assignment edge. 2 3
g. What is the main function of the memory-management unit? 2 4
h. What do mean by page fault? 2 4
i. What are the various file operations? 2 5
j. What are the allocation methods of a Disk Space? 2 5

SECTION B
2. Attempt any three of the following:
Q no. Question Marks CO
a. Enumerate the different operating system structure and explain with neat 10 1
sketch.
b. Consider the set of 6 processes whose arrival time and burst time are 10 2
given below-

If the CPU scheduling policy is shortest remaining time first, calculate

the average waiting time and average turnaround time.
c. Explain the RAG representation in Deadlock Detection. 10 3
d. Consider a swapping system in which main memory contains the 10 4
following hole sizes in memory order: 10K, 4K, 20K, 18K, 7K, 9K,
12K, and 15K. Which hole is taken for successive segment requests of
12K, 10K, 9K for First Fit? Repeat this exercise for Best-Fit, Worst-Fit,
and Next-Fit. Which algorithm makes the most efficient use of memory?
e. Explain the Linked list and indexed file allocation methods with neat 10 5
diagram. Mention their advantages and disadvantages.

1|Page
 Printed Page: 2 of 2
Subject Code: KCA203
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

MCA
(SEM II) THEORY EXAMINATION 2023-24
OPERATING SYSTEMS
TIME: 3 HRS M.MARKS: 100
SECTION C
3. Attempt any one part of the following:
Q no. Question Marks CO
a. Describe the differences between symmetric and asymmetric 10 1
multiprocessing. What are three advantages and one disadvantage of
multiprocessor systems?
b. What do you understand by Time-sharing systems? Describe the 10 1
advantage of time sharing system.
4. Attempt any one part of the following:
Q no. Question Marks CO
a. Discuss in detail the critical section problem and also write the solution 10 2
for Readers-Writers Problem with semaphores.
b. Explain different process states and its transition with a neat diagram. 10 2
5. Attempt any one part of the following:
Q no. Question Marks CO
a. Define Deadlock? State and explain four conditions that are necessary for 10 3
deadlocks to occur with neat example.
b. Consider the following snapshot of a system: 10 3
Processes Allocation MAX Available
A B C D A B C D A B C D
P0 0 1 1 0 0 2 1 0 1 5 2 0
P1 1 2 3 1 1 6 5 2
P2 1 3 6 5 2 3 6 6
P3 0 6 3 2 0 6 5 2
P4 0 0 1 4 0 6 5 6
1. Calculate the content of the need matrix?
2. Is the system in a safe state?
6. Attempt any one part of the following:
Q no. Question Marks CO
a. Explain in briefly and compare, fixed and dynamic memory partitioning 10 4
schemes.
b. Illustrate the page-replacement algorithms use the reference 10 4
1,2,3,4,2,1,5,6,2,1,3,7,6,3,2,1,3,6 with 3 page frame. Find number of
page fault by using Following algorithms. a) LRU b) Optimal page
replacement
7. Attempt any one part of the following:
Q no. Question Marks CO
a. Describe the file system in detail. 10 5
b. Suppose that a disk drive has 5000 cylinders, numbered 0 through 4999. 10 5
The drive is serving a request at cylinder 143. The queue of pending
requests, in FIFO order is 86, 1470, 913, 1774, 948, 1509, 1022, 1750,
130 Starting from the head position what is the total distance (in
cylinders) that the disk arm moves to satisfy all the pending requests for
each of the following disk-scheduling algorithms ? SSTF, LOOK, C-
SCAN.

2|Page