1.
FIFO
scheduling is ________.
1)
Preemptive
2) Non
Preemptive
3)
Deadline
4) Fair share
Answer: - 2
2.
Using
Priority Scheduling algorithm, find the average waiting time for the following
set of processes given with their priorities in the order: Process : Burst Time
: Priority respectively .
P1 : 10 : 3 ,
P2 : 1 : 1 ,
P3 : 2 : 4 ,
P4 : 1 : 5 ,
P5 : 5 : 2.
1) 8 ms
2) 8.2 ms
3) 7.75 ms
4) 3 ms
Answer: 2
3.
Which
of the following disk scheduling techniques has a drawback of starvation?
1) SCAN
2) SSTF
3) FCFS
4) LIFO
Answer:- 2
4.
Which
of the following is a criterion to evaluate a scheduling algorithm?
1)
CPU
Utilization: Keep CPU utilization as high as possible. 2
2)
Throughput:
number of processes completed per unit time.
3)
Waiting
Time: Amount of time spent ready to run but not running.
4)
All of the above
Answer: - 4
5.
Which
of these scheduling algorithms allows a process to move up and down between
queues?
1) Round robin
2) First-Come,
First-Served scheduling
3) Multilevel
feedback queue scheduling
4) Priority
scheduling
Answer:- 3
6.
If
a new process arrives with CPU burst time less than remaining CPU burst time of
current executing process, preempt. This scheduling algorithm is known as
____________.
1)
Shortest-Job-First
2)
Priority
3) FCFS
4) None of the
above
Answer :- 1
7.
Which
of these is not a part of the process scheduler?
1. Context
Switch
2. Long, medium and short term scheduler
3. Dispatcher
4. Program Control
Answer:- 4
8.
The ready list in an operating system contains
jobs ________.
1) waiting for
I/O
2) being
executed by the processor
3) waiting for
the processor to be allotted to them
4) waiting for input only
Answer:- ( 3)
9.
Round
robin scheduling ________.
1) Is quite
complex to implement
2) Allows
interactive tasks quicker access to the processor
3) Allows
processor bound tasks more time in the processor
4) Gives each
task the same chance at the processor
Answer: 4
10.
Which
of these scheduling algorithms allows a process to move up and down between
queues?
1) Round robin
2) First-Come,
First-Served scheduling
3) Multilevel
feedback queue scheduling
4) Priority
scheduling
Answer: - ( 3 )
11.
In
a process scheduling, the mechanism for scheduling and policy can be set by __
and________ respectively.
1) Kernel & user process
2) User Process & threads
3) Shell & Kernel
4) Kernel & Threads
Answer:- 1
12.
________
scheduler selects the jobs from the pool of jobs and loads into the ready
queue.
1) Long term
2) Short term
3) Medium term
4) None of the above
Answer: - 1
13.
Which
of the process scheduling algorithm do you expect to produce the smallest
average waiting time
1) SJF
2) FCFS
3) round-robin
4) All the above
Answer:1
14.
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 process which will
be executed at the last is_____
1) P5
2) P2
3) P3
4) P4
Answer: 4
15.
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 turn around time is _________
1) 9.6 sec
2) 10.6 sec
3) 11.6 sec
4) 12.6 sec
Answer: 2
No comments:
Post a Comment
Thank you for using this blog.