1.
Which
of the following is not a CPU scheduling algorithm?
1) SCAN
2) SJF
3) FCFS
4) Round robin
Answer: 1
2.
Process
A has arrived in the system by time 0 and requires 5 time units in the CPU,
process B has arrived by time 1 and requires 3 time units, process C has
arrived by time 2 and requires 1 time unit. Assuming negligible processes
switching time, and that all processes are CPU bound and that a new quantum
starts whenever a process finishes, the average time for Round robin (Q=3) is
___________
1) 3.33
2) 2.33
3) 2.89
4) 4.67
Answer: 1
3.
Which
of the scheduling algo gives the minimum average waiting time for a given set
of processes?
1) FCFS
2) SJF
3) Round Robin
4) Priority
Answer: 2
4.
Forcible
removal of a resource from a process is possible through _____
1) Scheduling
2) Preemption
3) Dispatching
4) None
Answer: 2
5.
Which
of the following gives control of the CPU to the process selected by short term
scheduler?
1) Context switching
2) Thread
3) Interrupt
4) Dispatcher
Answer: 4
6.
Which
of the following is strictly preemptive?
1) FCFS
2) Priority
3) Round Robin
4) SJF
Answer: 3
7.
The
performance of round robin algorithm depends on
1)
Preemption
2) Time
Quantum
3) Non-preemption
4) Priority
Answer: 2
8.
The
following are the processes and their burst time: P1 : 6, P2 : 8 P3 : 7 P4 : 3.. The average
turn around time if SJF is used is ____mille seconds
1) 7
2) 13
3) 19
4) 7.6
Answer: 2
9.
The
major problem with priority scheduling algorithm is _________.
1) Indefinite
blocking
2) Takes large
turnaround time
3) Deadlock
occurs
4) All the
above
Answer: 2
10.
If
the time quantum is very big in round robin CPU scheduling algorithm, then it
acts as
1) SJF scheduling
2) FCFS
3) Priority
4) SJF with preemption
Answer: 2
11.
Medium
term scheduler is based on
1) Scroll in,
scroll out
2) Wrap in,
wrap out
3) Swap in,
swap out
4) Fetch in,
fetch out
Answer: 3
12.
In
which of the following context switching never takes place?
1) SJF
2) Round robin
3) Preemptive policy
4) None Answer: 1
13.
Round
robin scheduling algorithm is suitable for Time sharing systems.
True/ False
Answer: True
14.
To
maximize CPU utilization and throughput we should maximize turnaround time and
minimize waiting time.
True/ False?
Answer: False
Explanation: we should minimize turnaround
time and minimize waiting time.
15.
Round
robin scheduling is essentially the preemptive version of ________.
1) FIFO
2) Shortest job first
3) Shortest remaining
4) FCFS
Answer: 1
No comments:
Post a Comment
Thank you for using this blog.