EXCEL ENGINEERING COLLEGE
(Autonomous)
Approved by AICTE, New Delhi & Affiliated to Anna University, Chennai
Accredited by NBA, NAAC with “A+” and Recognised by UGC (2f &12B)
KOMARAPALAYAM - 637303
20IT303 - OPERATING SYSTEMS – QUESTION BANK
Regulation 2020
DEPARTMENT OF INFORMATION TECHNOLOGY
UNIT 2 - PROCESS MANAGEMENT
PART A (2 Marks)
Q.No Questions CO BL
1 Draw the process state diagram. CO2 R
2 Differentiate process and program. CO2 U
3 List out the data fields associated with process control blocks. CO2 R
4 What is context switch? CO2 R
Consider the following set of processes, the length of the CPU burst time
given in milliseconds :
Process Burst Time Arrival time
P1 6 3
5 P2 8 0 CO2 AP
P3 7 2
P4 3 1
Assuming the above process being scheduled with the pre-emptive SJF
scheduling algorithm. Find the waiting time of Process P1.
6 Compare user threads and kernel threads. CO2 U
7 What are the different ways in which a thread can be cancelled? CO2 R
8 Distinguish between preemptive and non-preemptive Scheduling. CO2 U
9 Define IPC. CO2 R
10 What are the various scheduling criteria for CPU scheduling? CO2 R
11 What is a thread? CO2 R
12 Define the term ‘Dispatch Latency” CO2 R
13 What is the problem with FCFS CPU scheduling algorithm CO2 R
14 What are the benefits of co-operating process? CO2 R
15 What are the benefits of multithreaded programming? CO2 R
16 What is the use of fork and exec system calls? CO2 R
17 Define throughput? CO2 R
18 Write the four situations under which CPU scheduling decisions take place CO2 U
19 What are the 3 different types of scheduling queues? CO2 R
20 What is cooperating process? CO2 R
PART- B (16 Marks)
(Autonomous)
Approved by AICTE, New Delhi & Affiliated to Anna University, Chennai
Accredited by NBA, NAAC with “A+” and Recognised by UGC (2f &12B)
KOMARAPALAYAM - 637303
20IT303 - OPERATING SYSTEMS – QUESTION BANK
Regulation 2020
DEPARTMENT OF INFORMATION TECHNOLOGY
UNIT 2 - PROCESS MANAGEMENT
PART A (2 Marks)
Q.No Questions CO BL
1 Draw the process state diagram. CO2 R
2 Differentiate process and program. CO2 U
3 List out the data fields associated with process control blocks. CO2 R
4 What is context switch? CO2 R
Consider the following set of processes, the length of the CPU burst time
given in milliseconds :
Process Burst Time Arrival time
P1 6 3
5 P2 8 0 CO2 AP
P3 7 2
P4 3 1
Assuming the above process being scheduled with the pre-emptive SJF
scheduling algorithm. Find the waiting time of Process P1.
6 Compare user threads and kernel threads. CO2 U
7 What are the different ways in which a thread can be cancelled? CO2 R
8 Distinguish between preemptive and non-preemptive Scheduling. CO2 U
9 Define IPC. CO2 R
10 What are the various scheduling criteria for CPU scheduling? CO2 R
11 What is a thread? CO2 R
12 Define the term ‘Dispatch Latency” CO2 R
13 What is the problem with FCFS CPU scheduling algorithm CO2 R
14 What are the benefits of co-operating process? CO2 R
15 What are the benefits of multithreaded programming? CO2 R
16 What is the use of fork and exec system calls? CO2 R
17 Define throughput? CO2 R
18 Write the four situations under which CPU scheduling decisions take place CO2 U
19 What are the 3 different types of scheduling queues? CO2 R
20 What is cooperating process? CO2 R
PART- B (16 Marks)
