Scribd
Upload
4 views

Assignment Set1 and Set2

Uploaded by

28254.anubhav
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
4 views

Assignment Set1 and Set2

Uploaded by

28254.anubhav
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Assignment Set 1: Operating System Overview & Process Management (Mixed

with Numerical)

1. Explain the objectives and functions of an Operating System.


o Discuss how an OS facilitates process management, memory management, and
I/O handling.
2. A process has the following burst times: P1 = 10ms, P2 = 15ms, and P3 = 20ms.
Using First-Come, First-Served (FCFS) scheduling, calculate the average waiting
time for all processes.
o Show step-by-step calculations for each process.
3. Using Round Robin scheduling with a time quantum of 5ms, and the following burst
times: P1 = 10ms, P2 = 20ms, and P3 = 25ms, calculate the completion time for each
process.
o Show how the processes are scheduled in each round.
4. In a system using Shortest Job First (SJF) scheduling, the burst times for four
processes are as follows: P1 = 9ms, P2 = 5ms, P3 = 12ms, and P4 = 6ms. Calculate
the average waiting time.
o Clearly show the order of process execution and waiting time calculations.
5. Describe the booting process of an Operating System from power-on to loading the
OS into memory.
o Explain how the system initializes hardware components and loads the kernel into
memory.

Assignment Set 2: CPU Scheduling (Numerical Focus)

1. In a system using Shortest Remaining Time First (SRTF) scheduling, the burst
times of four processes are as follows: P1 = 8ms, P2 = 4ms, P3 = 9ms, and P4 = 5ms.
Calculate the average turnaround time for all processes.
o Provide detailed calculations for each process.
2. Consider the following process burst times: P1 = 7ms, P2 = 3ms, and P3 = 9ms.
Calculate the completion time of each process using First-Come, First-Served
(FCFS) scheduling.
o Show the step-by-step scheduling process.
3. A system is using multilevel queue scheduling with three priority levels. Process P1
runs for 8ms, P2 runs for 12ms, and P3 runs for 5ms. If each level has a different
time quantum (Q1 = 4ms, Q2 = 8ms, and Q3 = 10ms), calculate the total time taken
for each process to complete.
o Clearly explain how processes move through the queues and the time quantum.
4. A Round Robin scheduler uses a time quantum of 4ms. The burst times of three
processes are: P1 = 12ms, P2 = 7ms, and P3 = 20ms. Calculate the average
turnaround time for all processes.
o Show the execution of each process in rounds.
5. Describe the role of the Process Control Block (PCB) and its significance in process
management.
o Explain the elements contained in a PCB and how it aids in process switching and
scheduling.

You might also like