Sie sind auf Seite 1von 5

HW4

Q#1. The processes that are residing in main memory and are ready and
waiting to execute are kept on a list called
a) job queue
xxx b) ready queue
c) execution queue
d) process queue

Q#2. The interval from the time of submission of a process to the time of completion is
termed as
a) waiting time
xxx b) turnaround time
c) response time
d) throughput

Q#3. Time quantum is defined in


a) shortest job scheduling algorithm
b) round robin scheduling algorithm
xxx c) priority scheduling algorithm
d) multilevel queue scheduling algorithm

Q#4. Process are classified into different groups in


a) shortest job scheduling algorithm
b) round robin scheduling algorithm
c) priority scheduling algorithm
xxx d) multilevel queue scheduling algorithm

Q#5. In multilevel feedback scheduling algorithm


xxx a) a process can move to a different classified ready queue
b) classification of ready queue is permanent
c) processes are not classified into groups
d) none of the mentioned

Q#6) An I/O bound program will typically have :


a) a few very short CPU bursts
xxx b) many very short I/O bursts
c) many very short CPU bursts
d) a few very short I/O bursts

Q#7) Which of the following is not true?


a) Scheduling is done so as to increase CPU utilization
b) Scheduling is done so as to increase the throughput
xxx c) Scheduling is done so as to increase the duration of a specific amount of work
d) Scheduling is done so as to decrease the waiting time

Q#8) Waiting time is :


a) the total time in the blocked and waiting queues
xxx b) the total time spent in the ready queue
c) the total time spent in the running queue
d) the total time from the completion till the submission of a process

Q#9) Round robin scheduling falls under the category of :


a) Non preemptive scheduling
xxx b) Preemptive scheduling
c) None of these

Q#10) With round robin scheduling algorithm in a time shared system,


xxx a) using very large time slices converts it into First come First served scheduling
algorithm
b) using very small time slices converts it into First come First served scheduling
algorithm
c) using extremely small time slices increases performance
d) using very small time slices converts it into Shortest Job First algorithm

Q#11 The strategy of making processes that are logically runnable to be temporarily
suspended is called :
a) Non preemptive scheduling
xxx b) Preemptive scheduling
c) Shortest job first
d) First come First served

Q#12 There are 10 different processes running on a workstation. Idle processes are
waiting for an input event in the input queue. Busy processes are scheduled with the
Round-Robin timesharing method. Which out of the following quantum times is the best
value for small response times, if the processes have a short runtime, e.g. less than
10ms ?
xxx a) tQ = 15ms
b) tQ = 40ms
c) tQ = 45ms
d) tQ = 50ms

Q#13 Orders are processed in the sequence they arrive if _______ rule sequences the
jobs.
a) earliest due date
b) slack time remaining
xxx c) first come, first served
d) critical ratio

Q#14 Which of the following statements are true ?


I. Shortest remaining time first scheduling may cause starvation
II. Preemptive scheduling may cause starvation
III. Round robin is better than FCFS in terms of response time
a) I only
b) I and III only
c) II and III only
xxx d) I, II and III

Q#15 The real difficulty with SJF in short term scheduling is :


a) it is too good an algorithm
xxx b) knowing the length of the next CPU request
c) it is too complex to understand
d) None of these

Q#16 The FCFS algorithm is particularly troublesome for ____________.


xxx a) time sharing systems
b) multiprogramming systems
c) multiprocessor systems
d) Operating systems

Q#17 Consider the following set of processes, the length of the CPU burst time given
in milliseconds :
Process Burst time
P1 6
P2 8
P3 7
P4 3

Assuming the above process being scheduled with the SJF scheduling algorithm :
which of the following is not true?
a) The waiting time for process P1 is 3ms.
xxx b) The waiting time for process P2 is 15ms.
c) The waiting time for process P4 is 0ms.
d) The waiting time for process P3 is 9ms.

Q#18 Preemptive Shortest Job First scheduling is sometimes called :


a) Fast SJF scheduling
b) EDF scheduling Earliest Deadline First
c) HRRN scheduling Highest Response Ratio Next
xxx d) SRTN scheduling Shortest Remaining Time Next

Q#19 An SJF algorithm is simply a priority algorithm where the priority is :


a) the predicted next CPU burst
xxx b) the inverse of the predicted next CPU burst
c) the current CPU burst
d) anything the user wants

Q#20 "Aging" is : (choose two)


a) keeping track of cache contents
xxx b) A solution to the problem of indefinite blockage of lowpriority processes
c) keeping track of how many times a given page is referenced
xxx d) increasing the priority of jobs to ensure jobs can be done in a finite time
e) keeping track of what pages are currently residing in memory

Q#21 On Unix and Unix-like computer operating systems, a _____ process or defunct
process is a process that
has completed execution (via the exit system call) but still has an entry in the
process table:
it is a process in the "Terminated state".
a) Orphan
xxx b) Zombie
c) Body
d) Dead

Q#22 Which of the following scheduling algorithms gives minimum average waiting time ?
a) FCFS
xxx b) SJF
c) Round robin
d) Priority

Q#23 When the process issues an I/O request :


a) It is placed in an I/O queue
xxx b) It is placed in a waiting queue
c) It is placed in the ready queue
d) It is placed in the Job queue

Q#24 If all processes I/O bound, the ready queue will almost always be ______, and the
Short term Scheduler will have a ______ to do.
a) full,little
b) full,lot
xxx c) empty,little
d) empty,lot

Q#25 Which of the following is a correct description of the long-Term Scheduling?


a) Swapping in/out processes to optimize Multiprogramming.
xxx b) Decision on which programs are admitted to the system, controlling the
degree of Multiprogramming
(number of processes in memory) to provide satisfactory service to current set
of processes.
c) As a Dispatcher, it makes decision on which process to execute next.
d) Block or preempt current process due to Clock Interrupts, I/O Interrupts, System
Calls,
Signals (Semphores).
e) Decision as to which process pending I/O request shall be handled by the
available I/O Device.

Q#26 What is a short-term scheduler ?


a) It selects which process has to be brought into the ready queue
xxx b) It selects which process has to be executed next and allocates CPU
c) It selects which process to remove from memory by swapping
d) None of these

Q#27 In a time-sharing operating system, when the time slot given to a process is
completed, the process goes from the running state to the :
a) Blocked state
xxx b) Ready state
c) Suspended state
d) Terminated state

Q#28 In a multi-programming environment :


a) the processor executes more than one process at a time
b) the programs are developed by more than one person
xxx c) more than one process resides in the memory
d) a single user can execute many programs at the same time

Q#29 Suppose that a process is in "Blocked" state waiting for some I/O service.
When the service is completed, it goes to the :
a) Running state
xxx b) Ready state
c) Suspended state
d) Terminated state

Q#30 A parent process calling _____ system call will be suspended until children
processes terminate.
xxx a) wait
b) fork
c) exit
d) exec

Q#31 In UNIX, each process is identified by its :


xxx a) Process Control Block
b) Device Queue
c) Process Identifier
d) None of these

Q#32 In UNIX, the return value for the fork system call is _____ for the child process
and _____ for the parent process.
a) A Negative integer, Zero
b) Zero, A Negative integer
xxx c) Zero, A nonzero integer
d) A nonzero integer, Zero

Q#33 The child process can : (choose two)


xxx a) be a duplicate of the parent process
b) never be a duplicate of the parent process
xxx c) have another program loaded into it
d) never have another program loaded into it

Q#34: Sometimes it is advantageous to remove a process from memory (and from active
contention for the CPU) and thus reduce the degree of multiprogramming. Later, the
process can be
reintroduced into memory, and its execution can be continued where it left off.
Which scheduler uses this swapping scheme to improve the process mix and system
throughput?

xxx a) Medium-term scheduler


b) Long-term scheduler
c) Short-term scheduler
d) The CPU scheduler
e) The Job scheduler

Q#35 Which of the following is true of multilevel queue scheduling?


A) Processes can move between queues.
xxx B) Each queue has its own scheduling algorithm.
C) A queue cannot have absolute priority over lower-priority queues.
D) It is the most general CPU-scheduling algorithm.

Q#36 Which of the following statements is NOT true about the multilevel feedback queue
scheduling
A) It has better response time for large jobs than SJF
xxx B) Like SJF, the starvation is a possible problem.
C) The short interactive jobs tends to have shorter waiting time than batch jobs.
D) It is a combination of priority scheduling and round-robin scheduling with
different quantum

Q#37 Which of the following statements is NOT true about the multilevel feedback queue
scheduling.
A) If all jobs has very large CPU burst, then multilevel feedback queue scheduling
will work like FCFS but with better response time
B) If all jobs has very short CPU burst, then multilevel feedback queue scheduling
will become pure FCFS scheduling
xxx C) Like SJF, it relies on the good prediction of the next CPU bursts.
D) Short-time jobs has higher priority than long-time jobs, but both have good
response time.

Q#38: In Round-Robin scheduling, the average turnaround time can be improved, in


general, if time quantum is larger. For example, we are given three processes of 10
time units each. With a quantum of 1 time unit, the average turnaround time is x. With
a quantum of 5 time unit, the average turnaround time is y.If the time quantum is 10,
the average turnaround time drops to z.

a) x=30, y=25, z= 20
b) x=29, y=20, z= 15
c) x=30, y=25, z= 20
xxx d) x=29, y=25, z= 20

Q#39: Consider the following set of processes, the length of the CPU burst time given
in milliseconds :
Process Burst time
P1 6
P2 3
P3 1
P4 7

Assuming the above process being scheduled with the Round-Robin scheduling algorithm :
If the time quantum is 6 or more, then the average turnaround time is
a) 10
xxx b) 10.5
c) 11
d) 11.5
e) 12

Q#40: (Continue the above question).


Assuming the above process being scheduled with the Round-Robin scheduling algorithm :
which of the following is not true about the average turnaround time?
a) If the time quantum is 1, then the average turnaround time is 11
b) If the time quantum is 2, then the average turnaround time is 11.5;
c) If the time quantum is 3, then the average turnaround time is 10.75;
d) If the time quantum is 4, then the average turnaround time is 11.5;
xxx e) If the time quantum is 5, then the average turnaround time is 10.5;