Process management
Questions
1.Explain the concept of multiprogramming.
2.What are the different process states? Explain the same in detail. Also provide details for the process states in UNIX.
3.What are the difference between the kernel mode and user mode.
4.What are the contents of Thread Control Block.
5.Write a note on user level and kernel level threads.
6.Difference between process and threads.
7.Explain the contents of PCB and also explain the significance of PCB.
8.What is the difference between a process and a thread? What are the contents of Thread Control Block. State the advantages and disadvantages of user level threads.
9.Make the comparison between modern UNIX kernel and the traditional UNIX kernel with neat diagram.
10.Draw and explain the process state transition diagram. Explain the structure of PCB.
11.What is PCB? Draw the schematic showing all fields of a PCB.
12.Explain in detail the steps involved in UNIX process creation
13.With the help of neat diagram explain the concept context switching.
14.Draw process state transition diagram and explain
15.What are the various types of scheduling? Explain in brief.
16.What is thread scheduling?
17.Describe in detail the differences between short-term, medium-term and long-term schedulers with the help of a neat diagram.
18.Explain the design issues for multiprocessor scheduling. State the 4 approaches for multiprocessor thread scheduling and process assignment.
19.List and explain 4 classes of real time scheduling.
20.Consider the following set of processes with the length of the CPU burst time given in milliseconds.
Process | Arrival Time | Burst Time | Priority |
P1 | 0 | 8 | 3 |
P2 | 1 | 1 | 1 |
P3 | 2 | 3 | 2 |
P4 | 3 | 2 | 3 |
P5 | 4 | 6 | 4 |
Draw the Gantt charts illustrating the execution of these processes using FCFS, SJF (pre-emptive and non pre-emptive), priority scheduling. Calculate turnaround time and waiting time for each process for all 5 scheduling algorithm.
21.Consider the following set of processes, with the length of the CPU burst time given in milliseconds.
Process | Arrival Time | Burst Time | Priority |
P1 | 0 | 7 | 3 |
P2 | 1 | 1 | 1 |
P3 | 2 | 3 | 2 |
P4 | 3 | 4 | 4 |
Draw the Gantt charts illustrating the execution of these processes using Round Robin (Time quantum=1ms), FCFS, SJF, priority (pre-emptive and non pre-emptive). Calculate turnaround time, waiting time.
22.State and explain the scheduling criteria for uniprocessor scheduling.
23.Describe in detail the difference between short-term, medium-term and long-term schedulers with the help of a neat diagram.
24.Explain the term granularity in multiprocessor scheduling. Briefly describe 5 different categories of synchronization granularity.
25.Compare FCFS, Round Robin and SJF (pre-emptive and non pre-emptive) on the basis of following characteristics :
(a)Selection function(b) Decision mode
(c)Response time(d) Effect on processes.
26.What is process? Explain process states with neat diagram.
27.List the information in process control block and explain it.
28.What is thread? Define user level thread and kernel level thread.
29.Explain the following functions with reference to c.
Pthread_creat()
Pthread)join()
Fork().