CS604 Operating System

Update MCQS For Final Term

Solve By Vu Topper RM
85% To 100% Marks

For More Help Contact What’s app 03224021365

Possible side effects of __________deadlocks are low device utilization
and reduced system throughput.
A. Ignoring
B. Avoiding
C. Recovering
D. Preventing

Which of the following is correct definition for wait operation?

A. wait(S) { while(S<=0);// no o S--; Page 108
B. wait(S) { S++; }
C. wait(S) { while(S>=0) ;// no op S--; }
D. wait(S) { S--; }
The -----------scheme is not applicable to a resource allocation system
with multiple instances of each resource type.
A. Wait for graph Page 145
B. None of the given options
C. Resource allocation graph
D. Both Resource-allocation and wait-for graph

Semaphores are used to synchronize ________ processes.

A. Tough
B. Parallel
C. Running
D. Concurrent

Following is not the classical problem of synchronization.

A. Bounded buffer problem
B. Reader writer problem
C. Dining philosophers problem
D. Counting Semaphore problem Page 118

For More Help Contact What’s app 03224021365

In Resource Allocation Graph, a _________Pi --->Rj indicates that
process Pi may request resource Rj at some time in the future.
A. Claim edge Page 138
B. Request edge
C. Allocation edge
D. Assignment edge

__________ is used in the detection and recovery mechanism to handle

deadlocks.
A. Circular Graph
B. Wait-for Graph Page 144
C. Claim Edge Graph
D. Resource allocation Graph

Typically monitor, a high level synchronization tool is characterized by

___________ and ______________.
A. Signal, wait
B. Local variables, semaphores
C. Global variable,local variable
D. Local data, programmer defined operators Page 125

In order to remove the problem like busy waiting, some high level
synchronization constructs are defined. What are they?
Critical regions and Monitors Page 124
Critical regions and Semaphores

The integer value of _________ semaphores can not be greater than 1.

A. Mutex
B. Binary Page 117
C. Counting
D. Bounded buffer

For More Help Contact What’s app 03224021365

Banker’s algorithm is used for ________________
A. Deadlock removal
B. Deadlock detection
C. Deadlock prevention
D. Deadlock avoidance Page 140

________________ is an integer variable accessible through wait and

signal which are atomic operations.
A. Signal
B. Mutex
C. Semaphore Page 111
D. Busy waiting

The _____________________requires that once a writer is ready, that

writer performs its write as soon as possible. In other words, if a writer
is waiting to access the object, no new readers may start reading.
A. first readers-writers problem
B. third readers-writers problem
C. fourth readers-writers problem
D. second readers-writers problem Page 116

A state is ___________ if the system can allocate resources for each

process in some order and still avoid a deadlock.
A. Safe Page 134
B. Unsafe
C. Mutual
D. Starvation

___________ algorithm is used in Deadlock avoidance.

A. Bakery
B. Banker’s Page 139
C. Safe Sequence

For More Help Contact What’s app 03224021365

 D. Mutual exclusion

Binary semaphore whose integer value cannot be can be

____________simpler to implement.
A. >1 Page 114
B. <1
C. <=1
D. >=1

Deadlock _______ provides a set of methods for ensuring that at least

one of the necessary conditions cannot hold.
A. Handling
B. Avoidance
C. Recovery
D. Prevention Page 132

The condition in which a set {P0, P1… Pn} of waiting processes must
exist such that P0 is waiting for a resource that is held by P1, P1 is
waiting for a resource that is held by P2, and so on, Pn-1 is waiting for a
resource held by Pn, and Pn is waiting for a resource held by P0. This
condition is known as _____________.
A. Circular wait Page 131
B. Hold and wait
C. No preemption
D. Mutual exclusion

The problem of Deadlocks can be solved by __________ method(s).

A. All of the given Page 132
B. Deadlock avoidance
C. Deadlock prevention
D. Allowing deadlock to occur, then detect and recover

For More Help Contact What’s app 03224021365

The integer value of ______________ semaphores can range over an
unrestricted integer domain.
A. Mutex
B. Binary
C. Counting Page 117
D. Bounded buffer

If the system can allocate resources to each process in some order and
still avoid a deadlock then it is said to be in ___________ state.
A. Safe Page 134
B. Mutual
C. Un-Safe
D. Starvation

Wrong use of wait and signal operations (in context with semaphores)
can cause _________ problem(s).
A. Deadlock
B. Mutual Exclusion
C. Bounded Waiting
D. All of the given options are correct

Deadlock can be deal with ______________ways.

A. 1
B. 2
C. 3 Page 132
D. 4

The condition where a set of blocked processes each holding a resource

and waiting to acquire a resource held by another process in the set, is
termed as ________.
Deadlock Page 130
Starvation

For More Help Contact What’s app 03224021365

If a system is not in a safe state, there can be NO deadlocks.
False Pagen 137
True

Deadlock detection and recovery technique is exactly similar to

deadlock avoidance technique to handle deadlock in the system.
True
False

A dashed line is used to represent a __________ in Resource Allocation

Graph.
A. Claim edge Page 136
B. Request edge
C. Allocation edge
D. Assignment edge

Removing the possibility of deadlock in dining philosopher problem

does not ensure the _____________ problem will not occur.
A. Starvation Page 123
B. Critical Section
C. Bounded Buffer
D. Mutual Exclusion

In deadlock detection and recovery algorithm, a deadlock exists in the

system if and only if the wait for graph contains a _____________.
A. Node
B. Edge
C. Cycle Page 147
D. Graph

For More Help Contact What’s app 03224021365

The process of holding at least one resource and waiting to acquire
additional resources that are currently being held by other processes is
known as _________________.
A. Circular wait
B. Hold and wait Page 131
C. No preemption
D. Mutual exclusion

Variable names are ----------- addresses.

A. Relative
B. Physical
C. Symbolic
D. Relocatable Google

Possible side effects of __________deadlocks are low device utilization

and reduced system throughput.
A. Ignoring
B. Avoiding
C. Recovering
D. Preventing

Which of the following is correct definition for wait operation?

A. wait(S) { while(S<=0) P/108 ;// no o S--;
B. wait(S) { S++; }
C. wait(S) { while(S>=0) ;// no op S--; }
D. wait(S) { S--; }
The -----------scheme is not applicable to a resource allocation system
with multiple instances of each resource type.
A. Wait for graph Page 145
B. None of the given options
C. Resource allocation graph
D. Both Resource-allocation and wait-for graph

For More Help Contact What’s app 03224021365

Semaphores are used to synchronize ________ processes.
A. Tough
B. Parallel
C. Running
D. Concurrent

Following is not the classical problem of synchronization.

A. Bounded buffer problem
B. Reader writer problem
C. Dining philosophers problem
D. Counting Semaphore problem Page 118

In Resource Allocation Graph, a _________Pi --->Rj indicates that

process Pi may request resource Rj at some time in the future.
A. Claim edge Page 138
B. Request edge
C. Allocation edge
D. Assignment edge

__________ is used in the detection and recovery mechanism to handle

deadlocks.
A. Circular Graph
B. Wait-for Graph Page 144
C. Claim Edge Graph
D. Resource allocation Graph

Typically monitor, a high level synchronization tool is characterized by

___________ and ______________.
A. Signal, wait
B. Local variables, semaphores
C. Global variable,local variable
D. Local data, programmer defined operators Page 125

For More Help Contact What’s app 03224021365

In order to remove the problem like busy waiting, some high level
synchronization constructs are defined. What are they?
Critical regions and Monitors Page 124
Critical regions and Semaphores

The integer value of _________ semaphores can not be greater than 1.

Mutex
Binary Page 117
Counting
Bounded buffer

Banker’s algorithm is used for ________________

Deadlock removal
Deadlock detection
Deadlock prevention
Deadlock avoidance Page 140

________________ is an integer variable accessible through wait and

signal which are atomic operations.
Signal
Mutex
Semaphore Page 111
Busy waiting

The _____________________requires that once a writer is ready, that

writer performs its write as soon as possible. In other words, if a writer
is waiting to access the object, no new readers may start reading.
first readers-writers problem
third readers-writers problem
fourth readers-writers problem

For More Help Contact What’s app 03224021365

second readers-writers problem Page 116

A state is ___________ if the system can allocate resources for each

process in some order and still avoid a deadlock.
Safe Page 134
Unsafe
Mutual
Starvation

___________ algorithm is used in Deadlock avoidance.

Bakery
Banker’s Page 139
Safe Sequence
Mutual exclusion

Binary semaphore whose integer value cannot be can be

____________simpler to implement.
>1 Page 114
<1
<=1
>=1

Deadlock _______ provides a set of methods for ensuring that at least

one of the necessary conditions cannot hold.
Handling
Avoidance
Recovery
Prevention Page 132

The condition in which a set {P0, P1… Pn} of waiting processes must
exist such that P0 is waiting for a resource that is held by P1, P1 is

For More Help Contact What’s app 03224021365

waiting for a resource that is held by P2, and so on, Pn-1 is waiting for a
resource held by Pn, and Pn is waiting for a resource held by P0. This
condition is known as _____________.
Circular wait Page 131
Hold and wait
No preemption
Mutual exclusion

The problem of Deadlocks can be solved by __________ method(s).

All of the given Page 132
Deadlock avoidance
Deadlock prevention
Allowing deadlock to occur, then detect and recover

The integer value of ______________ semaphores can range over an

unrestricted integer domain.
Mutex
Binary
Counting Page 117
Bounded buffer

If the system can allocate resources to each process in some order and
still avoid a deadlock then it is said to be in ___________ state.
Safe Page 134
Mutual
Un-Safe
Starvation

Wrong use of wait and signal operations (in context with semaphores)
can cause _________ problem(s).
Deadlock
Mutual Exclusion
Bounded Waiting

For More Help Contact What’s app 03224021365

All of the given options are correct
Deadlock can be deal with ______________ways.
1
2
3 Page 132
4

The condition where a set of blocked processes each holding a resource

and waiting to acquire a resource held by another process in the set, is
termed as ________.
Deadlock Page 130
Starvation

The __________ protection scheme guards against a process trying to

access a page that does not belong to its address space.
A. Hybrid
B. Primary Page 169
C. Tertiary
D. Secondary

Assume a logical address space of 16 pages of 1024 words, each mapped

into a physical memory of 32 frames. Each word consists of 2 bytes.
What will be the total number of bits required for p (page number)?
A. 4 bits Page 166
B. 8 bits
C. 16 bits
D. 32 bits

Address Binding will be _______ in Multiprogramming with Variable

Tasks (MVT)
A. Fixed
B. Static
C. Variable

For More Help Contact What’s app 03224021365

 D. Dynamic
The system maintains a ____________ of all processes whose memory
images are on the backing store or in memory and are ready to run.
A. Que
B. List
C. Ready que Page 157
D. Environment

In_____________, the library files are linked at load time.

Static Linking
Dynamic Linking

Main Memory is _______________ memory.

A. Virtual
B. Volatile
C. Permanent
D. Non-volatile

Object files and libraries are combined by a ------------- program to

produce the executable binary
A. Linker
B. Loader
C. Compiler
D. Text editor

Memory protection in paging is achieved by associating ___________

with each page. This bit indicates whether the page is in the process
address space or not.
A. paging table
B. counting bits
C. segment table
D. Protection bits Page 169

For More Help Contact What’s app 03224021365

__________ consists of a large array of words or bytes, each with its
own address.
A. Data
B. Stream
C. Memory Page 150
D. Hard disk

Logical memory is divided into blocks of the same size,

called_________ .
A. Pages Page 162
B. Table
C. Frame
D. Page size

___________ is constrained by factors like quantum for RR scheduler

and pending I/O for swapped out process.
A. Rollin
B. Rollout
C. Kernel
D. Swapping Page 157

------------ register contains the size of the process

A. Base register
B. Index register
C. Limit register Page 13
D. Stack pointers register

What do we name to an address that is generated by the CPU?

A. Logical address Page 152
B. Binary addresses
C. Physical address
D. None of the given options

For More Help Contact What’s app 03224021365

What do we name to an address that is loaded into the memory-address
register of the memory?
A. Logical address
B. Physical address Page 155
C. Binary addresses
D. None of the given options

A page table needed for keeping track of pages of the page table is
called --------------
A. Page size
B. 2-level paging
C. Page directory Page 173
D. Page table size

In pages segmentation, the logical address is legal if d is

_________segment length.
A. Equal to
B. Less than Page 180
C. Greater than
D. Greater than or equal to

The collection of processes that is waiting on the disk to be brought into

the memory for execution forms the --------
A. Output queue
B. Input queue Page 151
C. None of the given options
D. Both input and output queue

------------------points to the page table

A. Page offset
B. Translation look-aside buffers
C. Page-table base register (PTBR)
D. Page-table length register (PRLR)

For More Help Contact What’s app 03224021365

Physical memory is broken down into fixed-sized blocks, called----------
- and Logical memory is divided into blocks of the same size, called -----
------
A. Pages, frame
B. Frames, holes
C. Frames, pages Page 165
D. Holes, segments

External Fragmentation takes place in ______________

A. Paging
B. Multi-tasking
C. Multiprogramming with Fixed Tasks (MFT)
D. Multiprogramming with Variable Tasks (MVT) Page 163

Addresses generated relative to part of program, not to start of physical

memory are
A. Virtual
B. Physical
C. Symbolic
D. Relocatable

The address generated by the CPU, after any indexing or other

addressing-mode arithmetic, is called a --------address, and the address it
gets translated to by the MMU is called a ---------address.
A. Valid, invalid
B. Physical, Virtual
C. Virtual, physical Page 153
D. Hexadecimal, Binary

In ------------- technique, memory is divided into several fixed-size

partitions.
A. Overlays
B. Swapping

For More Help Contact What’s app 03224021365

 C. Multiprogramming with Fixed Tasks (MFT) Page 160
D. Multiprogramming with Variable Tasks (MVT)

_____________is the separation of user logical memory from physical

memory.
A. Rom
B. Virtual Memory Page 185
C. Physical memory
D. None of the given options

In Overlay technique, we can overload any part of the program with the
part of the program required needed recently.
True
False

If there exists a logical address space of 16 pages of 1024 words, each

mapped into a physical memory of ______ frames.
A. 16
B. 32 Page 165
C. 48
D. 64

-----------is the process of mapping a name to an address.

A. Routing
B. Binding
C. Memory Page 194
D. Addressing

_____________ is caused due to un-used space in physical memory.

A. MVT
B. Paging
C. External fragmentation
D. Internal fragmentation

For More Help Contact What’s app 03224021365

Every --------------generated by the CPU is divided into two parts: a page
number (p) and a page offset (d).
A. Page
B. Logical address Page 163
C. Physical address
D. Process address space

____________ is commonly implemented as demand paging.

A. Paging
B. Virtual Memory Page 185
C. Physical Memory
D. Logical Addressing

The main memory is usually divided into partitions, one for __________
and other for __________ .
A. Operating system, CPU
B. Processes, Virtual Memory
C. Base Register, Limit Register
D. Operating System, User processes

The run-time mapping from virtual to physical addresses is done by a

piece of hardware in the CPU, called the ------------------
A. Registers
B. CPU Scheduler
C. None of the given options
D. Memory management unit (MMU) Page 155

Cache is non-volatile memory.

False Page 153
True

For More Help Contact What’s app 03224021365

It is not possible to run a program whose size is greater than the size of
the main memory.
36 bits
48 bits Page 185
64 bits
128 bits

The set of all physical addresses corresponding to the logical addresses

is a ----------------- of the process
Process address space
Logical address space
Physical address space Page 155
None of the given options

Address Binding will be at _______ in Multiprogramming with Fixed

Tasks (MFT)
A. Run time
B. Load time Page 160
C. Dynamic time
D. None of the given options

In memory management programmer’s view of memory representation

is called ________________.
Offset
Segmentation Page 175
Logical address
Physical address

Intel is basically designed for following Operating Systems except

__________.
Linux
OS/2

For More Help Contact What’s app 03224021365

Windows
MULTICS Page 182

Intel 80386 used paged segmentation with _________ level paging.

One
Two Page 185
Four
Three

The logical address of Intel 80386 is _________.

36 bits
48 bits Page 185
64 bitts
128 bits

A ____________ system is similar to a paging system with swapping

Page fault
Demand paging Page 186
Context switching
None of the given options

The segment table maps the _________________ to physical addresses.

Page addresses
Shared page addresses
One-dimensional logical addresses
Two-dimensional logical addresses Page 175

For More Help Contact What’s app 03224021365

For More Help Contact What’s app 03224021365