Q1: What is the solution to starvation?

● The number of rollbacks must be included in the cost factor Correct

● Resources must be included in resource preemption
● Preemption of resources instead
● All of the above
Explanation: It is necessary to include the number of rollbacks in the cost factor for
preventing starvation.

Q2: For _______ to reach a safe state, it must keep more information about the
state of processes.

● The process should be aborted

● Rollback the process Correct
● The process should be queued
● None of the mentioned
Explanation: To avoid deadlocks, it must have additional information about things such
as printers and tape drives where one process will have exclusive access to them. It is
safe for a state to exist when a safe sequence of events has been established.

Q3: When there is an edge between processes Pi and Pj in a wait-for graph, we

can conclude that

● Pi is waiting for Pj to release a resource that Pi needs Correct

● Pj is waiting for Pi to release a resource that Pj needs
● Pi is waiting for Pj to leave the system
● Pj is waiting for Pi to leave the system
Explanation: When the arc from Pi to Pj is present in a wait-for graph, that means
process Pi is waiting for a resource that process Pj is currently holding.

Q4: m’ processes share ‘n’ resources of the same type. The maximum need of
each process doesn’t exceed ‘n’ and the sum of all their maximum needs is always
less than m+n. In this setup, deadlock ____________

● Cannot never occur Correct

● May occur
● Has to occur
● None of the mentioned
Explanation: A maximum need is always less than m + n. To be considered deadlocked,
the resources available for each of 'm' processes must be one less than the maximum
requirement for that process => the total amount of resources to be available must be
less than the sum of m + n - m = n.

Q5: A computer has six tape drives, with n processes competing for them. Each
process may need two drives. What is the maximum value of n for the system to
be deadlock-free?

● 6
● 5 Correct
● 4
● 3
Explanation: In the case when we gave 1 drive to 1 process then our total processes
would be 6, but in this case, deadlock would occur as every process would hold one
drive and would await another drive which would be held by another process, so when
we reduced 1 process our system would be deadlock-free.As a result, n is maximum at 6
minus 1.

Q6: A system has 3 processes sharing 4 resources. If each process needs a

maximum of 2 units then, deadlock ____________

● can never occur Corect

● may occur
● has to occur
● none of the mentioned
Explanation: A condition for deadlock can not occur: P(n-1) + 1 <= R where, P = number
of processes ; n = max requirement of each process ; R = Total number of available
resources So, if a system has 3 processes sharing 4 resources and each process needs
a maximum of 2 units then: P = 3, n = 2 and R = 4 =3(2-1) + 1 <= 4, deadlock can never
occur.

Q7: Every time a request for allocation cannot be granted immediately, the
detection algorithm is invoked. This will help identify ____________

● The set of processes that have been deadlocked Correct

● the set of processes in the deadlock queue
 ● the specific process that caused the deadlock
● all of the mentioned
Explanation: A request that cannot be granted immediately must go through a process in
which... Currently, every process in the set is waiting for the resource which is allocated
to... preventing or avoiding deadlock - don't let the system get stuck. Recovering from
deadlocks.

Q8: What does multithreaded programming entail?

● lesser prone to deadlocks

● More prone to deadlocks Correct
● not at all prone to deadlocks
● none of the mentioned
Explanation: When multithreading occurs, more than one set of sequential instructions
(thread) are executed simultaneously. A multithreaded program executes multiple
threads simultaneously. Several of these threads can be run on one processor. On a
multiprocessor system, multiple threads may run at once.

Q9: The entry of all the PCBs of the current processes is in __________

● Process Register
● Program Counter
● Process Table Correct
● Process Unit

Explanation: The Process Table contains information about all PCBs involved in the
current processes. Process Table contains information about all processes created by
OS along with their PIDs.

Q10: What is the degree of multiprogramming?

● the number of processes executed per unit time

● the number of processes in the ready queue
● the number of processes in the I/O queue
● the number of processes in memory Correct
 Explanation: Multiprogramming refers to the number of processes in the ready state.
As one of the most important capabilities of OS, Multiprogramming is used to
maximize CPU utilization. In general, a single process cannot use all CPU or I/O
resources at the same time. One process may use CPU if it is available, and another
may use I/O if it is available. CPU utilization is increased by doing this.

Q11: When a single thread of control is active, the process is able to _______

● only one task at a time Correct

● multiple tasks at a time
● only two tasks at a time
● all of the mentioned

Explanation: A single thread of control allows the process to perform only one task at a
time. In the case of multi-core, multiple threads can be run simultaneously and can
perform multiple tasks at a time.

Q12: What is the objective of multiprogramming?

● Have a process running at all time

● Have multiple programs waiting in a queue ready to run
● To increase CPU utilization Correct
● None of the mentioned

Explanation: Multiprogramming aims to increase the utilization of the CPU. In general,

a single process cannot use all CPU or I/O resources at the same time. One process
may use CPU if it is available, and another may use I/O if it is available.

Q13: Which part of a Process Control Block (PCB) is not present?

● Code
● Stack
● Bootstrap program Correct
● Data
 Explanation:Process Control Blocks (PCBs) are memory blocks that contain
information about processes, such as Process State, Program Counter, CPU Register,
etc. Task Control Block is another name for Process Control Block. A bootstrap
program is a program that runs when a computer or system is booted or rebooted.

Q14: A process' state is defined by

● the final activity of the process

● the activity just executed by the process
● the activity to next be executed by the process
● the current activity of the process Correct

Explanation: The state of a process is defined by its active state. During execution, the
state of the process can change. As far as the state of the process is concerned, it is
New, Ready, Running, Wait, Terminated.

Q15: In an operating system, each process is assigned its operating system calls

● address space and global variables

● open files
● pending alarms, signals, and signal handlers
● all of the mentioned Correct

Explanation: Operating systems have address spaces for code, data, stack and heap
segments, or sections, which are unique to each process. The processes also come
with a list of opened files, alarms, and signal handlers.

Q16: An instruction's address to be executed by the current process can be

obtained from the current process's __________

● CPU registers
● Program counter Correct
● Process stack
● Pipe
 Explanation:By reading the Program Counter, we can find out what instructions are to
be executed by the process next. Every instruction is accompanied by an increment in
the Program Counter - the address of the following instruction. A program counter
indicates the address where the CPU should fetch instructions from.

Q17: How many processes does an operating system have?

● address space and global variables

● open files
● pending alarms, signals, and signal handlers
● all of the mentioned Correct

Explanation:According to Operating Systems, each process has an address space that

consists of code, data, stack segments, and heap segments. Also included in each
process's database correct are the files and various signal handlers opened by it,
along with any pending alarms and signals.

Q18: Processes can be terminated for a variety of reasons?

● normal exit
● fatal error
● killed by another process
● all of the mentioned Correct

Explanation: Processes can be killed naturally when they complete their tasks; in
addition, they can also be killed by another process, or by force. As soon as the task is
completed without any errors, the process will exit normally. It may terminate
abnormally if an error occurs while it is running. Another process can kill or terminate
the process forcefully.

Q19: When are a group of processes in a deadlock?

● each process is blocked and will remain so forever Correct

● each process is terminated
 ● all processes are trying to kill each other
● none of the mentioned

Explanation: This is caused by the fact that process A is waiting for one resource and
holding another (blocking resource). During the same time, another process B is
requesting blocking a resource, which is already being held by another process A.
Process B waits until the occupied resource is released by process A.

Q20: An instruction's address to be executed by the current process can be

obtained from the current process's __________

● CPU registers
● Program counter CORRECT
● Process stack
● Pipe

Explanation: Using the Program Counter, a process can determine precisely what
instruction the next process of the current process will execute. In the Program Counter,
every time an instruction has executed the address of the subsequent instruction is
incremented by CPU fetches and executes instructions at the address specified by the
Program Counter.

Q21:In which of the following scheduling algorithm new processes are added to
the tail of the ready queue. The CPU scheduler picks the first process from the
ready queue, sets a timer to interrupt after 1 time quantum, and dispatches the
process.

● Shortest-Job-First Scheduling
● Priority Scheduling
● First-Come, First-Served Scheduling
● Round-Robin Scheduling

Explanation : A small unit of time, called a time quantum or time slice, is defined. A
time quantum is generally from 10 to 100 milliseconds in length.
Q22. Using Priority Scheduling algorithm, find the average waiting time for the
following set of processes given with their priorities in the order:

Process Brust Time Priority

P1 10 3

P2 1 1

P3 2 4

P4 1 5

P5 5 2

● 8 milliseconds
● 8.2 milliseconds
● 7.75 milliseconds
● 3 milliseconds

Explanation :

0 1 6 16 18 20

Avg. Waiting time – P1 + P2 + P3 + P4 + P5 = 6 + 0 + 16 + 18 + 1 = 41m.s.

41 / 5 = 8.2m.s.

Q23. Another measure is the time from the submission of a request until the first
response is produced. This measure is called______
 ● Throughput
● Waiting Time
● Turnaround time
● Response time

Explanation: it is the time it takes to start responding, not the time it takes to output the
response.

Q24. ______Is the sum of the periods spent waiting in the ready queue.

● Throughput

P2

P5

P1

P3

P4

● Waiting time
● Turnaround time
● Response time

Explanation: The CPU-scheduling algorithm does not affect the amount of time during
which a process executes or does I/O. It affects only the amount of time that a process
spends waiting in the ready queue. Waiting time is the sum of the periods spent
waiting in the ready queue.

Q25. Which one of the following can not be scheduled by the kernel?

● kernel level thread

● user level thread
● process
 ● none of the mentioned

Explanation: User level threads are managed by thread library and the kernel is
unaware of them.

Q26. In Priority Scheduling Equal-priority processes are scheduled in ____ order

● LIFO -Last In Fist Out

● FCFS - First Come First Served
● SJF - Shortest job First
● LILO -Last in Last Out

Explanation : The processes with higher priority should be carried out first, whereas jobs
with equal priorities are carried out on a round-robin or FCFS basis. Priority depends
upon memory requirements, time requirements, etc.

Q27. How many types of multiprocessors?

● 2
● 3
● 4
● 5

Explanation: There are mainly two types of multiprocessors i.e. symmetric and
asymmetric multiprocessors.

Q28. A multiprocessor operating system must take care of

● authorized data access and data protection

● unauthorized data access and data protection
● authorized data access
● data protection

Explanation: A multiprocessor operating system must take care of unauthorized data

access and data protection.
 Q29. In single processor systems, they only have _______ processor.

● Zero
● One
● Two
● multiple

Explanation: Most computer systems are single processor systems i.e they only have
one processor

Q30. Which multiprocessor system contains a master slave relationship?

● Symmetric Multiprocessors
● Singleton Multiprocessors
● Asymmetric Multiprocessors
● Both A and B

Explanation: Asymmetric multiprocessor system contains a master slave relationship.

Q31. Which of the following is not an optimization criterion in the design of a

CPU scheduling algorithm?

● Minimum CPU utilization

● Maximum throughput
● Minimum turnaround time
● Minimum waiting time

Explanation: Minimum CPU utilization is not an optimization criterion as various

optimization techniques and scheduling algorithms are used to bring the best CPU
performance.

Q32.A scheduling Algorithm assigns priority proportional to the waiting time of a

process. Every process starts with priority zero (lowest priority). The scheduler
reevaluates the process priority for every ‘T’ time units and decides next process
to be scheduled. If the process have no I/O operations and all arrive at time zero,
then the scheduler implements _________ criteria.

● Priority scheduling
● Round Robin Scheduling
● Shortest Job First
● FCFS

Explanation: A scheduling Algorithm assigns priority proportional to the waiting time of a

process. Every process starts with priority zero (lowest priority). The scheduler
reevaluates the process priority for every ‘T’ time units and decides next process to be
scheduled. If the process have no I/O operations and all arrive at time zero, then the
scheduler implements Round Robin Scheduling criteria.

Q33. In a system using single processor, a new process arrives at the rate of six
processes per minute and each such process requires seven seconds of service
time. What is the CPU utilization?

● 70%
● 30%
● 60%
● 64%

Explanation: Number of processes per minute = 6

Burst time of each process = 7 secs

CPU utilization time within a minute = 6*7 = 42 secs

% CPU utilization = useful time / total time * 100

 = (42/60) * 100

= 70%

Q34. Which of the following statements is true?

● Hard real time OS has less jitter than soft real time OS
● Hard real time OS has more jitter than soft real time OS
● Hard real time OS has equal jitter as soft real time OS
● None of the above

Explanation: Jitter is the variation / displacement between the signals or data being sent.
Hard real operating systems deal with more sensitive systems which require strict time
deadlines like engine control systems, satellite launching systems etc while soft real
operating systems do not require strict timing constraints and a bit delay is permissible,
like mobile phones, online database systems. So hard real operating systems require
minimised jitter.

Q35. 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
turnaround time is:

● 13 units
● 14 units
● 15 units
● 16 units

Explanation: Let the processes be p0, p1, and p2. These processes will be executed in
the following order.

p2 p1 p2 p1 p2 p0 p1 p2 p0 p1 p2
0 4 5 6 7 8 9 10 11 12 13 14

Turn around time of a process is the total time between submission of the process and
its completion.

Turn around time of p0 = 12 (12-0)

Turn around time of p1 = 13 (13-0)

Turn around time of p2 = 14 (14-0)

Average turn around time is (12+13+14)/3 = 13.

Q36. Consider three CPU intensive processes P1, P2, P3 which require 20, 10 and
30 units of time, arrive at times 1, 3 and 7 respectively. Suppose operating system
is implementing Shortest Remaining Time first (preemptive scheduling) algorithm,
then _____ context switches are required (suppose context switch at the
beginning of Ready queue and at the end of Ready queue are not counted).

● 3
● 2
● 4
● 5

Explanation:
There are 3 context switch.

So. option (A) is correct.

Q37. Which of the following is not an optimization criterion in the design of a CPU
scheduling algorithm?

● Minimum CPU utilization

● Maximum throughput
● Minimum turnaround time
● Minimum waiting time

Explanation: Minimum CPU utilization is not an optimization criterion as various

optimization techniques and scheduling algorithms are used to bring the best CPU
performance.

Q38. At a particular time of computation the value of a counting semaphore is

7.Then 20 P operations and 15 V operations were completed on this semaphore.
The resulting value of the semaphore is? (GATE 1987)
 ● 42
● 2
● 7
● 12

Explanation: P represents Wait and V represents Signal. P operation will decrease the
value by 1 every time and V operation will increase the value by 1 every time.

Q39. Consider three processes, all arriving at time zero, with a total execution time
of 10, 20, and 30 units, respectively. Each process spends the first 20% of
execution time doing I/O, the next 70% of time doing computation, and the last
10% of time doing I/O again. The operating system uses the shortest remaining
compute time first scheduling algorithm and schedules a new process either when
the running process gets blocked on I/O or when the running process finishes its
compute burst. Assume that all I/O operations can be overlapped as much as
possible. For what percentage of time does the CPU remain idle?

● 0%
● 10.6%
● 30.0%
● 89.4%

Explanation: Let three processes be p0, p1, and p2. Their execution time is 10, 20, and
30 respectively. p0 spends the first 2 time units in I/O, 7 units of CPU time, and finally 1
unit in I/O. p1 spends first 4 units in I/O, 14 units of CPU time and finally 2 units in I/O. p2
spends first 6 units in I/O, 21 units of CPU time and finally 3 units in I/O.

idle p0 p1 p2 idle

0 2 9 23 44 47

Total time spent = 47

Idle time = 2 + 3 = 5

Percentage of idle time = (5/47)*100 = 10.6 %

Q40. Consider three CPU-intensive processes, which require 10, 20, and 30-time
units and arrive at times 0, 2, and 6, respectively. How many context switches are
needed if the operating system implements the shortest remaining time first
scheduling algorithm? Do not count the context switches at time zero and at the
end.

● 1
● 2
● 3
● 4

Explanation: Let three processes be P0, P1, and P2 with arrival times 0, 2, and 6
respectively and CPU burst times 10, 20, and 30 respectively. At time 0, P0 is the only
available process so it runs. At time 2, P1 arrives, but P0 has the shortest remaining
time, so it continues. At time 6, P2 arrives, but P0 has the shortest remaining time, so it
continues. At time 10, P1 is scheduled as it is the shortest remaining time process. At
time 30, P2 is scheduled. Only two context switches are needed. P0 to P1 and P1 to P2.

Q41. Which of the following process scheduling algorithm may lead to starvation.

● FIFO
● Round Robin
● Shortest Job Next
● None of the above

Explanation: Shortest job next may lead to process starvation for processes that will
require a long time to complete if short processes are continually added.

Q42.If the quantum time of round robin algorithm is very large, then it is equivalent
to:

● First in first out

● Shortest Job Next
● Lottery scheduling
● None of the above
Explanation: If time quantum is very large, then scheduling happens according to FCFS.

Q43. Which of the following is FALSE about SJF (Shortest Job First Scheduling)?

S1: It causes minimum average waiting time

S2: It can cause starvation

● Only S1
● Only S2
● Both S1 and S2
● Neither S1 nor S2

Explanation:

1. Both SJF and Shortest Remaining time first algorithms may cause starvation.
Consider a situation when long process is there in ready queue and shorter processes
keep coming.

2. SJF is optimal in terms of average waiting time for a given set of processes, but
problems with SJF is how to know/predict time of next job

Q44. The most optimal scheduling algorithm is :

● First come first serve (FCFS)

● Shortest Job First (SJF)
● Round Robin (RR)
● None of the above

Explanation: For each specific problem, the efficient algorithms could be different ones.
Hence, the most optimal algorithm can’t be determined.

Q45. Consider the following snapshot of a system running n processes. Process i

is holding Xi instances of a resource R, 1 <= i <= n. currently, all instances of R are
occupied. Further, for all i, process i has placed a request for an additional Yi
instance while holding the Xi instances it already has. There are exactly two
processes p and q such that Yp = Yq = 0. Which one of the following can serve as
a necessary condition to guarantee that the system is not approaching a
deadlock?

● min (Xp, Xq) < max (Yk) where k != p and k != q

● Xp + Xq >= min (Yk) where k != p and k != q
● max (Xp, Xq) > 1
● min (Xp, Xq) > 1

Explanation: Since both p and q don’t need additional resources, they both can finish
and release Xp + Xq resources without asking for any additional resource. If the
resources released by p and q are sufficient for another process waiting for Yk
resources, then system is not approaching deadlock.

Q46. Consider an arbitrary set of CPU-bound processes with unequal CPU burst
lengths submitted at the same time to a computer system. Which one of the
following process scheduling algorithms would minimize the average waiting time
in the ready queue?

● Shortest remaining time first

● Round-robin with time quantum less than the shortest CPU burst
● Uniform random
● Highest priority first with priority proportional to CPU burst length

Explanation: Turnaround time is the total time taken by the process between starting and
the completion and waiting time is the time for which process is ready to run but not
executed by CPU scheduler. As we know, in all CPU Scheduling algorithms, shortest job
first is optimal i.ie. it gives minimum turn round time, minimum average waiting time and
high throughput and the most important thing is that shortest remaining time first is the
pre-emptive version of shortest job first. shortest remaining time first scheduling
algorithm may lead to starvation because If the short processes are added to the cpu
scheduler continuously then the currently running process will never be able to execute
as they will get pre-empted but here all the processes are arrived at same time so there
will be no issue such as starvation. So, the answer is Shortest remaining time first, which
is answer (A).

Q47. Which of the following disk strategies is likely to give the best throughput?

● Farthest cylinder next

● Nearest cylinder next
 ● First come first served
● Elevator algorithm

Explanation: Nearest cylinder next is also known as shortest seek time first and in this
algorithm many pages can be accessed in less amount of time. So throughput will be
high so this is optimal algorithm.

Option (B) is correct.

Q48. Which of the following scheduling algorithms may cause starvation ?

A. First-come-first-served
B. Round Robin
C. Priority
D. Shortest process next
E. Shortest remaining time first
● A, C and E
● C, D and E
● B, D and E
● B, C and D

Explanation:

1.In First Come First Serve(FCFS) if a process with a very large Burst Time
comes before other processes, the other process will have to wait for a long
time but it is clear that other process will definitely get their chance to execute,
so it will not suffer from starvation.

2.In Round Robin there is a fixed time quant and every process will get their
chance to be executed, so no starvation is here.

3.In Priority based scheduling if higher priority process keep on coming then
low priority process will suffer from starvation.

4.In Shortest Job First(SJF) if process with short process time keep on coming
continuously then process with higher burst time will do wait and suffer from
starvation.

5.In Shortest remaining time first(SRTF) process with shortest burst time will
execute first because of this process with high burst time may suffer from
starvation. So, option (C) is correct.
Q49.With round robin scheduling algorithm in a time shared system ____________

● using very large time slices converts it into First come First served scheduling
algorithm
● using very small time slices converts it into First come First served scheduling
algorithm
● using extremely small time slices increases performance
● using very small time slices converts it into Shortest Job First algorithm

Explanation: All the processes will be able to get completed

Q50.Complex scheduling algorithms ____________

● are very appropriate for very large computers

● use minimal resources
● use many resources
● all of the mentioned

Explanation: Large computers are overloaded with a greater number of Process

Q51. The FCFS algorithm is particularly troublesome for ____________

● time sharing systems

● multiprogramming systems
● multiprocessor systems
● operating systems

Explanation: In a time sharing system, each user needs to get a share of the Cup at
regular intervals.

Q52. An SJF algorithm is simply a priority algorithm where the priority is

____________

● the predicted next CPU burst

 ● the inverse of the predicted next CPU burst
● the current CPU burst
● anything the user wants

Explanation: The larger the CPU burst, the lower the priority.

Q53. What are Multithreaded programs?

● lesser prone to deadlocks

● more prone to deadlocks
● not at all prone to deadlocks
● none of the mentioned

Explanation: Multiple threads can compete for shared resources.

Q54. For Mutual exclusion to prevail in the system ____________

● at least one resource must be held in a non sharable mode

● the processor must be a uniprocessor rather than a multiprocessor
● there must be at least one resource in a sharable mode
● all of the mentioned

Explanation: If another process requests that resource (non – shareable resource), the
requesting process must be delayed until the resource has been released.

Q55.For non sharable resources like a printer, mutual exclusion ____________

● must exist
● must not exist
● may exist
● none of the mentioned

Explanation: A printer cannot be simultaneously shared by several processes.

Q56. For sharable resources, mutual exclusion ____________

 ● is required
● is not required
● may be or may not be required
● none of the mentioned

Explanation: They do not require mutually exclusive access, and hence cannot be
involved in a deadlock

Q57. To ensure that the hold and wait condition never occurs in the system, it
must be ensured that ____________

● whenever a resource is requested by a process, it is not holding any other

resources
● each process must request and be allocated all its resources before it begins its
execution
● a process can request resources only when it has none
● all of the mentioned

Explanation: c – A process may request some resources and use them. Before it can
can request any additional resources, however it must release all the resources that it is
currently allocated.

Q58. A deadlock avoidance algorithm dynamically examines the __________ to

ensure that a circular wait condition can never exist.

● resource allocation state

● system storage state
● operating system
● resources

Explanation: Resource allocation states are used to maintain the availability of the
already and current available resources.
Q59. What is CPU scheduling ?

● The CPU scheduling is the management of CPU resourses.

● CPU scheduling is basis of multi-programmed operating systems.
● The scheduling is responsible for multiplexing processes on the CPU.
● All of the above.

Q60. what is turnaround time ?

● The interval from the time of submission of a process to the time of

completion is the turnaround time.
● Turnaround time is the sum of the peroids spent waiting to get into
memory, waiting into the ready queue, executing on the CPU and doing
I/O.
● Both a and b.
● None of the above.

Q61. Which of the following process scheduling algorithm may lead to

starvation-

● FIFO
● Round robin
● Shortest job next
● None of the above

Explanation: Shortest job next may lead to process starvation for processes which will
require a long time to complete if short processes are continually added.

Q62. The maximum number of processes that can be in ready state for a computer
system with n CPUs is-
 ● n
● n^2
● 2n
● Independent of n

Explanation:The size of ready queue doesn’t depend on the number of processes. A

single processor system may have a large number of processes waiting in ready queue.

Q63. Which of the following is False about shortest time first scheduling ?

S1: it causes minimum average waiting time

S2: it can cause starvation

● only S1
● only S2
● both S1 and S2
● neither S1 nor S2

Explanation: 1. Both SJF and shortest Remaining time first algorithms may cause
starvation. Consider a situation when long process is there in ready
queue and shorter processes keep coming.

2. SJF is optimal in terms of average waiting time for a given set of processes, but
problems with SJF is how to know/predict time of next job.

Q64. Assume every process requires 3 seconds of sevice time in a system with
single processor. If new processes are arriving at the rate of 10 processes per
minute, then estimate the fraction of time CPU is busy in system?

● 20%
 ● 30%
● 50%
● 60%

Explanation:

10 processes → 1 min

1 process → 1/10 min = 6 sec (Arrival raye)

Each process → 3 sec service time 3/6 * 100 = 50% of the time the CPU is busy.

Q65. Which module gives control of the CPU to the process selected by the short
term scheduler?

● Dispatcher
● Interrupt
● scheduler
● None of the mentioned

Q66.The process that are residing in main memory and are ready and waiting to
execute are kept on a list called __________

● Job queue
● Ready queue
● Execution queue
● Process queue

Q67.The interval from the time of submission of a process to the time of

completion is termed as _________
 ● Waiting time
● Turn around time
● Response time
● Throughput

Q68. Which scheduling algorithm allocates the CPU first to the process that
requests the CPU first?

● First-come, first-served, scheduling

● Shortest job scheduling
● Priority scheduling
● None of the above

Q69. In priority scheduling algorithm _______ ?

● CPU is allocated to the process with highest priority

● CPU is allocated to the process with lowest priority
● Equal priority process can not be scheduled
● None of the above

Q70.In priority scheduling algorithm, when a process arrives at the ready queue,
its priority is compared with the priority of ______?

● All process
● Currently running process
● Parent process
● Init process

Q71. Which algorithm is defined in time quantum?

● Shortest job scheduling algorithm

● Round robin scheduling algorithm
● Priority scheduling algorithm
● Multi-level queue scheduling algorithm
Q72.Process are classified into different groups in ________

● Shortest job scheduling algorithm

● Round robin scheduling algorithm
● Priority scheduling algorithm
● Multi-level queue scheduling algorithm

Q73.In multilevel feedback scheduling algorithm ________?

● Is process can move to a different classified ready queue

● Classification or ready queue is permanent
● Process are not classified into groups
● None of above

Q75. Round robin scheduling falls under the category of ______?

● Non-preemptive scheduling
● Preemptive scheduling
● All of the above
● None of above

Q76. What is scheduling ?

● Allowing a job to use the processor

● Making proper use the processor
● All of the above
● None of above

Q77. Complex scheduling algorithm _____?

● Are very appropriate for very large computers

● Use minimal resources
 ● Use many resources
● All of above

Q78. Which of the following algorithms tends to minimize the process flow time?

● First come first served

● Shortest job first
● Earliest deadline first
● Longest job first