Scribd
Upload
20 views

Python Unit4 (Original)

Python unit 5 notes

Uploaded by

vikasmanjunath58
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
20 views

Python Unit4 (Original)

Python unit 5 notes

Uploaded by

vikasmanjunath58
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

ASSIGNMENT-2

TWO-MARKS QUESTIONS

1. Differentiate Process and Program


2. List the objectives of scheduling
3. What is context switching?
4. What is starvation and aging?
5. Define CONVEY effect
6. What is dispatcher
7. What is co-operative and independent process
8. Explain the operations on a process

FOUR-MARKS QUESTIONS

1. What is process? Explain process state transition with neat diagram


2. Explain PCB and its contents
3. What is process scheduling? Explain process scheduling criteria
4. differentiate between pre-emptive and non-preemptive scheduling algoritm

EIGHT-MARKS QUESTIONS

1. What is scheduler? Explain different types of schedulers


2. Describe SJF and RR scheduling algorithm with advantages and disadvantages
3. Explain FCFS and Priority scheduling algorithm with advantages and disadvantages
4. Write a note on
a) Co-operating Process
b) Explain Inter-Process communication
5. Consider the following set of processes with the length of CPU burst time given in
millisecond
Process Burst Time Priority
P1 5 2
P2 3 4
P3 1 3
P4 2 1
P5 3 3

The processes are assumed to have arrived in the order P1,P2,P3,P4 and P5 all at time 0[zero]
a. Draw four Gantt chart illustrating the execution of these processes using FCFS, SJF,NON-
PREMTIVE PRIORITY and RR [ time slice=2 ms ]
Find the average Waiting Time, Turn Around Time, Response Time and also analyse which is
the best scheduling algorithm

6. Consider the following set of processes with the length of CPU burst time given in
millisecond
Process Burst Time Priority
P1 4 4
P2 5 4
P3 2 3
P4 1 1
P5 6 3
P6 3 5

The processes are assumed to have arrived in the order P1,P2,P3,P4 ,P5 and P6 all at time
0[zero]
a. Draw four Gantt chart illustrating the execution of these processes using FCFS, SJF,
NON-PREMTIVE PRIORITY and RR [ time slice=3ms ]
b. Find the average Waiting Time, Turn Around Time, Response Time and also analyse
which is the best scheduling algorithm

7. Consider the following set of processes with the length of CPU burst time given in
millisecond
Process Arrival Time Burst Time
P1 5 5
P2 4 6
P3 3 7
P4 1 9
P5 2 2
P6 3 3

The processes are assumed to have arrived in the order P1,P2,P3,P4,P5 and P6
A )Draw four Gantt chart illustrating the execution of these processes using SJF PREEMPTIVE
and NON-PREMTIVE
Find the average Waiting Time, Turn Around Time, Response Time and also analyse which is
the best scheduling algorithm
8. Consider the following set of processes with the length of CPU burst time given in
millisecond
Process Burst Time Priority
P1 10 3
P2 4 6
P3 2 2
P4 5 2
P5 3 1

The processes are assumed to have arrived in the order P1,P2,P3,P4 and P5 all at time 0[zero]
a. Draw four Gantt chart illustrating the execution of these processes using FCFS,SJF,NON-
PREEMPTIVE PRIORITY
b. Find the average Waiting Time, Turn Around Time, Response Time and also analyse
which is the best scheduling algorithm

You might also like