You can check all questions of this assignment below for more clarification before taking this IGNOU MCS 203 Solved Assignment 2024 pdf download facility.
IGNOU MCS 203 Assignment 2024 Question Paper
Whereas, You can easily take the IGNOU MCS 203 solved assignment 2024 pdf download facility. But , Here we shared all the questions of this assignment for more clarification.
- 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.
- 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.
- What is the turnaround time of each process for each of the scheduling algorithm in (a)?
- What is the waiting time of each process for each of the scheduling algorithm in (a)?
- Which of the schedules in (a) results in minimal average waiting time (overall processes)
- 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.
- FIFO replacement b. LRU replacement c. Optimal
Mention the merits and demerits of each of the above algorithms.
- 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.
- Write a program in C to implement Banker’s Algorithm to avoid Deadlock. Also explain the code briefly
- Discuss in detail the Process Management, Memory management, I/O management, File management and Security and Protection in WINDOWS 11 Operating System
- 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)
IGNOU MCS 203 Solved Assignment 2024 Pdf Download Facility
At last, Vidyanju hopes that you all are happy with our IGNOU MCS 203 Solved Assignment 2024 pdf download facility. Please, visit our store for more assignments.