Pradeep Sir(MSc(Physics) , MCA , LL.

B , NTA-NET Qualified) 8750007378

OPERATING SYSTEM

1. Which of the following feature will characterize operating system as multiprogramming operating system?
i. More than one program may be loaded into main memory at the same time.
ii. If program waits for certain events another program is immediately scheduled.
iii. If the execution of program terminates another program is immediately scheduled.
a. Only I b. I and ii only c. I and iii only d. all of the above
2. What is the minimum and maximum number of process that can be in the ready , run and blocked state is total number
of process is n
a. Min(1,0,1) and max(1 , n-1 , n)
b. Min(2,1,1) and max(n , n-1 , n)
c. Min(0,0,0) and max(n-1,1 , n)
d. Min(0,0,0) and max(n-1 , n,1)
3. In the following state process diagram for a uniprocessor system assume there are some process are always present in
ready state. Now consider the following statements and find which statement(S) are true
i. If a process make a transition D it would result into another process making transition A immediately.
ii. A process P2 in blocked state can make transition E while another process P1 is in running state.
iii. The OS uses preemptive
scheduling.
iv. The OS uses non preemptive
scheduling.
a. I and ii
b. I and iii
c. Ii and iii
d. Ii and iv

4. The process state transition diagram of an operating system is given below. Which of the following must be false about
above operating system?
a. It is a multiprogramming operating
system.
b. It uses preemptive scheduling.
c. It uses non preemptive scheduling.
d. It is a multi user operating system.
5. A computer handles several interrupt sources
such as
i. Interrupt from CPU temperature sensor (raises interrupt when temperature of CPU is too high)
ii. Interrupt from mouse(raises interrupt if the mouse is moved or button is pressed)
iii. Interrupt from keyboard( raises interrupt when a key is pressed or released)
iv. Interrupt from hard disk ( raises interrupt when the disk read is completed)
Which one of these will be handles at higher priority?
a. Interrupt from hard- disk b. interrupt from mouse c. interrupt from keyboard d. interrupt from CPU temperature
sensor.
6. Which scheduler is ultimate responsible to control degree of multiprogramming?
a. Short term scheduler b. Medium term scheduler c. Long term scheduler d. None
7. which of the scheduler is most frequently executed?
a. Short term scheduler b. Medium term scheduler c. Long term scheduler d. None
8. Consider the three process p1 , p2 and p3 shown below with their arrival time and burst time
 Process Arrival time Burst time
P1 0 5
P2 1 7
P3 2 4
if the FCFS algorithm is used as CPU scheduling then the average Turn around time will be:-

a. 10 b. 11 c. 12 d.13

9. Consider an arbitrary set of CPU bound process with unequal CPU burst length submitted at the same time to a computer
system. Which one of the following process scheduling algorithm would minimize the average waiting time in ready
queue.
a. Shortest Remaining time first.
b. Round-Robin with quantum less than shortest CPU burst.
c. Uniform Random
d. Highest priority first with priority proportional to CPU burst length.
10. For the process listed in following table , which of the following scheduling scheme will give the lowest average turn
around time?
a. First come first serve
b. Shortest job first
c. Shortest remaining time next
d. Round robin with quantum value 2.
11. Consider the following set of process with the arrival time and CPU burst time given in milliseconds. What is the average
turn around time for these process with the pre emptive shortest remaining processing time first algorithm?

a. 5.50 b. 5.75 c. 6.00 d. 6.25

12. Consider the following CPU process with arrival time in milliseconds and CPU burst time in milliseconds. If preemptive
shortest remaining time first algorithm is used then average waiting time in milliseconds will be

a. 4 b. 5 c. 2 d. 3
13. Consider the following set of process with the arrival time and CPU burst time given in milliseconds. What is the average
turn around time for these process with the pre emptive shortest remaining processing time first algorithm?

a. 3.2 b. 4.2 c. 5.2 d. 6.2

14. Consider three CPU intensive process which require 10 , 20 and 30 time units and arrive at time 0, 2 and 6. How many
context switch are nedded if the operating system impalements a shortest remaining time first scheduling algorithm. Do
not count context switch at the time zero and at the end.
a. 1 b. 2 c. 3 d. 4
15. Consider the set of process with arrival time(in milliseconds) , burst time(in milliseconds) and priority (0 is highest
priority) shown below. The average waiting time for all the process using preemptive priority scheduling algorithm is.

a. 29 b. 39 c. 49 d. 10
16.

17.

18. Which of the following statements are true?

i. Shortest remaining time first scheduling may cause starvation.
ii. Pre emptive scheduling may cause starvation.
iii. Round robin is better than FCFS in terms of Response time
a. I only b. 1 and 3 only c. 2 and 3 only d. 1 ,2 and 3
19.
 a. 900 b. 1000 c. 1100 d. 1200
20. Which scheduling policy is most suitable for time shared operating system?
a. Shortest job first b. Round Robin c. First come and first Serve d. Elevator
21. Consider n process sharing the CPU in a round-robin fashion. Assuming that each process switch takes s seconds , what
must be the quantum size q such that the overhead resulting from process switching is minimized but at the same time
each process is guaranteed to get its turn at the CPU at least every ‘t’ seconds (NET-Dec-2012)
a. Q<=(t-ns)/(n-1) b) q>=(t-ns)/n-1 c) q<=(t-ns)/(n+1) d) q>=(t-ns)/(n+1)
22. A Scheduling algorithm assign priority proportional to the waiting period of the process. Every process start with the
priority 0 (lowest priority) the scheduler revaluates the priority after every T seconds and decide the next process to
schedule. Which of the following is true if the process have no I/O operations and all arrive at time zero.
a. This algorithm is equivalent to First come first serve.
b. This algorithm is equivalent to Round Robin algorithm.
c. This algorithm is equivalent to Shortest job first.
d. This algorithm is equivalent to shortest remaining time first.
23.

24. Consider three processes (process id 0, 1, 2 respectively) with compute time bursts 2, 4 and 8 time units. All processes arrive
at time zero. Consider the longest remaining time first (LRTF) scheduling algorithm. In LRTF ties are broken by giving priority
to the process with the lowest process id. The average turn around time is:
a. 13 units
b. 14 units
c. 15 units
d. 16 units
25. Which of the following process scheduling algorithm may lead to starvation
a. FIFO
b. Round Robin
c. Shortest Job Next
d. None of the above
26. If the quantum time of round robin algorithm is very large, then it is equivalent to:
a. First in first out
b. Shortest Job Next
c. Lottery scheduling
d. None of the above
27. The most optimal scheduling algorithm is :
a. First come first serve (FCFS)
b. Shortest Job First (SJF)
c. Round Robin (RR)
d. None of the above
28. Consider a set of n tasks with known runtimes r1, r2, .... rn to be run on a uniprocessor machine. Which of the following
processor scheduling algorithms will result in the maximum throughput?
a. Round-Robin
b. Shortest-Job-First
c. Highest-Response-Ratio-Next
d. First-Come-First-Served
29. The maximum number of processes that can be in Ready state for a computer system with n CPUs is
a. N
b. n2
c. 2n
d. Independent of n
 30. When an interrupt occurs, an operating system
a. ignores the interrupt
b. always changes state of interrupted process to \'blocked\' and schedules another process
c. always resumes execution of interrupted process after processing the interrupt
d. may change the state of interrupted process to \'blocked\'and schedule another process.
31. Consider the following CPU processes with arrival times (in milliseconds) and length of CPU bursts (in milliseconds) except
for process P4 as given below:
Process Arrival Time Burst Time
P1 0 5
P2 1 1
P3 3 3
P4 4 x
If the average waiting time across all processes is 2 milliseconds and pre-emptive shortest remaining time first scheduling algorithm
is used to schedule the processes, then find the value of x ?
a. 1
b. 2
c. 4
d. None of these
32. Which module gives control of the CPU to the process selected by the short - term schedular ?
a. Dispatcher
b. Interrupt
c. Schedular
d. Threading
33. Which of the following statement is true?
a. Hard real time OS has less jitter than soft real time OS
b. Hard real time OS has more jitter than soft real time OS
c. Hard real time OS has equal jitter as soft real time OS
d. None of the above.
34. Which of the following is not an optimization criterion in the design of a CPU scheduling algorithm?
a. Minimum CPU utilization
b. Maximum throughput
c. Minimum turnaround time
d. Minimum waiting time
35. Consider the following three processes with the arrival time and CPU burst time given in milliseconds:
Process Arrival Time Burst Time
P1 0 7
P2 1 4
P3 2 8
The Gantt Chart for preemptive SJF scheduling algorithm is _________.
a.

b.

c.
d.

36. In which of the following scheduling criteria, context switching will never take place ?
a. ROUND ROBIN
b. Preemptive SJF
c. Non-preemptive SJF
d. Preemptive priority
37. Consider the following set of processes, assumed to have arrived at time 0. Consider the CPU scheduling algorithms Shortest
Job First (SJF) and Round Robin (RR). For RR, assume that the processes are scheduled in the order P1, P2, P3, P4. If the time
quantum for RR is 4 ms, then the absolute value of the difference between the average turnaround times (in ms) of SJF and
RR (round off to 2 decimal places) is _________

a. 5.0
b. 5.25
c. 5.50
d. 5.75

38. In processor management round robin method essentially uses the preemptive version of _______________
a. FILO b. FIFO c. SJF d. LTF
39. Which is the correct definition of valid process transition in an operating system
a. Wake up  Ready to Running
b. Dispatch  Ready to running
c. Block  Ready to Running
d. Timer Run out  Ready to Blocked
40. Consider the following set of process and the length of CPU burst time given in milliseconds. Assume that all process
arrive at time 0 and round robin with time slice 4 is used for CPU scheduling then the waiting time for the process p4
would be

a. 0 b. 4 c. 12 d. 6
41. A software program which creates a job queue is called
a. Linkage editor b. interpreter c. Drive d. Spooler
42. Loading operating system from secondary memory to primary memory is called ___________
a. Compiling b. Booting c. Refreshing d. Reassembling
43.
Answers

1.(b) 2.(c) 3.(c) 4.(b) 5.(d) 6.(c) 7.(a) 8.(a) 9.(a) 10.(c) 11.(a) 12.(d) 13.(d) 14.(b) 15.(a) 16.(c)

17.(c) 18.(d) 19.(b) 20.(b) 21.(a) 22.(b) 23.(b) 24.(a) 25.(c) 26.(a) 27.(d) 28.(c) 29.(d) 30.(d) 31.b)

32. (a) 33.(a) 34.(a) 35. (b) 36.(c) 37.(b) 38.(b) 39.(b) 40.(c) 41.(d) 42.(b)