MCS-203 2024 SOLVED ASSIGNMENT

Description

Course Code : MCS-203
Course Title : Operating Systems
Assignment Number : PGDCA(I)/203/Assignment/2024
Maximum Marks : 100
Weightage : 30%
Last Date of Submission : 30th April, 2024 (for January session)
31st October, 2024 (for July session)
This assignment has six questions. Answer all questions. Each question is of 20 marks. Rest
20 marks are for viva voce. You may use illustrations and diagrams to enhance the
explanations. Please go through the guidelines regarding assignments given in the
Programme Guide.
Question 1: (15 Marks)
Consider the following set of processes, with the length of the CPU burst time given in milliseconds.
Process Burst
time
Priority
P1 8 3
P2 3 1
P3 4 4
P4 7 2
P5 6 5
The processes are assumed to have arrived in the order P1, P2, P3, P4 and P5 and
all of them have arrived at time 0.
a. Draw corresponding Gantt charts illustrating the execution of these processes using FCFS, SJF,
SRTN, Priority based scheduling/even-driven scheduling and Round Robin (quantum=2) scheduling
algorithms.
b. What is the turnaround time of each process for each of the scheduling algorithm in (a)?
c. What is the waiting time of each process for each of the scheduling algorithm in (a)?
d. Which of the schedules in (a) results in minimal average waiting time (overall processes)?
Question 2: (15 Marks)
Consider the following page-reference string:
1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6
How many page faults would occur for the following replacement algorithms, assuming three frames?
Remember all frames are initially empty.
a. FIFO replacement b. LRU replacement c. Optimal
Mention the merits and demerits of each of the above algorithms.
9
Question 3: (15 Marks)
On a disk with 1000 cylinders, numbers 0 to 999, compute the number of tracks the disk arm must move
to satisfy all the requests in the disk queue. Assume that the head is initially at cylinder 123. Suppose the
requests have arrived, forming the following disk queue:
123, 874, 692, 475, 105, 376, 499, 542, 789, 645, 12, 923
(i) Perform the computation for the following disk scheduling algorithms:
(a) FCFS (b) SSTF (c) SCAN (d) LOOK
(ii) Depict the corresponding schemes in the form of a diagram.

Question 4: (10 Marks)
Write a program in C to implement Banker’s Algorithm to avoid Deadlock. Also explain the code briefly.

Question 5: (15 Marks)
Discuss in detail the Process Management, Memory management, I/O management, File management
and Security and Protection in WINDOWS 11 Operating System.

Question 6: (10 Marks)
Write about the features of LuneOS. Also, discuss the process management, memory management and
security management functions of LuneOS Mobile Operating System(GNU-General Public Licence).