Documente Academic
Documente Profesional
Documente Cultură
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#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#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#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#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#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#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#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#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?
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.
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