Frage 1
Frage
What is not a main structural element of a computer system?
Antworten
-
Processor
-
Main Memory
-
I/O Modules
-
System Bus
-
Operating system
Frage 2
Frage
Which of the following registers are used by the processor to exchange data with memory?
Antworten
-
MAR and MBR
-
PC and IR
-
Program status word
-
I/OAR and I/OBR
Frage 3
Frage
Which of the following registers are used by the processor to exchange data with input/output module?
Antworten
-
MAR and MBR
-
PC and IR
-
Program status word
-
I/OAR and I/OBR
Frage 4
Frage
Which of the following element of a computer system controls the operation of the computer and performs its data processing functions?
Antworten
-
System bus
-
Main memory
-
I/O modules
-
Processor
Frage 5
Frage
Which of the following element of a computer system stores data and programs?
Antworten
-
Main memory
-
System bus
-
Processor
-
I/O modules
Frage 6
Frage
Which of the following provides for communication among elements of a computer system?
Antworten
-
Main memory
-
System bus
-
Processor
-
I/O modules
Frage 7
Frage
Which of the following element of a computer system moves data between the computer and its external environment?
Antworten
-
Main memory
-
Processor
-
System bus
-
I/O modules
Frage 8
Frage
The processor contains a single data register, called
Frage 9
Frage
This register specifies a particular input/output device
Antworten
-
Memory address register
-
I/OAR
-
Memory buffer register
-
I/OBR
Frage 10
Frage
This register is used for the exchange of data between an I/O module and the processor
Antworten
-
Memory address register
-
I/OAR
-
Memory buffer register
-
I/OBR
Frage 11
Frage
This register contains the data to be written into memory or which receives the data read from memory
Antworten
-
I/OAR
-
memory buffer register
-
memory address register
-
I/OBR
Frage 12
Frage
This register specifies the location in memory for the next read or write
Antworten
-
Memory address register
-
I/OAR
-
Memory buffer register
-
I/OBR
Frage 13
Frage
Index register, segment register, and stack register are example of:
Antworten
-
Address register
-
Data registers
-
Control registers
-
Status registers
Frage 14
Frage
Which register contains the address of the next instruction to be fetched?
Antworten
-
instruction register
-
execution register
-
program counter
-
process counter
Frage 15
Frage
Which register contains the instruction most recently fetched?
Antworten
-
instruction register
-
execution register
-
program counter
-
process counter
Frage 16
Frage
Which register contains condition codes set by the processor hardware as the result of operations?
Antworten
-
Program counter
-
Accumulator
-
Program status word
-
Stack pointer
Frage 17
Frage
The fetched instruction is loaded into the
Frage 18
Frage
At the beginning of each instruction cycle, the processor fetches an instruction from the memory. The address of the instruction is held in
Frage 19
Frage
The processor is executing ‘Load AC from memory’ instruction. Choose the correct micro-instructions:
Antworten
-
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
Frage 20
Frage
When an I/O device completes an I/O operation, the device issues an interrupt signal to the processor and then:
Antworten
-
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
Frage 21
Frage
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:
Antworten
-
Fast I/O wait
-
Slow I/O wait
-
Long I/O wait
-
Short I/O wait
Frage 22
Frage
When the time required for the I/O operation will take much more time than executing a sequence of user instructions, it is
Antworten
-
Slow I/O wait
-
Long I/O wait
-
Fast I/O wait
-
Short I/O wait
Frage 23
Frage
Most I/O devices are:
Antworten
-
much slower than the processor
-
much faster than the processor
-
much shorter than the processor
-
much longer than the processor
Frage 24
Frage
If there no interrupts, after each write operation, the processor must
Antworten
-
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
Frage 25
Frage
Complete the relationship concerning the memory systems: faster access time –
Antworten
-
lower capacity
-
greater cost per bit
-
faster access speed
-
smaller cost per bit
Frage 26
Frage
Complete the relationship concerning the memory systems: greater capacity –
Antworten
-
lower capacity
-
greater cost per bit
-
faster access speed
-
smaller cost per bit
Frage 27
Frage
Complete the relationship concerning the memory systems: greater capacity –
Antworten
-
lower capacity
-
slower access time
-
greater cost per bit
-
faster access speed
Frage 28
Frage
The smaller, more expensive, faster memory is:
Antworten
-
Disk drive
-
Cache
-
Main memory
-
Register
Frage 29
Frage
If the accessed word is found in the faster memory, that is defined as a:
Frage 30
Frage
If the accessed word is not found in the faster memory, that is defined as a:
Frage 31
Frage
The central idea in this system was the use of a piece of software known as the monitor
Frage 32
Frage
The concept of a batch operating system was developed to
Frage 33
Frage
The concept of modes of operation (user mode, system mode) was introduced with
Frage 34
Frage
'Ease of evolution of an OS' corresponds to the following objective:
Antworten
-
Efficiency
-
Convenience
-
Ability to evolve
Frage 35
Frage
The principal objective of the time-sharing system is to
Frage 36
Frage
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
Frage 37
Frage
The programmer interacted directly with the computer hardware with
Frage 38
Frage
Semaphore is a/an_to solve the critical section problem?
Frage 39
Frage
'The OS as a resource manager' corresponds to the following objective:
Antworten
-
Efficiency
-
Convenience
-
Ability to evolve
Frage 40
Frage
An un-interruptible unit is known as:
Antworten
-
atomic
-
none of the above
-
static
-
single
Frage 41
Frage
A state is safe, if:
Antworten
-
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
Frage 42
Frage
'The OS as a User/Computer interface' corresponds to the following objective:
Antworten
-
Efficiency
-
Convenience
-
Ability to evolve
Frage 43
Frage
This type of memory is nonvolatile
Antworten
-
Secondary memory
-
Main memory
-
Register
-
Cache
Frage 44
Frage
An application programs is developed by the
Antworten
-
Application programmer
-
End user
-
Operating system
-
Hardware
Frage 45
Frage
When a processor attempts to read a byte or word of memory, it firstly checks the:
Antworten
-
Secondary memory
-
Register
-
Cache
-
Main memory
Frage 46
Frage
The end user views a computer system in terms of
Frage 47
Frage
The serial processing presented two main problems:
Antworten
-
setup time
-
using a monitor
-
time slicing
-
multiprogramming
-
scheduling
Frage 48
Frage
The hardware and software used in providing applications to a user can be viewed in a:
Antworten
-
layered fashion
-
classified fashion
-
sandwich fashion
-
leveled fashion
Frage 49
Frage
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:
Antworten
-
data consistency
-
mutual exclusion
-
race condition
-
starvation
Frage 50
Frage
This contains the most frequently used functions in the OS:
Antworten
-
Kernel (или nucleus)
-
Centre
-
Base
-
Root
Frage 51
Frage
The initial value of the semaphore that allows only one of the many processes to enter their critical sections,is?
Frage 52
Antworten
-
Application program
-
System programs
-
Opcodes
-
Processor registers
Frage 53
Antworten
-
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)
Frage 54
Frage
There were no OS with
Frage 55
Frage
Which of the following cannot be interrupted?
Antworten
-
Process
-
Thread
-
Module
-
Atomic operation
Frage 56
Antworten
-
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
Frage 57
Frage
This determines which cache location the block will occupy: [blank_start]Mapping function[blank_end]
Frage 58
Frage
This resource can be created and destroyed
Antworten
-
resumable resource
-
restartable resource
-
consumable resource
-
finite resource
Frage 59
Frage
This system handles multiple interactive jobs
Frage 60
Frage 61
Frage
This system was developed by General Motors for the use on an IBM 701
Frage 62
Frage
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
Antworten
-
replacement algorithm
-
write policy
-
cache size
-
locality of reference
Frage 63
Frage
Four necessary conditions for deadlock to exist are: mutual exclusion, no-preemption, circular wait and
Antworten
-
hold and wait
-
deadlock avoidance
-
starvation
-
race condition
Frage 64
Frage
A task in a blocked state
Frage 65
Frage
This type of system was developed at MIT by a group known as Project MAC for the IBM 709 in 1961
Frage 66
Frage
This resource can be safely used by only one process at a time and is not depleted by that use
Antworten
-
refurbished resource
-
replenishing resource
-
reusable resource
-
refreshing resource
Frage 67
Frage
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:
Antworten
-
write policy
-
mapping function
-
locality of reference
-
replacement algorithm
Frage 68
Frage
'Lost signals, duplicate signals received'. This is
Frage 69
Frage
The systems which allows only one process execution at a time, are called
Antworten
-
uniprogramming systems
-
unitasking systems
-
uniprocessing systems
-
unicasting systems
Frage 70
Frage
Deadlock inevitable region can be referred to as a
Antworten
-
fun region
-
fatal region
-
final region
-
false region
Frage 71
Frage
In the non-blocking send, non-blocking receive:
Antworten
-
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
Frage 72
Frage
Which of the following is not a technique possible for I/O operations?
Frage 73
Frage
'Two or more programs hung up waiting for each other'. This error is caused by
Frage 74
Frage
This illustrates the progress of two processes competing for two resources
Antworten
-
joint process diagram
-
joint ingres diagram
-
joint regress diagram
-
joint progress diagram
Frage 75
Frage
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.
Frage 76
Frage
A monitor is a type of:
Frage 77
Frage
The state of a process is defined by:
Antworten
-
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
Frage 78
Frage
'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
Frage 79
Frage
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.
Frage 80
Frage
When each process in the set is blocked awaiting for resource siezed by another blocked process
Antworten
-
it is a deadend
-
it is a deadlock
-
it is a softlock
-
it is a mortallock
Frage 81
Frage
Which of the following is not the state of a process?
Antworten
-
Old
-
terminated
-
running
-
new
-
ready
Frage 82
Frage
The described technique is:
Frage 83
Frage
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"
Antworten
-
Long-term storage
-
Protection and access control
-
Automatic allocation and management
-
Process isolation
-
Support of modular programming
Frage 84
Frage
Suppose that a process is in “Blocked” state waiting for some I/O service. When the service is completed, it goes to the:
Antworten
-
Ready state
-
Running state
-
Terminated state
-
Suspended state
Frage 85
Frage
Which of the following statements is false:
Antworten
-
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
Frage 86
Frage
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"
Antworten
-
Protection and access control
-
Long-term storage
-
Automatic allocation and management
-
Process isolation
-
Support of modular programming
Frage 87
Frage
Which of the following state transitions is not possible?
Antworten
-
blocked to running
-
running to blocked
-
blocked to ready
-
ready to running
Frage 88
Frage
The main disadvantage of this technique: it is a time-consuming process that keeps the processor busy needlessly.
Frage 89
Antworten
-
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
Frage 90
Frage
Choose the storage management responsibility for "The OS can achieve efficiency by assigning memory to jobs only as needed"
Antworten
-
Protection and access control
-
Long-term storage
-
Automatic allocation and management
-
Process isolation
-
Support of modular programming
Frage 91
Frage
If a process is executing in its critical section, then no other processes can be executing in their critical section. This condition is called
Antworten
-
mutual exclusion
-
asynchronous exclusion
-
critical exclusion
-
synchronous exclusion
Frage 92
Frage
The processor issues an I/O command to a module and then go on to some other useful work.
Frage 93
Antworten
-
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
Frage 94
Frage
Choose the storage management responsibility for "The OS must allow portions of memory to be accessible in various ways by various users"
Antworten
-
Protection and access control
-
Long-term storage
-
Automatic allocation and management
-
Process isolation
-
Support of modular programming
Frage 95
Frage
Interprocess communication:
Antworten
-
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
Frage 96
Frage
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
Frage 97
Frage
Choose the storage management responsibility for "The OS must prevent independent processes from interfering with each other's memory, both data and instructions"
Antworten
-
Protection and access control
-
Long-term storage
-
Automatic allocation and management
-
Process isolation
-
Support of modular programming
Frage 98
Antworten
-
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
Frage 99
Frage
A sequence of instructions, in a computer language, to get the desired result, is known as?
Antworten
-
program
-
process
-
instruction
-
algorithm
Frage 100
Frage
In operating system security and protection, authenticity:
Antworten
-
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
Frage 101
Frage
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
Frage 102
Frage
In operating system, each process has its own:
Frage 103
Frage
The memory allocation scheme subject to "external" fragmentation is?
Frage 104
Frage
In operating system security and protection, availability is:
Antworten
-
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
Frage 105
Frage
For each process OS creates and manages:
Antworten
-
Process control block
-
Program code
-
Program
-
Thread control block
Frage 106
Frage
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.
Frage 107
Frage
The memory allocation scheme subject to "internal" fragmentation is?
Frage 108
Frage
In operating system security and protection, confidentiality is:
Antworten
-
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
Frage 109
Frage
The module transfers the entire block of data to/from memory without going through the processor.
Frage 110
Frage
The available vector defines
Antworten
-
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
Frage 111
Frage
Any program, no matter how small, will occupy an entire partition results in?
Antworten
-
internal fragmentation
-
segmentation
-
paging
-
external fragmentation
Frage 112
Frage
In operating system security and protection, data integrity is:
Antworten
-
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
Frage 113
Frage
The main disadvantage of this technique: there is a competition for bus usage
Frage 114
Frage
A binary semaphore is a semaphore with integer values:
Frage 115
Frage
The resource vector define
Antworten
-
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
Frage 116
Frage
A hardcopy sign-up sheet was used to reserve computer time with
Antworten
-
Time slicing
-
Time sliding
-
Time scheduling
-
Time allocating
Frage 117
Frage
Short-term scheduler, or dispatcher, picks a process. Each process in the queue is given some time in turn. This strategy is called:
Antworten
-
Round-robin technique
-
Prioritizing
-
Carousel technique
-
Merry-go-round technique
Frage 118
Frage
This matrix defines the current allocation to process i of the resource j
Antworten
-
Allocation matrix
-
Resource matrix
-
Request matrix
-
Claim matrix
Frage 119
Frage
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
Antworten
-
Time scheduling
-
Time sliding
-
Time slicing
-
Time allocating
Frage 120
Antworten
-
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
Frage 121
Frage
The two atomic operations permissible on semaphores are:
Frage 122
Frage
This matrix defines the amount of resources of type j requested by process i
Antworten
-
Request matrix
-
Allocation matrix
-
Resource matrix
-
Claim matrix
Frage 123
Frage
How to solve problem of equal-size partitions?
swapping (?) ----- page 318 book
Frage 124
Antworten
-
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
Frage 125
Frage
Batch operating systems were used (years)
Frage 126
Frage
This matrix defines requirements of processes i for the resources j
Antworten
-
Claim matrix
-
Allocation matrix
-
Resource matrix
-
Request matrix
Frage 127
Frage
How to solve problem of "external" fragmentation?
Antworten
-
compaction
-
larger memory space
-
smaller memory space
-
none of these
Frage 128
Frage
The principal tool available to system programmers in developing the early multiprogramming and multiuser interactive systems
Antworten
-
Interrupt
-
Job control language
-
Monitor
-
Add hec method
Frage 129
Frage
The banker's algorithm is referred to as
Frage 130
Antworten
-
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
Frage 131
Frage
Job control language was used
Antworten
-
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
Frage 132
Frage
The process index register
Antworten
-
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
Frage 133
Frage
Which of the following condition is required for deadlock to be possible
Frage 134
Frage
'Hold and wait' condition for deadlock is defined as
Antworten
-
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
Frage 135
Frage
Serial processing was used
Frage 136
Frage
This term was first used by the designers of Multics in the 1960s
Antworten
-
Monitor
-
Process
-
Multiprogramming
-
Time sharing
Frage 137
Frage
Which of the following statements is false?
Antworten
-
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
Frage 138
Frage
Banker’s algorithm for resource allocation deals with:
Antworten
-
deadlock recovery
-
deadlock prevention
-
mutual exclusion
-
deadlock avoidance
Frage 139
Frage
'Circular wait' condition for deadlock is defined as
Antworten
-
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
Frage 140
Frage
'Ease of evolution of an OS' corresponds to the following objective:
Antworten
-
Efficiency
-
Convenience
-
Ability to evolve
Frage 141
Antworten
-
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
Frage 142
Frage
'No preemption' condition for deadlock is defined as
Antworten
-
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
Frage 143
Frage
A system is in the safe state if:
Frage 144
Frage
Virtual address is a
Frage 145
Frage
Which of the following is not true about the memory management?
Antworten
-
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
Frage 146
Frage
True or false: segmentation suffers from external fragmentation?
Frage 147
Frage
'Mutual exclusion' condition for deadlock is defined as
Antworten
-
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
Frage 148
Frage
True or false: paging suffers from external fragmentation?
Frage 149
Frage
What is NOT an example of consumable resource?
Frage 150
Frage
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?
Antworten
-
virtual memory
-
segmentation
-
paging
-
partition
Frage 151
Frage
What is NOT an example of reusable resource?
Antworten
-
interrupt
-
semaphores
-
processors
-
i/o channels
Frage 152
Frage
In memory systems, boundary registers?
Antworten
-
track the beginning and ending of programs
-
track page boundaries
-
are only necessary with fixed partitions
-
are used for temporary program variable storage
Frage 153
Frage
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].
Antworten
-
to fetch the instruction
-
to fetch operands
-
store results
Frage 154
Frage
Operating System maintains the page table for:
Antworten
-
each process
-
each thread
-
each instruction
-
each address
Frage 155
Frage
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?
Antworten
-
Multitasking
-
Semaphore
-
Mutual exclusion
-
multiprogramming
Frage 156
Frage
In contiguous memory allocation:
Antworten
-
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
Frage 157
Frage
CPU fetches the instruction from memory according to the value of?
Antworten
-
status register
-
program counter
-
instruction register
-
program status word
Frage 158
Frage
When memory is divided into several fixed sized partitions, each partition may contain ________.
Frage 159
Frage
The number of resources requested by a process:
Antworten
-
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
Frage 160
Frage
A memory used to provide a high speed is called?
Antworten
-
cache
-
main memory
-
disk buffer
-
stack pointer
Frage 161
Frage
In fixed sized partition, the degree of multiprogramming is bounded by ___________.
Antworten
-
the memory size
-
all of the above
-
the number of partitions
-
the CPU utilization
Frage 162
Frage
Which one of the following is the address generated by CPU?
Antworten
-
logical address
-
physical address
-
absolute address
-
none of the above
Frage 163
Frage
A deadlock avoidance algorithm dynamically examines the _____ to ensure that a circular wait condition can never exist
Frage 164
Frage
The first fit, best fit and worst fit are strategies to select a ______.
Antworten
-
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
Frage 165
Frage
Runtime mapping from virtual to physical address is done by?
Antworten
-
CPU
-
none of the above
-
memory management unit
-
PCI
Frage 166
Frage
In internal fragmentation, memory is internal to a partition and:
Antworten
-
is not being used
-
none of the above
-
is always used
-
is being used
Frage 167
Frage
Which of the following is not one of the principles of dealing with deadlock?
Antworten
-
Initialization
-
Avoidance
-
Detection
-
Prevention
Frage 168
Frage
The address of a page table in memory is pointed by:
Antworten
-
page table base register
-
stack pointer
-
page register
-
program counter
Frage 169
Frage
A solution to the problem of external fragmentation is:
Antworten
-
compaction
-
larger memory size
-
unequal size parts
-
smaller memory space
Frage 170
Frage
The Process Control Block is:
Frage 171
Frage
Program always deals with:
Antworten
-
logical address
-
physical address
-
relative address
-
absolute address
Frage 172
Frage
__________ is generally faster than _________ .
Antworten
-
worst fit, best fit
-
best fit, first fit
-
first fit, best fit
-
none of the above
Frage 173
Frage
Which one of the following is a synchronization tool?
Antworten
-
socket
-
thread
-
pipe
-
semaphore
Frage 174
Frage
External fragmentation exists when:
Antworten
-
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
Frage 175
Frage
What is compaction?
Antworten
-
a paging technique
-
a technique for overcoming fatal error
-
a technique for overcoming internal fragmentation
-
a technique for overcoming external fragmentation
Frage 176
Frage
What controls the process in a single-threaded process model?(не точно) из книги
Frage 177
Frage
External fragmentation will not occur when:
Frage 178
Frage
When the memory allocated to a process is slightly larger than the process, then:
Frage 179
Frage
In the non-blocking send:
Antworten
-
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
Frage 180
Frage
Main memory is broken into fixed-sized blocks called ________.:
Antworten
-
none of the above
-
pages
-
frames
-
segments
Frage 181
Frage
Fixed-length block of data in secondary memory is called ________.:
Antworten
-
none of the above
-
frames
-
segments
-
pages
Frage 182
Frage
Variable-length block of data that resides in secondary memory is called ________.
Antworten
-
none of the above
-
frames
-
segments
-
pages
Frage 183
Frage
The degree of multi-programming is:
Antworten
-
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
Frage 184
Frage
Every address generated by the CPU is divided into two parts:
Frage 185
Frage
The __________ is used as an index into the page table.
Antworten
-
page number
-
page offset
-
frame bit
-
frame offset
Frage 186
Frage
Trace of the process is: (из книги)
Antworten
-
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
Frage 187
Frage
The _____ table contains the base address of each page in physical memory.
Antworten
-
process
-
memory
-
page
-
frame
Frage 188
Frage
With paging there is no ________ fragmentation.
Antworten
-
either type of
-
none of the above
-
external
-
internal
Frage 189
Frage
A set of processes is deadlock if:
Antworten
-
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
Frage 190
Frage
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.
Antworten
-
memory
-
page
-
frame
-
segment
Frage 191
Frage
To find a free partition this algorithm starts searching from where it left off, not from the beginning (из книги)
Antworten
-
Worst fit
-
Next fit
-
Best fit
-
First fit
Frage 192
Frage
For every process there is a __________.
Antworten
-
pointer to page table
-
copy of page table
-
frame table
-
page table
Frage 193
Frage
If a page number is not found in the TLB, then it is known as a:
Antworten
-
TLB miss
-
buffer miss
-
TLB ht
-
page fault
Frage 194
Frage
Mutual exclusion can be provided by the:
Antworten
-
binary semaphores
-
none of the above
-
both
-
mutex locks
Frage 195
Frage
If a page table entry is present in the TLB, then it is known as a:
Antworten
-
buffer miss
-
TLB miss
-
page fault
-
TLB hit
Frage 196
Frage
If a page table entry is not in main memory, then it is known as a:
Antworten
-
page fault
-
buffer miss
-
TLB hit
-
TLB miss
Frage 197
Frage
What is a medium-term scheduler?
Antworten
-
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
Frage 198
Frage
In segmentation, each address is specified by (choose two):
Antworten
-
a segment number
-
an offset
-
a value
-
a key
Frage 199
Frage
Which is the ready state of a process?
Antworten
-
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
Frage 200
Frage
Which one of the following is the deadlock avoidance algorithm?