Question 1
Question
What is not a main structural element of a computer system?
Answer
-
Processor
-
Main Memory
-
I/O Modules
-
System Bus
-
Operating system
Question 2
Question
Which of the following registers are used by the processor to exchange data with memory?
Answer
-
MAR and MBR
-
PC and IR
-
Program status word
-
I/OAR and I/OBR
Question 3
Question
Which of the following registers are used by the processor to exchange data with input/output module?
Answer
-
MAR and MBR
-
PC and IR
-
Program status word
-
I/OAR and I/OBR
Question 4
Question
Which of the following element of a computer system controls the operation of the computer and performs its data processing functions?
Answer
-
System bus
-
Main memory
-
I/O modules
-
Processor
Question 5
Question
Which of the following element of a computer system stores data and programs?
Answer
-
Main memory
-
System bus
-
Processor
-
I/O modules
Question 6
Question
Which of the following provides for communication among elements of a computer system?
Answer
-
Main memory
-
System bus
-
Processor
-
I/O modules
Question 7
Question
Which of the following element of a computer system moves data between the computer and its external environment?
Answer
-
Main memory
-
Processor
-
System bus
-
I/O modules
Question 8
Question
The processor contains a single data register, called
Question 9
Question
This register specifies a particular input/output device
Answer
-
Memory address register
-
I/OAR
-
Memory buffer register
-
I/OBR
Question 10
Question
This register is used for the exchange of data between an I/O module and the processor
Answer
-
Memory address register
-
I/OAR
-
Memory buffer register
-
I/OBR
Question 11
Question
This register contains the data to be written into memory or which receives the data read from memory
Answer
-
I/OAR
-
memory buffer register
-
memory address register
-
I/OBR
Question 12
Question
This register specifies the location in memory for the next read or write
Answer
-
Memory address register
-
I/OAR
-
Memory buffer register
-
I/OBR
Question 13
Question
Index register, segment register, and stack register are example of:
Answer
-
Address register
-
Data registers
-
Control registers
-
Status registers
Question 14
Question
Which register contains the address of the next instruction to be fetched?
Answer
-
instruction register
-
execution register
-
program counter
-
process counter
Question 15
Question
Which register contains the instruction most recently fetched?
Answer
-
instruction register
-
execution register
-
program counter
-
process counter
Question 16
Question
Which register contains condition codes set by the processor hardware as the result of operations?
Answer
-
Program counter
-
Accumulator
-
Program status word
-
Stack pointer
Question 17
Question
The fetched instruction is loaded into the
Question 18
Question
At the beginning of each instruction cycle, the processor fetches an instruction from the memory. The address of the instruction is held in
Question 19
Question
The processor is executing ‘Load AC from memory’ instruction. Choose the correct micro-instructions:
Answer
-
PC -> MAR
M -> MBR
MBR -> AC
IR -> MAR
M -> MBR
MBR -> AC
-
PC -> MBR
M -> MAR
MAR -> IR
IR -> MAR
M -> MBR
MBR -> AC
-
PC -> MAR
M -> MBR
MBR -> IR
IR -> MAR
M -> MBR
MBR -> AC
-
PC -> MAR
M -> MBR
MBR -> IR
IR -> MBR
M -> MAR
MAR -> AC
Question 20
Question
When an I/O device completes an I/O operation, the device issues an interrupt signal to the processor and then:
Answer
-
The processor stops execution of the current instruction without finishing it and responds to the interrupt
-
The processor loads the program counter with the entry location of the interrupt-handling routine
-
The processor saves information needed to resume the current program at the point if interrupt
-
The processor finishes execution of the current instruction before responding to the interrupt
Question 21
Question
When the time required for the I/O operation is less that the time to complete the execution of instructions between write operations in the user program, it is:
Answer
-
Fast I/O wait
-
Slow I/O wait
-
Long I/O wait
-
Short I/O wait
Question 22
Question
When the time required for the I/O operation will take much more time than executing a sequence of user instructions, it is
Answer
-
Slow I/O wait
-
Long I/O wait
-
Fast I/O wait
-
Short I/O wait
Question 23
Question
Most I/O devices are:
Answer
-
much slower than the processor
-
much faster than the processor
-
much shorter than the processor
-
much longer than the processor
Question 24
Question
If there no interrupts, after each write operation, the processor must
Answer
-
Load new PC value
-
Finish execution of current instruction
-
Save the PSW and PC onto control stack
-
Pause and remain idle until the I/O operation finishes
Question 25
Question
Complete the relationship concerning the memory systems: faster access time –
Answer
-
lower capacity
-
greater cost per bit
-
faster access speed
-
smaller cost per bit
Question 26
Question
Complete the relationship concerning the memory systems: greater capacity –
Answer
-
lower capacity
-
greater cost per bit
-
faster access speed
-
smaller cost per bit
Question 27
Question
Complete the relationship concerning the memory systems: greater capacity –
Answer
-
lower capacity
-
slower access time
-
greater cost per bit
-
faster access speed
Question 28
Question
The smaller, more expensive, faster memory is:
Answer
-
Disk drive
-
Cache
-
Main memory
-
Register
Question 29
Question
If the accessed word is found in the faster memory, that is defined as a:
Question 30
Question
If the accessed word is not found in the faster memory, that is defined as a:
Question 31
Question
The central idea in this system was the use of a piece of software known as the monitor
Question 32
Question
The concept of a batch operating system was developed to
Question 33
Question
The concept of modes of operation (user mode, system mode) was introduced with
Question 34
Question
'Ease of evolution of an OS' corresponds to the following objective:
Answer
-
Efficiency
-
Convenience
-
Ability to evolve
Question 35
Question
The principal objective of the time-sharing system is to
Question 36
Question
The processor was often idle waiting for the I/O instruction to conclude. To overcome the problem the following approach was introduced: when one job needs to wait for I/O, the processor can switch to the other job. This was a
Question 37
Question
The programmer interacted directly with the computer hardware with
Question 38
Question
Semaphore is a/an_to solve the critical section problem?
Question 39
Question
'The OS as a resource manager' corresponds to the following objective:
Answer
-
Efficiency
-
Convenience
-
Ability to evolve
Question 40
Question
An un-interruptible unit is known as:
Answer
-
atomic
-
none of the above
-
static
-
single
Question 41
Question
A state is safe, if:
Answer
-
the system can allocate resources to each process in some order and still avoid a deadlock
-
the system does not crash due to deadlock occurrence
-
all of the above
-
the state keeps the system protected and safe
Question 42
Question
'The OS as a User/Computer interface' corresponds to the following objective:
Answer
-
Efficiency
-
Convenience
-
Ability to evolve
Question 43
Question
This type of memory is nonvolatile
Answer
-
Secondary memory
-
Main memory
-
Register
-
Cache
Question 44
Question
An application programs is developed by the
Answer
-
Application programmer
-
End user
-
Operating system
-
Hardware
Question 45
Question
When a processor attempts to read a byte or word of memory, it firstly checks the:
Answer
-
Secondary memory
-
Register
-
Cache
-
Main memory
Question 46
Question
The end user views a computer system in terms of
Question 47
Question
The serial processing presented two main problems:
Answer
-
setup time
-
using a monitor
-
time slicing
-
multiprogramming
-
scheduling
Question 48
Question
The hardware and software used in providing applications to a user can be viewed in a:
Answer
-
layered fashion
-
classified fashion
-
sandwich fashion
-
leveled fashion
Question 49
Question
A situation where several processes access and manipulate the same data concurrently and the outcome of the execution depends on the particular order in which access takes place is called:
Answer
-
data consistency
-
mutual exclusion
-
race condition
-
starvation
Question 50
Question
This contains the most frequently used functions in the OS:
Answer
-
Kernel (или nucleus)
-
Centre
-
Base
-
Root
Question 51
Question
The initial value of the semaphore that allows only one of the many processes to enter their critical sections,is?
Question 52
Answer
-
Application program
-
System programs
-
Opcodes
-
Processor registers
Question 53
Answer
-
The unit of data exchanged between cache and main memory
-
Larger block size yields more hits until probability of using newly fetched data becomes less than the probability of reusing data that have to be moved out of cache
-
(How much data should be transferred from main memory to cache)
Question 54
Question
There were no OS with
Question 55
Question
Which of the following cannot be interrupted?
Answer
-
Process
-
Thread
-
Module
-
Atomic operation
Question 56
Answer
-
a unit of activity characterized by execution of a sequence of instructions, a current state, and an associated set
-
a job in secondary memory
-
contents of main memory
-
program in high level language kept on disk
Question 57
Question
This determines which cache location the block will occupy: [blank_start]Mapping function[blank_end]
Question 58
Question
This resource can be created and destroyed
Answer
-
resumable resource
-
restartable resource
-
consumable resource
-
finite resource
Question 59
Question
This system handles multiple interactive jobs
Question 60
Question
Process(2.0) is:
Question 61
Question
This system was developed by General Motors for the use on an IBM 701
Question 62
Question
This chooses which block to replace when a new block is to be loaded into the cache and the cache already had all slots filled with other blocks
Answer
-
replacement algorithm
-
write policy
-
cache size
-
locality of reference
Question 63
Question
Four necessary conditions for deadlock to exist are: mutual exclusion, no-preemption, circular wait and
Answer
-
hold and wait
-
deadlock avoidance
-
starvation
-
race condition
Question 64
Question
A task in a blocked state
Question 65
Question
This type of system was developed at MIT by a group known as Project MAC for the IBM 709 in 1961
Question 66
Question
This resource can be safely used by only one process at a time and is not depleted by that use
Answer
-
refurbished resource
-
replenishing resource
-
reusable resource
-
refreshing resource
Question 67
Question
If the contents of a block in the cache are altered, then it is needed to save it back to main memory before replacing it. This is called:
Answer
-
write policy
-
mapping function
-
locality of reference
-
replacement algorithm
Question 68
Question
'Lost signals, duplicate signals received'. This is
Question 69
Question
The systems which allows only one process execution at a time, are called
Answer
-
uniprogramming systems
-
unitasking systems
-
uniprocessing systems
-
unicasting systems
Question 70
Question
Deadlock inevitable region can be referred to as a
Answer
-
fun region
-
fatal region
-
final region
-
false region
Question 71
Question
In the non-blocking send, non-blocking receive:
Answer
-
the sending process keeps sending until it receives a message
-
the sending process sends the message and resumes operation
-
neither of processes are required to wait
-
the sending process keeps sending until the message is received
Question 72
Question
Which of the following is not a technique possible for I/O operations?
Question 73
Question
'Two or more programs hung up waiting for each other'. This error is caused by
Question 74
Question
This illustrates the progress of two processes competing for two resources
Answer
-
joint process diagram
-
joint ingres diagram
-
joint regress diagram
-
joint progress diagram
Question 75
Question
The processor issues an I/O command to a module and waits, periodically checking the status of the I/O module until it finds that the operation is complete.
Question 76
Question
A monitor is a type of:
Question 77
Question
The state of a process is defined by:
Answer
-
the current activity of the process
-
the activity to next be executed by the process
-
the final activity of the process
-
the activity is just executed by the process
Question 78
Question
'When programs share memory and their execution is interleaved by the processor, they may interfere with each other by overwriting common memory areas in unpredictable ways. The results of a particular program depend on the activities of other programs in a shared system'. This is
Question 79
Question
The I/O module performs the requested action and then sets the appropriate bits in the I/O status register but takes no further action to alert the processor.
Question 80
Question
When each process in the set is blocked awaiting for resource siezed by another blocked process
Answer
-
it is a deadend
-
it is a deadlock
-
it is a softlock
-
it is a mortallock
Question 81
Question
Which of the following is not the state of a process?
Answer
-
Old
-
terminated
-
running
-
new
-
ready
Question 82
Question
The described technique is:
Question 83
Question
Choose the storage management responsibility for "Many application programs require means for storing information for extended periods of time, after the computer has been powered down"
Answer
-
Long-term storage
-
Protection and access control
-
Automatic allocation and management
-
Process isolation
-
Support of modular programming
Question 84
Question
Suppose that a process is in “Blocked” state waiting for some I/O service. When the service is completed, it goes to the:
Answer
-
Ready state
-
Running state
-
Terminated state
-
Suspended state
Question 85
Question
Which of the following statements is false:
Answer
-
compaction does not involve relocation of programs
-
the technique of storage compaction involves moving all occupied areas of storage to one end or other of main storage
-
compaction is also known as garbage collection
-
the system must stop everything while it performs the compaction
Question 86
Question
Choose the storage management responsibility for "Programmers should be able to define program modules, and to create, destroy, and alter the size of modules dynamically"
Answer
-
Protection and access control
-
Long-term storage
-
Automatic allocation and management
-
Process isolation
-
Support of modular programming
Question 87
Question
Which of the following state transitions is not possible?
Answer
-
blocked to running
-
running to blocked
-
blocked to ready
-
ready to running
Question 88
Question
The main disadvantage of this technique: it is a time-consuming process that keeps the processor busy needlessly.
Question 89
Answer
-
is the device where information stored
-
is a sequence of the instructions
-
is a device that performs a sequence of operations specified by instructions in memory
-
is typically characterized by interactive processing and time-slicing of the CPU’s time to allow quick response to each user
Question 90
Question
Choose the storage management responsibility for "The OS can achieve efficiency by assigning memory to jobs only as needed"
Answer
-
Protection and access control
-
Long-term storage
-
Automatic allocation and management
-
Process isolation
-
Support of modular programming
Question 91
Question
If a process is executing in its critical section, then no other processes can be executing in their critical section. This condition is called
Answer
-
mutual exclusion
-
asynchronous exclusion
-
critical exclusion
-
synchronous exclusion
Question 92
Question
The processor issues an I/O command to a module and then go on to some other useful work.
Question 93
Answer
-
is the device where information stored
-
is a sequence of the instructions
-
is a device that performs a sequence of operations specified by instructions in memory
-
is typically characterized by interactive processing and time-slicing of the CPU’s time to allow quick response to each user
Question 94
Question
Choose the storage management responsibility for "The OS must allow portions of memory to be accessible in various ways by various users"
Answer
-
Protection and access control
-
Long-term storage
-
Automatic allocation and management
-
Process isolation
-
Support of modular programming
Question 95
Question
Interprocess communication:
Answer
-
allows processes to communicate and synchronize their actions without using the same address space
-
allows processes to communicate and synchronize their actions when using the same address space
-
allows the processes to only synchronize their actions without communication
-
none of the above
Question 96
Question
The I/O module performs the requested action and alerts the processor to request service when it is ready to exchange data with the processor
Question 97
Question
Choose the storage management responsibility for "The OS must prevent independent processes from interfering with each other's memory, both data and instructions"
Answer
-
Protection and access control
-
Long-term storage
-
Automatic allocation and management
-
Process isolation
-
Support of modular programming
Question 98
Answer
-
is the device where information stored
-
is a sequence of the instructions
-
is a device that performs a sequence of operations specified by instructions in memory
-
is typically characterized by interactive processing and time-slicing of the CPU’s time to allow quick response to each user
Question 99
Question
A sequence of instructions, in a computer language, to get the desired result, is known as?
Answer
-
program
-
process
-
instruction
-
algorithm
Question 100
Question
In operating system security and protection, authenticity:
Answer
-
Concerned with the proper verification of the identity of users and the validity of messages or data
-
Assuring that users cannot read data for which access is unauthorized
-
Protection of data from unauthorized modification
-
Concerned with protecting the system against interruption
Question 101
Question
The main disadvantage of this technique: consumes a lot of processor time, because every word of data that goes from memory to I/O module or from I/O module to memory must pass through the processor
Question 102
Question
In operating system, each process has its own:
Question 103
Question
The memory allocation scheme subject to "external" fragmentation is?
Question 104
Question
In operating system security and protection, availability is:
Answer
-
Concerned with the proper verification of the identity of users and the validity of messages or data
-
Assuring that users cannot read data for which access is unauthorized
-
Protection of data from unauthorized modification
-
Concerned with protecting the system against interruption
Question 105
Question
For each process OS creates and manages:
Answer
-
Process control block
-
Program code
-
Program
-
Thread control block
Question 106
Question
The processor issues an I/O command to a separate module, by sending the type of operation (read/write), the address of the I/O device, the starting location in memory for data, number of words. Then the processor continues with other work.
Question 107
Question
The memory allocation scheme subject to "internal" fragmentation is?
Question 108
Question
In operating system security and protection, confidentiality is:
Answer
-
Concerned with the proper verification of the identity of users and the validity of messages or data
-
Assuring that users cannot read data for which access is unauthorized
-
Protection of data from unauthorized modification
-
Concerned with protecting the system against interruption
Question 109
Question
The module transfers the entire block of data to/from memory without going through the processor.
Question 110
Question
The available vector defines
Answer
-
total amount of each resource NOT allocated to any process
-
total amount of each resource allocated to all processes
-
total amount of each resource in the system
-
total amount of resources required for all processes
Question 111
Question
Any program, no matter how small, will occupy an entire partition results in?
Answer
-
internal fragmentation
-
segmentation
-
paging
-
external fragmentation
Question 112
Question
In operating system security and protection, data integrity is:
Answer
-
Concerned with the proper verification of the identity of users and the validity of messages or data
-
Assuring that users cannot read data for which access is unauthorized
-
Protection of data from unauthorized modification
-
Concerned with protecting the system against interruption
Question 113
Question
The main disadvantage of this technique: there is a competition for bus usage
Question 114
Question
A binary semaphore is a semaphore with integer values:
Question 115
Question
The resource vector define
Answer
-
total amount of each resource in the system
-
total amount of resources required for all processes
-
total amount of each resource allocated to all processes
-
total amount of each resource NOT allocated to any process
Question 116
Question
A hardcopy sign-up sheet was used to reserve computer time with
Answer
-
Time slicing
-
Time sliding
-
Time scheduling
-
Time allocating
Question 117
Question
Short-term scheduler, or dispatcher, picks a process. Each process in the queue is given some time in turn. This strategy is called:
Answer
-
Round-robin technique
-
Prioritizing
-
Carousel technique
-
Merry-go-round technique
Question 118
Question
This matrix defines the current allocation to process i of the resource j
Answer
-
Allocation matrix
-
Resource matrix
-
Request matrix
-
Claim matrix
Question 119
Question
A system clock generates interrupts at a rate of approximately one every 0.2 seconds. At each clock interrupt, the OS regained control and could assign the processor to another user. This technique is known as
Answer
-
Time scheduling
-
Time sliding
-
Time slicing
-
Time allocating
Question 120
Question
The base register
Answer
-
Defines the size of the region of (in bytes or words)
-
Contains the index into the process list of the process currently controlling the processor
-
Points to the next instruction in that process to be executed
-
Contains the staring address of the region of memory occupied by the process
Question 121
Question
The two atomic operations permissible on semaphores are:
Question 122
Question
This matrix defines the amount of resources of type j requested by process i
Answer
-
Request matrix
-
Allocation matrix
-
Resource matrix
-
Claim matrix
Question 123
Question
How to solve problem of equal-size partitions?
swapping (?) ----- page 318 book
Question 124
Question
The limit register
Answer
-
Defines the size of the region of (in bytes or words)
-
Contains the index into the process list of the process currently controlling the processor
-
Points to the next instruction in that process to be executed
-
Contains the staring address of the region of memory occupied by the process
Question 125
Question
Batch operating systems were used (years)
Question 126
Question
This matrix defines requirements of processes i for the resources j
Answer
-
Claim matrix
-
Allocation matrix
-
Resource matrix
-
Request matrix
Question 127
Question
How to solve problem of "external" fragmentation?
Answer
-
compaction
-
larger memory space
-
smaller memory space
-
none of these
Question 128
Question
The principal tool available to system programmers in developing the early multiprogramming and multiuser interactive systems
Answer
-
Interrupt
-
Job control language
-
Monitor
-
Add hec method
Question 129
Question
The banker's algorithm is referred to as
Question 130
Answer
-
occurs when a program accesses a page of memory
-
is a reference to a page belonging to another program
-
is an access to a page not currently in memory
-
is an error is a specific page
Question 131
Question
Job control language was used
Answer
-
used to provide instructions to the monitor,In early 1960s
-
From late 1940s to the mid-1950s
-
From the mid-1950s to early 1960s
-
Execute instructions
-
Control the sequence of events as the resident monitor
-
Translate the user’s program into object code
-
Provide instructions to the monitor to improve job setup time
Question 132
Question
The process index register
Answer
-
Contains the index into a process list of the process currently controlling the processor
-
Define the region in memory occupied by the process
-
Points to the next instruction in that process to be executed
-
Contains the starting address of the region of memory occupied by the process
Question 133
Question
Which of the following condition is required for deadlock to be possible
Question 134
Question
'Hold and wait' condition for deadlock is defined as
Answer
-
Process holds a resource while awaiting for other resource
-
Each process holds resource needed by next process in chain
-
No resource can be forcibly removed from process holding it
-
Only one process may use a resource at a time
Question 135
Question
Serial processing was used
Question 136
Question
This term was first used by the designers of Multics in the 1960s
Answer
-
Monitor
-
Process
-
Multiprogramming
-
Time sharing
Question 137
Question
Which of the following statements is false?
Answer
-
I\O transfers are more efficient with large pages
-
a large page size causes instructions and data that will not be referenced brought into primary storage
-
a small page size causes large page tables
-
internal fragmentation is increased with small pages
Question 138
Question
Banker’s algorithm for resource allocation deals with:
Answer
-
deadlock recovery
-
deadlock prevention
-
mutual exclusion
-
deadlock avoidance
Question 139
Question
'Circular wait' condition for deadlock is defined as
Answer
-
Each process holds resource needed by next process in chain
-
Process holds a resource while awaiting for other resource
-
No resource can be forcibly removed from process holding it
-
Only one process may use a resource at a time
Question 140
Question
'Ease of evolution of an OS' corresponds to the following objective:
Answer
-
Efficiency
-
Convenience
-
Ability to evolve
Question 141
Answer
-
allows many programs to use memory simultaneously
-
allows each program in turn to use the memory
-
does not work with overlaying
-
none of the above
Question 142
Question
'No preemption' condition for deadlock is defined as
Answer
-
No resource can be forcibly removed from process holding it
-
Only one process may use a resource at a time
-
Process holds a resource while awaiting for other resource
-
Each process holds resource needed by next process in chain
Question 143
Question
A system is in the safe state if:
Question 144
Question
Virtual address is a
Question 145
Question
Which of the following is not true about the memory management?
Answer
-
virtual memory is used only in multi-user systems
-
segmentation suffers from external fragmentation
-
paging suffers from internal fragmentation
-
segmented memory can be paged
-
None of the above
Question 146
Question
True or false: segmentation suffers from external fragmentation?
Question 147
Question
'Mutual exclusion' condition for deadlock is defined as
Answer
-
Only one process may use a resource at a time
-
No resource can be forcibly removed from process holding it
-
Process holds a resource while awaiting for other resource
-
Each process holds resource needed by next process in chain
Question 148
Question
True or false: paging suffers from external fragmentation?
Question 149
Question
What is NOT an example of consumable resource?
Question 150
Question
What is a method of memory allocation by which the program is subdivided into equal portions, or pages and core is subdivided into equal portions or blocks?
Answer
-
virtual memory
-
segmentation
-
paging
-
partition
Question 151
Question
What is NOT an example of reusable resource?
Answer
-
interrupt
-
semaphores
-
processors
-
i/o channels
Question 152
Question
In memory systems, boundary registers?
Answer
-
track the beginning and ending of programs
-
track page boundaries
-
are only necessary with fixed partitions
-
are used for temporary program variable storage
Question 153
Question
On all instruction cycles, the processor accesses memory at least once, to:
[blank_start]to fetch the instruction[blank_end], and often one or more additional times, [blank_start]to fetch operands[blank_end] and/or [blank_start]store results[blank_end].
Answer
-
to fetch the instruction
-
to fetch operands
-
store results
Question 154
Question
Operating System maintains the page table for:
Answer
-
each process
-
each thread
-
each instruction
-
each address
Question 155
Question
A relationship between processes such that each has some part (critical section) which must not be executed while the critical section of another is being executed, is known as?
Answer
-
Multitasking
-
Semaphore
-
Mutual exclusion
-
multiprogramming
Question 156
Question
In contiguous memory allocation:
Answer
-
each process is contained in a single contiguous section of memory
-
none of the above
-
the memory space is contiguous
-
all processes is contained in a single contiguous section of memory
Question 157
Question
CPU fetches the instruction from memory according to the value of?
Answer
-
status register
-
program counter
-
instruction register
-
program status word
Question 158
Question
When memory is divided into several fixed sized partitions, each partition may contain ________.
Question 159
Question
The number of resources requested by a process:
Answer
-
must always be less than the total number of resources available in the system
-
must always be equal to the total number of resources available in the system
-
must not exceed the total number of resources available in the system
-
must exceed the total number of resources available in the system
Question 160
Question
A memory used to provide a high speed is called?
Answer
-
cache
-
main memory
-
disk buffer
-
stack pointer
Question 161
Question
In fixed sized partition, the degree of multiprogramming is bounded by ___________.
Answer
-
the memory size
-
all of the above
-
the number of partitions
-
the CPU utilization
Question 162
Question
Which one of the following is the address generated by CPU?
Answer
-
logical address
-
physical address
-
absolute address
-
none of the above
Question 163
Question
A deadlock avoidance algorithm dynamically examines the _____ to ensure that a circular wait condition can never exist
Question 164
Question
The first fit, best fit and worst fit are strategies to select a ______.
Answer
-
process from a queue to put in memory
-
all of the above
-
free hole from a set of available holes
-
processor to run the next process
Question 165
Question
Runtime mapping from virtual to physical address is done by?
Answer
-
CPU
-
none of the above
-
memory management unit
-
PCI
Question 166
Question
In internal fragmentation, memory is internal to a partition and:
Answer
-
is not being used
-
none of the above
-
is always used
-
is being used
Question 167
Question
Which of the following is not one of the principles of dealing with deadlock?
Answer
-
Initialization
-
Avoidance
-
Detection
-
Prevention
Question 168
Question
The address of a page table in memory is pointed by:
Answer
-
page table base register
-
stack pointer
-
page register
-
program counter
Question 169
Question
A solution to the problem of external fragmentation is:
Answer
-
compaction
-
larger memory size
-
unequal size parts
-
smaller memory space
Question 170
Question
The Process Control Block is:
Question 171
Question
Program always deals with:
Answer
-
logical address
-
physical address
-
relative address
-
absolute address
Question 172
Question
__________ is generally faster than _________ .
Answer
-
worst fit, best fit
-
best fit, first fit
-
first fit, best fit
-
none of the above
Question 173
Question
Which one of the following is a synchronization tool?
Answer
-
socket
-
thread
-
pipe
-
semaphore
Question 174
Question
External fragmentation exists when:
Answer
-
none of the above
-
the total memory is insufficient to satisfy a request
-
enough total memory exists to satisfy a request but it is not contiguous
-
a request cannot be satisfied even when the total memory is free
Question 175
Question
What is compaction?
Answer
-
a paging technique
-
a technique for overcoming fatal error
-
a technique for overcoming internal fragmentation
-
a technique for overcoming external fragmentation
Question 176
Question
What controls the process in a single-threaded process model?(не точно) из книги
Question 177
Question
External fragmentation will not occur when:
Question 178
Question
When the memory allocated to a process is slightly larger than the process, then:
Question 179
Question
In the non-blocking send:
Answer
-
the sending process sends the message and resumes operation
-
the sending process keeps sending unit it receives a message
-
the sending process keeps sending until the message is received
-
none of the above
Question 180
Question
Main memory is broken into fixed-sized blocks called ________.:
Answer
-
none of the above
-
pages
-
frames
-
segments
Question 181
Question
Fixed-length block of data in secondary memory is called ________.:
Answer
-
none of the above
-
frames
-
segments
-
pages
Question 182
Question
Variable-length block of data that resides in secondary memory is called ________.
Answer
-
none of the above
-
frames
-
segments
-
pages
Question 183
Question
The degree of multi-programming is:
Answer
-
the number of processes in memory
-
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
Question 184
Question
Every address generated by the CPU is divided into two parts:
Question 185
Question
The __________ is used as an index into the page table.
Answer
-
page number
-
page offset
-
frame bit
-
frame offset
Question 186
Question
Trace of the process is: (из книги)
Answer
-
List of files that are opened
-
List of interactions of the process with other process
-
List of threads of the process
-
List of instructions that are executed
Question 187
Question
The _____ table contains the base address of each page in physical memory.
Answer
-
process
-
memory
-
page
-
frame
Question 188
Question
With paging there is no ________ fragmentation.
Answer
-
either type of
-
none of the above
-
external
-
internal
Question 189
Question
A set of processes is deadlock if:
Answer
-
none of the above
-
each process is blocked and will remain so forever
-
all processes are trying to kill each other
-
each process is terminated
Question 190
Question
The operating system maintains a ______ table that keeps track of how many frames have been allocated, how many are there, and how many are available.
Answer
-
memory
-
page
-
frame
-
segment
Question 191
Question
To find a free partition this algorithm starts searching from where it left off, not from the beginning (из книги)
Answer
-
Worst fit
-
Next fit
-
Best fit
-
First fit
Question 192
Question
For every process there is a __________.
Answer
-
pointer to page table
-
copy of page table
-
frame table
-
page table
Question 193
Question
If a page number is not found in the TLB, then it is known as a:
Answer
-
TLB miss
-
buffer miss
-
TLB ht
-
page fault
Question 194
Question
Mutual exclusion can be provided by the:
Answer
-
binary semaphores
-
none of the above
-
both
-
mutex locks
Question 195
Question
If a page table entry is present in the TLB, then it is known as a:
Answer
-
buffer miss
-
TLB miss
-
page fault
-
TLB hit
Question 196
Question
If a page table entry is not in main memory, then it is known as a:
Answer
-
page fault
-
buffer miss
-
TLB hit
-
TLB miss
Question 197
Question
What is a medium-term scheduler?
Answer
-
It selects which process has to be executed next and allocates CPU
-
It selects which process has to be brought into the ready queue
-
None of the above
-
It selects which process to remove from memory by swapping
Question 198
Question
In segmentation, each address is specified by (choose two):
Answer
-
a segment number
-
an offset
-
a value
-
a key
Question 199
Question
Which is the ready state of a process?
Answer
-
when process is using the CPU
-
when process is scheduled to run after some execution
-
when process is unable to run until some task has been completed
-
none of the above
Question 200
Question
Which one of the following is the deadlock avoidance algorithm?