MCS-041
1. Consider the
following set of processes with arrival times and CPU execution times given in
milliseconds. A process with a larger priority number has a higher priority. If
any assumptions made by you, state them.
|
Process
|
Arrival Time
|
Execution Time
|
Priority
|
|
|
P1
|
0
|
04
|
5
|
|
|
P2
|
3
|
12
|
4
|
|
|
P3
|
5
|
09
|
3
|
|
|
P4
|
5
|
02
|
2
|
|
|
P5
|
7
|
06
|
1
|
|
(i) Draw the Gantt
charts illustrating the execution of these processes using the FCFS, SJF, Round
Robin (with quantum = 1) and Priority Based Scheduling algorithms.
(ii) Also calculate
the average turnaround time, average waiting time, processor utilization and
throughput for each of the algorithms mentioned in (i).
2. 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 following replacement
algorithms for a memory with 4 frames? Remember that all frames are initially
empty, so your first unique pages will all cost one fault each.
(i) LRU replacement.
(ii) FIFO replacement.
(iii) Optimal replacement.
3. Write a
monitor solution to the dinning-philosopher problem. (10 Marks)
4. Study
and implement the Lamport’s Bakery Algorithm for Interprocess synchronization
using C/C++ programming language. (10
Marks)
5. Discuss in detail the features, Process management,
Memory management, I/O and File management and Security and Protection in
Windows 10 Operating System.
*****************************************************************
Note: Answer with Dotcom Books
www.dotcombooks4u.com
(Last 5 year solved question
paper with Assignment solutions)
9825183881
****************************************************************
No comments:
Post a Comment