PLEASE MATCH YOUR ASSIGNMENT QUESTIONS ACCORDING TO YOUR SESSION
IGNOU MCS-203 (January 2025 – July 2025) Assignment Questions
Question 1: Consider the following jobs.
a) Using the SRTF method, compute the completion times of the above jobs, average turn around time and average waiting time.
b) Using the SJF (Shortest Job First) method, compute the completion times of the above jobs, the average turn around time and the average waiting time.
c) Using the Round Robin method (with Quantum = 2), compute the completion times of the above jobs and the average waiting time.
Question 2: Discuss the different techniques for I/O management in an operating system. Explain how buffering, spooling, and caching improve I/O performance. Give examples to illustrate their practical applications.
Question 3: Describe the structure of a disk in an operating system and explain the concept of disk scheduling. Compare the FCFS, SSTF, and SCAN scheduling algorithms. Provide an example to demonstrate the working of these algorithms.
Question 4: Compare and contrast contiguous and non-contiguous memory allocation methods. Explain the First-Fit, Best-Fit, and Worst-Fit algorithms for memory allocation with examples. Which method is more efficient and why?
Question 5: Consider the following page-reference string:
1, 3, 4, 2, 7 , 8, 6, 2, 3,9, 6, 4, 2, 1, 3, 5, 9, 10, 4, 1, 5, 3, 4
How many page faults would occur for following replacement algorithms assuming four frames? Remember that all frames are initially empty, so your first unique pages will all cost one fault each.
i. FIFO replacement.
ii. LRU replacement.
iii. Optimal replacement.
Question 6: Differentiate between processes and threads. Explain the advantages of multithreading in an operating system. Propose a threading algorithm using a producer-consumer problem and explain how synchronization is achieved using semaphores.
Question 7: Explain the concept of virtual memory and its importance in modern operating systems. Describe the working of demand paging and how page faults are handled. Provide an example to demonstrate the process.
Question 8: Describe the architecture of a mobile operating system such as Android or iOS. Discuss the key features, differences from desktop operating systems, and challenges associated with mobile OS development.
IGNOU MCS-203 (January 2024 – July 2024) Assignment Questions
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).