1. Which one of the following is
Little’s formula Where ‘n’ is the average queue length, ‘W’ is the time that a
process waits
1)n=Lambda*W
2)n=Lambda/W
3)n=Lambda^W
4)n=Lambda*(W-n)
Answer:1
2. A CPU scheduling algorithm determines
an order for the execution of its scheduled processes. Given ‘n’ processes to
be scheduled on one processor, how many possible different schedules are there?
1) n!
2)
n*n
3) 1
4) log n
Answer:
1
3. CPU scheduling is the basis of ———–
operating systems
1) Batch operating systems
2) Real time OS
3) Multiprogramming
4) Mono programming
Answer:3
4. The SJF algorithm
1) executes first the job that last
entered the queue
2) executes first the job that first
entered the queue
3) executes first the job with the
least processor needs
4) executes first the job that has
been in the queue already
Answer:3
5. Which scheduling policy is most
suitable for a time shared operating systems?
1) SJF
2) RR
3) FCFS
4) Elevator Answer:2
6. Scheduling is
1) allowing job to use the processor
2) unrelated to performance conditions
3) quite simple to implement, even on large frames
4) the same regardless of the purpose of the system
Answer:1
7. Context Switching is
1) Part of spooling
2) part of polling
3) part of interrupt handling
4) part of interrupt servicing
Answer:
3
8. The dispatcher
1) actually schedules the task to the
processor
2) is always very small
3) is never used on large
components
4) should be used only on large
computers
Answer: 1
9. Race condition results for the following
1) all processes
2) co-operating processes
3) competing processes
4) none
Answer:3
10. Scheduling is ________
1) allows processor to use the
jobs
2) Not required in uni processor
system
3) Allowing jobs to use the
processor
4) None.
Answer: 1
11.
In
which of the following scheduling schemes does context switching never take
place.
1) Round robin
2) SJF
3) FCFS
4) Priority
Answer: 3
12.
In multilevel queue scheduling (CPU
scheduling) arrange the following in the order lowest to highest priority.
a) Interactive process b) Batch process
c) System process d) Student
process
1) a, b, c, d
2) d, c, b, a
3) c, a, b, d
4) c, b, a, d
Answer: 3
13.
Belady’s
Anomaly is present in _________
1)LIFO
2)FIFO
3) FCFS
4)SJF
Answer:2
14.
FCFS
scheduling is the simplest algorithm, but it can cause short process to wait
for very long processes.
True/False
Answer: True
15.
In
which of the following scheduling schemes does context switching take place.
1) SJF
2) FCFS
3) Priority
4) both 1 and 3
Answer: 4
No comments:
Post a Comment
Thank you for using this blog.