1.
In
priority scheduling (CPU scheduling)
Process Burst time Priority Arrival time
P1 10 3 0
P2 1 1 2
P3 2 4 4
P4 1 5 3
P5 5 2 1 The first process to get executed is____
1) P1
2) P2
3) P3
4) P4
Answer: 2
2.
In
priority scheduling (CPU scheduling)
Process Burst time Priority Arrival time
P1 10 3 0
P2 1 1 2
P3 2 4 4
P4 1 5 3
P5 5 2 1 The waiting time is_____.
1) 4.8 sec
2) 5.8 sec
3) 6.8 sec
4) 5 sec
Answer: 3
3.
In
priority scheduling (CPU scheduling)
Process Burst time Priority Arrival time
P1 10 3 0
P2 1 1 2
P3 2 4 4
P4 1 5 3
P5 5 2 1 The response time is________
1)
3.4
sec
2)
4.4
sec
3)
5.4
sec
4)
6.4
sec
Answer: 3
4.
In
round robin scheduling ( CPU scheduling) ,time quantum=4 milli secs Process
Burst time Arrival time
P1 24 0
P2 3 0
P3 3 0 The first process which will get executed is_______
1) P1
2) P2
3) P3
4) P2 and P3
Answer: 2
5.
In
round robin scheduling ( CPU scheduling) , time quantum=4 millisecs Process
Burst time Arrival time
P1 24 0
P2 3 0
P3 3 0 The process which will get executed at last _______
1) P1
2) P2
3) P3
4) P2 and P3
Answer: 1
6.
In
round robin scheduling ( CPU scheduling) , time quantum=4 millisecs Process
Burst time Arrival time
P1 24 0
P2 3 0
P3 3 0
The waiting time for the given problem
is_____.
1) 4 sec
2) 5 sec
3) 6 sec
4) 7 sec
Answer: 2
7.
In
round robin scheduling ( CPU scheduling), time quantum=4 millisecs Process Burst time Arrival time
P1 24 0
P2 3 0
P3 3 0 The turn around time for the given problem is_______.
1) 12 sec
2) 13 sec
3) 14 sec
4) 15sec
Answer: 4
8.
In
round robin scheduling ( CPU scheduling) , time quantum=4 millisecs Process
Burst time Arrival time
P1 24 0
P2 3 0
P3 3 0 The response time for the given problem is _______.
1)1 sec
2) 2 sec
3) 3 sec
4) 4 sec
Answer: 3
9.
In
round robin scheduling ( CPU scheduling) , time quantum=4 millisecs Process
Burst time Arrival time
P1 24 0
P2 3 0
P3 3 0 The process which will complete the last _______
1) P1
2) P2
3) P3
4) P4
Answer: 2
10.
In
round robin scheduling ( CPU scheduling), time quantum=4 millisecs Process Burst time Arrival time
P1 24 0
P2 3 0
P3 3 0 All the processes will get executed _______
1) At the starting of 24th sec
2) At the ending of 24th sec
3) At the ending of 25th sec
4) At the ending of 23rd sec
Answer: 2
11.
In
SJF algorithm for CPU scheduling Process
Burst Time Arrival time
P1 6 1
P2 8 2
P3 7 3
P4 3 4 The first process which will complete its execution _______
1)
P1
2)
P2
3)
P3
4) P4
Answer: 1
12.
____
is the state of processor, when a process is waiting for some event to occur.
1) ready state
2) wait state
3) dead state
4) None
Answer: 2
13.
Which
of the following are Scheduling algorithms:
1) multi level queue
2) shortest job first
3) Least recently used
4) both 1 and 2
Answer: 4
14.
_________
systems are required to complete a critical task within a guaranteed amount of
time.
1) Real time
2) Networking systems
3) Distributed systems
4) None of above
Answer: 1
15.
The
following are the criteria for CPU scheduling algorithm evaluation
1) Maximum CPU utilization under the constraint that maximum response
time is one second
2) Maximum throughput such that turnaround time is (on an average)
linearly proportional to total execution time.
3) Both
4) None
Answer: 3
No comments:
Post a Comment
Thank you for using this blog.