Department of Computer Engineering

Question Bank for IA-1 (2020-2021)-EVEN SEM

Date: 10/3/2021 Semester: IV

Name of the Subject: Operating System Timings: 11am to 11:30am

Question No. Question Module

To access the services of operating system, the interface is 1
provided by the
System calls
Q.1
Device drivers
Library routines
Assembly instructions
A program which interacts with the inner part of kernel is 1
known as ____________.
Compiler
Q.2
Device Driver
Protocol
Shell
Which of the following is not advantage of 1
multiprogramming?
Increased throughput
Q.3
Shorter response time
Decreased operating system overhead
Ability to assign priorities to jobs
Which technique was introduced because a single job could 1
not keep both the CPU and the I/O devices busy?
Time-sharing
Q.4
Spooling
Preemptive scheduling
Multiprogramming
A __________ is a software that manages the time of a 1
microprocessor to ensure that all time critical events are
processed as efficiently as possible. This software allows the
system activities to be divided into multiple independent
Q.5 elements called tasks.
Kernel
Shell
Processor
Device Driver
The primary job of the operating system of a computer is to 1
Q.6 ________.
Command Resources
 Manage Resources
Provide Utilities
Be user friendly
Multiprocessing ________. 1
Make the operating system simpler
Q.7 Allows multiple processes to run simultaneously
Is completely understood by all major computer vendors
Allows the same computer to have the multiple processors
Which of the following is false? 1
Monolithic kernel has direct communication with all the
modules.
Q.8
Monolithic kernel is faster than Microkernel
Microkernel is faster than Monolithic kernel
Monolithic kernel is more crashable than Microkernel
The main function of the command interpreter is 1
to get and execute the next user-specified command
to provide the interface between the API and application
Q.9
program
to handle the files in operating system
to provide services of the Operating system
............ is a large kernel, including scheduling file system, 1
networking, device drivers, memory management and more.
Monolithic kernel
Q.10
Micro kernel
Macro kernel
Mini kernel
An Operating System that has a resident monitor that groups 1
similar jobs for execution is called ___________
Batch OS
Q.11
Timesharing OS
Multiprogramming OS
Multiuser OS
Which of the following is not an objective of an Operating 1
system?
Convenience
Q.12
Efficiency
Program execution
Ability to evolve
Process Control Block (PCB) consists of the following 2
Process-id
Q.13 Process state
CPU Registers
All of the above
S1: Time taken to switch between 2 user level processes is always 2
Q.14
faster than switching from user process to kernel process.
 S2 : Time taken to switch between threads is always faster than
process switch.
Both statements are true
None of the statements are true
S1 is true but S2 is false
S1 is false but S2 is true.
Consider 3 processes P1, P2 and P3 arriving time instants 4, 6, 2 2
respectively. Their burst time is 7 units, 5 units and 6 units.
Assuming shortest job first scheduling (non-preemptive), the
process P3 will complete by which time slot (completion time)?
Q.15
6
8
13
20
Which of the following statement is false? 2
FCFS causes starvation
Shortest Remaining time next (SJF – Preemptive) causes
Q.16
starvation
Round Robin may increase average waiting time of processes
Priority Scheduling causes starvation
Consider 3 processes P1, P2 and P3 that have arrived at time 0, 1 2
and 3 respectively. Their burst time is 6 units, 8 units and 4 units.
With round robin scheduling having time quantum of 2 units,
the process that will finish first will be
Q.17
P1
P2
P3
Cannot be determined
Time from which a process arrives till it begins it's first 2
execution is called it's __________.
Turnaround time
Q.18
Waiting time
Response time
Burst time
Choose the correct statement 2
Non-preemptive SJF has the smallest waiting time
Preemptive SJF has the smallest waiting time
Q.19
FCFS has the longest waiting time
Non-preemptive Priority scheduling has the longest waiting
time
Choose the correct statement 2
Preemptive scheduling causes starvation
Non-Preemptive scheduling causes starvation
Q.20
Shortest Remaining Time Next (SRTN) scheduling causes
starvation
Round Robin scheduling causes starvation
 3 processes P1, P2, P3 having burst time of 5 time units each 2
arrive at time 0, 4, 3 respectively. Their average waiting time
using FCFS scheduling is = ___________
Q.21 0
2.33
5
2.67
4 processes P1, P2, P3, P4 having burst time of 3, 10, 7 and 5 2
time units each arrive at time 2, 7, 7, 8 respectively. Using non-
preemptive SJF scheduling, their total waiting time =
___________
Q.22
20
17
4.5
18
3 processes having burst time of 6, 10 and 8 time units each 2
arrive simultaneously at time 0. Using round robin scheduling
(with time quantum of 3 units), their total turnaround time =
___________
Q.23
24
32
59
60
Which of the following state transitions take place frequently in 2
Round Robin scheduling policy?
Running to Waiting
Q.24
Running to Exit
Waiting to Ready
Running to Ready
Process P1 is waiting for some event to occur. Process P2 enters 2
the system and requires more space in main memory, so P1 is
moveout of the main memory and necessary memory is
provided to P2. Which state transition does this scenario
Q.25 indicate?
Ready to Ready/Suspend
Blocked/Suspend to Ready/Suspend
Blocked to Blocked/Suspend
Running to Ready/Suspend
Ready queue has 2
set of all processes in the system
set of all processes residing in main memory, and waiting to
Q.26
execute
set of processes waiting for an I/O device
Set of all processes waiting in Secondary memory
______________ scheduler selects which process should be 2
Q.27
executed next
 Short-term
Medium-Term
Job
Long-Term
Choose the incorrect statement with respect to 2
Scheduling criteria optimization
Maximum CPU utilization and Maximum Throughput
Q.28
Maximum throughput and Minimum Turnaround Time
Minimum waiting time and Maximum response time
Minimum waiting time and Maximum Throughput
Difficulty in knowing the length of the next CPU request is a 2
constraint in which of the following scheduling algorithms?
FCFS
Q.29
SJF
Priority
Round Robin
Context switching between which type of threads does not 2
require any hardware support?
I. ULTs
II. KLTs
Q.30
Both I and II
Neither I and II
Only I
Only II
If one thread performs blocking operation, then entire process 2
will be blocked. This is true for which types of threads?
I. ULTs
II. KLTs
Q.31
Only I
Only II
Both I and II
Neither I and II
4 processes P1, P2, P3, P4 having burst time of 10, 10, 8 and 5 2
time units arrive at time 0, 2, 3, 5. With Round Robin scheduling
(Quantum time = 2 units), which process will complete last?
Q.32 P1
P2
P3
P4
For data given in Q.32, what is the average waiting time? 2
18
Q.33 75
18.25
18.5
Average waiting time is often long in which of the following 2
Q.34
scheduling algorithms?
 FCFS
SJF
SRTN
Round Robin
4 processes P1, P2, P3, P4 having burst time of 8, 6, 5 and 2 2
time units arrive at time 0, 1, 2, 3. With Shortest Remaining
Time Next scheduling, calculate the Average Waiting time.
Q.35 14.75
21
14.25
57
For the data given in Q.35, which process completes at time 2
instant 12?
P3
Q.36
P2
P4
No process completes at 12
An OS uses Preemptive Priority Scheduling policy. 3 Processes 2
with burst time 20, 10 and 15 having priority 1, 2 and 4 arrive at
time 5, 3 and 0 respectively. Consider priority level 1 as highest
priority and 3 to be lowest. What is the turn-around time of
Q.37 process P2?
20
30
33
45
For the data given in Q.37, what is the Average waiting time? 2
16.67
Q.38 16
50
15
An OS uses Non-Preemptive Priority Scheduling policy. 3 2
Processes with burst time 20, 10 and 15 having priority 1, 2 and
3 arrive at time 5, 3 and 0 respectively. Consider priority level 1
as highest priority and 3 to be lowest. What is the Average turn-
Q.39 around time?
87
29
23
27
For the data given in Q.39, what is the Average waiting time? 2
42
Q.40 14.67
14
16.67
 In Peterson’s solution, condition before entering a critical section 3
is
((Turn == self) && (interested[other] == true)) then loop back to
same condition
((Turn == self) && (interested[other] == true)) then enter the
Q.41
critical section
((Turn == self) || (interested[other] == true)) then loop back to
same condition
((Turn == self) || (interested[other] == true)) then enter the
critical section
When one process is executing in critical section then all other 3
processes that intend to execute the critical section must wait
for the process (inside the critical section) to leave the critical
section is called _____________
Q.42
Hold and Wait policy
Mutual Exclusion property
No-preemption policy
FCFS policy
The situation where multiple processes or threads read and 3
write the same data items is called as ____________
Synchronization
Q.43
Race condition
Mutual exclusion
Starvation
Which of the following is not a requirement for Mutual 3
exclusion?
A process remains inside its critical section for a finite time only
Only one process at a time is allowed in the critical section for a
Q.44
resource
Deadlock or starvation
A process must not be delayed access to a critical section when
there is no other process using it
Which of the following is not an atomic instruction? 3
Test and Set Lock (TSL)
Q.45 while(Lock = = 1);
Compare and Swap
None of the above
If two processes P1 and P2 enter their Critical section 3
simultaneously, then which of the following characteristic of
Solution to Critical Section problem is not satisfied?
Q.46 Bounded Waiting
Mutual Exclusion
Progress
Starvation
If a Process P1 who is not in its critical section does not allow a 3
Q.47
Process P2 to enter its Critical section, then which of the
 following characteristic of Solution to Critical Section problem is
not satisfied?
Deadlock
Mutual Exclusion
Progress
Mutual Exclusion and Progress
Which of the following is true for Disabling Interrupts? 3
Guarantees mutual exclusion
Q.48 Will work in multiprocessor architecture
Will disable interrupts on all processors of the system
Will allow multiple processes to access shared variables
Which of the following methods use only a single shared 3
variable with different conditions of unlock and lock for both
the processes?
Q.49 Single lock variable
Peterson’s solution
Disabling Interrupts
Strict Alteration
What is the disadvantage/constraint of Peterson’s solution? 3
Does not ensure bounded waiting
Does not ensure Mutual Exclusion
Q.50
Does not work when more than 2 processes are involved in
sharing variables.
Allows processes to execute in strict alteration