#1 Best Selling IGNOU Assignments in All Available in Market
Bought By: 1903 Students
Rating:
Get IGNOU MCS-203 Assignments Soft Copy ready for Download in PDF for (January 2024 - July 2024) in English Language.
Are you looking to download a PDF soft copy of the Solved Assignment MCS-203 - Operating Systems? Then GullyBaba is the right place for you. We have the Assignment available in English language.
This particular Assignment references the syllabus chosen for the subject of Computer Application, for the January 2024 - July 2024 session. The code for the assignment is MCS-203 and it is often used by students who are enrolled in the PGDCA (New) Degree.
Once students have paid for the Assignment, they can Instantly Download to their PC, Laptop or Mobile Devices in soft copy as a PDF format. After studying the contents of this Assignment, students will have a better grasp of the subject and will be able to prepare for their upcoming tests.
Question 1: Consider the following set of processes, with the length of the CPU burst time given in milliseconds.
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: 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.
Question 3: 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: Write a program in C to implement Banker’s Algorithm to avoid Deadlock. Also explain the code briefly.
Question 5: Discuss in detail the Process Management, Memory management, I/O management, File management and Security and Protection in WINDOWS 11 Operating System.
Question 6: 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).
The IGNOU open learning format requires students to submit study Assignments. Here is the final end date of the submission of this particular assignment according to the university calendar.
Here are the PDF files that you can Download for this Assignment. You can pick the language of your choice and see other relevant information such as the Session, File Size and Format.
In this section you can find other relevant information related to the Assignment you are looking at. It will give you an idea of what to expect when downloading a PDF soft copy from GullyBaba.
In addition to this Assignment, there are also other Assignments related to the PGDCA (New) Computer Application you are preparing for. Here we have listed other Assignments that were bought along with this one.