11784647
Descripción
Test por Good Guy Beket, actualizado hace más de 1 año
Más
|
Creado por un usuario eliminado
hace más de 6 años
|
|
|
Copiado por Good Guy Beket
hace más de 6 años
|
|
Pregunta 1
Pregunta
In the blocking send, blocking receive
Respuesta
-
both sender and receiver are blocked until message is delivered
-
none of the above
-
the sending process sends the message and resumes operation
-
the sending process sends the message while receiver is blocked
Pregunta 2
Pregunta
The table _____ contains the base address of each page in physical memory
Respuesta
-
process
-
memory
-
page
-
frame
Pregunta 3
Pregunta
A state is safe, if:
Respuesta
-
the system can allocate resources to each process in some order and still avoid deadlock
-
the system does not crash due to deadlock occurrence
-
the state keeps the system protected and safe
-
all of the above
Pregunta 4
Pregunta
In fixed sized partition, the degree of multiprogramming is bounded by ____
Respuesta
-
the memory size
-
all of the above
-
the number of partitions
-
the CPU utilization
Pregunta 5
Pregunta
_____ is generally faster than _____
Respuesta
-
worst fit, best fit
-
best fit, first fit
-
first fit, best fit
-
none of the above
Pregunta 6
Pregunta
The two atomic operations permissible on semaphores are: (several answer)
Respuesta
-
wait
-
signal
-
hold
-
stop
Pregunta 7
Pregunta
Program:
Respuesta
-
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
Pregunta 8
Pregunta
"Mutual exclusion" condition for deadlock is defined as:
Respuesta
-
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
Pregunta 9
Pregunta
"Hold and wait" condition for a deadlock is defined as:
Respuesta
-
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
Pregunta 10
Pregunta
A monitor is a type of:
Respuesta
-
none of the above
-
high level synchronization construct
-
low level synchronization construct
-
semaphore
Pregunta 11
Pregunta
What is NOT the example of consumable resources?
Respuesta
-
Information in I\O buffers
-
Signals
-
Main memory
-
Messages
Pregunta 12
Pregunta
Which one is a synchronization tool?
Respuesta
-
socket
-
thread
-
pipe
-
semaphore
Pregunta 13
Pregunta
A Process Control Block (PCB) does not contain which of the following?
Respuesta
-
stack
-
data
-
process state
-
bootstrap program
Pregunta 14
Pregunta
With _____ only one process can execute at a time; meanwhile all other process are waiting for the processor. With _____ more than one process can be running simultaneously each on a different processor.
Respuesta
-
Multiprocessing, multiprogramming
-
Uniprogramming, Multiprocessing
-
Multiprogramming, Uniprocessing
-
Multiprogramming, Multiprocessing
Pregunta 15
Pregunta
Memory:
Respuesta
-
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
Pregunta 16
Pregunta
This resource can be safely used by only one process at a time and is not depleted by that use:
Respuesta
-
refurbished resource
-
replenishing resource
-
reusable resource
-
refreshing resource
Pregunta 17
Pregunta
Which of the following condition is required for the deadlock to be possible?
Respuesta
-
mutual exclusion
-
all of the above
-
no resource can be forcibly removed from a process holding it
-
a process may hold allocated resources while awaiting assignment of other resources
Pregunta 18
Pregunta
The _____ is used as an index into the page table
Respuesta
-
page number
-
page offset
-
frame bit
-
frame offset
Pregunta 19
Pregunta
A page fault:
Respuesta
-
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
Pregunta 20
Pregunta
A state of a process is defined by:
Respuesta
-
the activity is just executed by the process
-
the final activity of the process
-
the activity to next be executed by the process
-
the current activity of the process
Pregunta 21
Pregunta
Suppose that a process is in “Blocked” state waiting for some I\O service. When a service is completed, it goes to the:
Respuesta
-
Ready state
-
Running state
-
Terminated state
-
Suspended state
Pregunta 22
Pregunta
The link between two processes P and Q to send and receive a message is called:
Respuesta
-
message-passing link
-
all of the above
-
communication link
-
synchronization link
Pregunta 23
Pregunta
Message passing system allows processes to:
Respuesta
-
share data
-
communicate with one another without resorting to shared data
-
name the recipient or sender of the message
-
communicate with one another by resorting shared data
Pregunta 24
Pregunta
Which of the following statements is false?
Respuesta
-
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
Pregunta 25
Pregunta
The systems which allows only one process execution at a time, are called:
Respuesta
-
unitasking systems
-
uniprocessing systems
-
uniprogramming systems
-
unicasting systems
Pregunta 26
Pregunta
Remote Procedure Calls (RPC) are used:
Respuesta
-
none of the above
-
for communication between two processes on separate systems
-
for communication between two processes on the same systems
-
for communication between two processes remotely different from each other on the same system
Pregunta 27
Pregunta
A minimum of _____ variable(s) is/are required to be shared between processes to solve the critical section problem?
Respuesta
-
two
-
three
-
one
-
four
Pregunta 28
Pregunta
This resource can be created and destroyed
Respuesta
-
resumable resource
-
restartable resource
-
consumable resource
-
finite resource
Pregunta 29
Pregunta
Fixed-length block of data in secondary memory is called:
Respuesta
-
none of the above
-
frames
-
segments
-
pages
Pregunta 30
Pregunta
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 executing, is known as?
Respuesta
-
Multitasking
-
Semaphore
-
Mutual exclusion
-
multiprogramming
Pregunta 31
Pregunta
Every address generated by the CPU is divided into two parts:
Respuesta
-
frame offset
-
page number
-
frame bit
-
page offset
Pregunta 32
Pregunta
Segmentation suffers from external fragmentation?
Respuesta
- True
- False
Pregunta 33
Pregunta
For each process OS creates and manages:
Respuesta
-
Process control block
-
Program code
-
Program
-
Thread control block
Pregunta 34
Pregunta
What is a trap/exception?
Respuesta
-
user generated interrupt caused by an error
-
failure of the system
-
hardware generated interrupt caused by an error
-
software generated interrupt caused by an error
Pregunta 35
Pregunta
What is the reusable resource:
Respuesta
-
none of the above
-
that can be used by more than one process at a time
-
that can be used by one process at a time and is not depleted by that use
-
that can be shared between various threads
Pregunta 36
Pregunta
Interprocess communication:
Respuesta
-
none of the above
-
allows the processes to only synchronize their actions without communication
-
allows processes to communicate and synchronize their actions when using the same address space
-
allows processes to communicate and synchronize their actions without using the same address space
Pregunta 37
Pregunta
Which of the following transitions is not possible?
Respuesta
-
blocked to running
-
running to blocked
-
blocked to ready
-
ready to running
Pregunta 38
Pregunta
Any program, no matter how small, will occupy an entire partition results in:
Respuesta
-
internal fragmentation
-
segmentation
-
paging
-
external fragmentation
Pregunta 39
Pregunta
This matrix defines requirements of processes i for the resources j
Respuesta
-
Allocation matrix
-
Resource matrix
-
Request matrix
-
Claim matrix
Pregunta 40
Pregunta
Several processes access and manipulate the same data concurrently and the outcome of the execution depends on the particular order in which the access takes place, is called a(n) _____
Respuesta
-
Entry section
-
race section
-
shared memory segments
-
process synchronization
Pregunta 41
Pregunta
The context of a process in the PCB of a process DOES NOT contain:
Respuesta
-
context switch time
-
the process state
-
memory-management information
-
the value of the CPU registers
Pregunta 42
Pregunta
External fragmentation will not occur when:
Respuesta
-
no matter which algorithm is used, it will always occur
-
first fit is used
-
best fit is used
-
next fit is used
Pregunta 43
Pregunta
A deadlock avoidance algorithm dynamically examines the _____, to ensure that a circular wait condition can never exist
Respuesta
-
resources
-
operating system
-
resource allocation state
-
system storage state
Pregunta 44
Pregunta
The process control block is:
Respuesta
-
process type variable
-
data structure
-
block in memory
-
secondary storage section
Pregunta 45
Pregunta
This illustrates the progress of two processes competing for two resources:
Respuesta
-
joint process diagram
-
joint ingres diagram
-
joint regress diagram
-
joint progress diagram
Pregunta 46
Pregunta
In a multiprogramming environment:
Respuesta
-
the programs are developed by more than one person
-
more than one process resides in the memory
-
single user can execute many programs at the same time
-
the processor executes more than one process at a time
Pregunta 47
Pregunta
When high priority task is indirectly preempted by medium priority task effectively inverting the relative priority of the two tasks, the scenario is called:
Respuesta
-
priority exchange
-
priority inversion
-
priority removal
-
priority modification
Pregunta 48
Pregunta
Main memory is broken into fixed-sized blocks called _____
Respuesta
-
none of the above
-
pages
-
frames
-
segments
Pregunta 49
Pregunta
The first fit, best fit and worst fit are strategies to select a
Respuesta
-
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
Pregunta 50
Pregunta
The Banker’s algorithm is referred to as
Respuesta
-
denial of service
-
resource allocation denial
-
loan allocation denial
-
resource allocation refusal
Pregunta 51
Pregunta
The code that changes the value of the semaphore is:
Respuesta
-
non-critical section code
-
remainder section code
-
none of the above
-
critical section code
Pregunta 52
Pregunta
The two kinds of semaphores are: (Several answers)
Respuesta
-
mutex
-
counting
-
binary
-
decimal
Pregunta 53
Pregunta
"Circular wait" condition for deadlock is defined as:
Respuesta
-
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
Pregunta 54
Pregunta
Banker’s algorithm for resource allocation deals with:
Respuesta
-
deadlock prevention
-
mutual exclusion
-
deadlock recovery
-
deadlock avoidance
Pregunta 55
Pregunta
What is compaction?
Respuesta
-
a paging technique
-
a technique for overcoming fatal error
-
a technique for overcoming internal fragmentation
-
a technique for overcoming external fragmentation
Pregunta 56
Pregunta
Process is:
Respuesta
-
a job in secondary memory
-
a unit of activity characterized by execution of a sequence of instructions, a current state, and an associated set
-
contents of main memory
-
program in high level language kept on disk
Pregunta 57
Pregunta
A single thread of control allows the process to perform:
Respuesta
-
both
-
only one task at a time
-
multiple tasks at a time
-
none
Pregunta 58
Pregunta
When the memory allocated to a process is slightly larger than a process, then:
Respuesta
-
both will occur
-
external fragmentation occurs
-
internal fragmentation occurs
-
none of the above
Pregunta 59
Pregunta
A problem encountered in multitasking when a process is perpetually denied necessary resources is called:
Respuesta
-
starvation
-
deadlock
-
aging
-
inversion
Pregunta 60
Pregunta
The memory allocation scheme subject to "internal fragmentation" is:
Respuesta
-
segmentation
-
virtual memory segmentation
-
fixed partitioning
-
pure demand paging
Pregunta 61
Pregunta
Which one is deadlock avoidance algorithm?
Respuesta
-
dining philosophers problem
-
elevator algorithm
-
banker’s algorithm
-
round-robin algorithm
Pregunta 62
Pregunta
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?
Respuesta
-
virtual memory
-
segmentation
-
paging
-
partition
Pregunta 63
Pregunta
Variable-length block of data that resides in secondary memory is called:
Respuesta
-
none of the above
-
frames
-
segments
-
pages
Pregunta 64
Pregunta
The memory allocation scheme subject to "external fragmentation" is:
Respuesta
-
segmentation
-
swapping
-
multiple contiguous fixed partitioning
-
pure demand paging
Pregunta 65
Pregunta
Four necessary conditions for deadlock to exist are: mutual exclusion, no-preemption, circular wait and
Respuesta
-
race condition
-
deadlock avoidance
-
hold and wait
-
starvation
Pregunta 66
Pregunta
A binary semaphore is semaphore with integer values: (Several answers)
Respuesta
-
1
-
0
-
-1
-
0.5
Pregunta 67
Pregunta
Program always deals with:
Respuesta
-
logical address
-
physical address
-
relative address
-
absolute address
Pregunta 68
Pregunta
The systems which allows only one process execution at a time, are called
Respuesta
-
uniprogramming systems
-
unitasking systems
-
uniprocessing sysems
-
unicasting systems
Pregunta 69
Pregunta
Swapping:
Respuesta
-
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
Pregunta 70
Pregunta
When several processes access the same data concurrently and the outcome of the execution depends on the particular order in which the access take place, is called:
Respuesta
-
dynamic condition
-
race condition
-
critical condition
-
essential condition
Pregunta 71
Pregunta
If a page table entry is present in the TLB, then it is known as a:
Respuesta
-
buffer miss
-
TLB miss
-
page fault
-
TLB hit
Pregunta 72
Pregunta
With paging there is no _____ fragmentation
Respuesta
-
either type of
-
none of the above
-
external
-
internal
Pregunta 73
Pregunta
The address of a page table in memory is pointed by:
Respuesta
-
page table base register
-
stack pointer
-
page register
-
program counter
Pregunta 74
Pregunta
What is a medium-term scheduler?
Respuesta
-
it selects which process has to be executed next and allocates CPU
-
none of the above
-
it selects which process has to be brought into the ready queue
-
it selects which process has to remove from memory by swapping
Pregunta 75
Pregunta
"No preemption" condition for a deadlock is defined as:
Respuesta
-
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
Pregunta 76
Pregunta
Processor:
Respuesta
-
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
Pregunta 77
Pregunta
Fixed-length block of main memory is called _____
Respuesta
-
frames
-
segments
-
none of the above
-
pages
Pregunta 78
Pregunta
The initial value of the semaphore that allows only one of the many processes to enter their critical section, is?
Respuesta
-
1
-
0
-
2
-
10
Pregunta 79
Pregunta
Mutual exclusion means that:
Respuesta
-
if a process is executing in its critical section, then other processes must be executing in their critical section
-
if a process is executing in its critical section, then all the resources of the system must be blocked until it finishes exclusion
-
if a process is executing in its critical section, then no other process must be executing in their critical sections
-
none of the above
Pregunta 80
Pregunta
For every process there is a _____.
Respuesta
-
pointer to page table
-
copy of page table
-
frame table
-
page table
Pregunta 81
Pregunta
In operating system, each process has its own
Respuesta
-
all of the mentioned
-
address space and global variables
-
set of data
-
program code
Pregunta 82
Pregunta
Listing the sequence of instructions that are executed is called:
Respuesta
-
trace
-
program counter
-
instruction
-
control block
Pregunta 83
Pregunta
The segment of code in which the process may change common variables, update tables, write into files known as:
Respuesta
-
critical section
-
program
-
non-critical section
-
mutual exclusion
Pregunta 84
Pregunta
Deadlock inevitable region can be referred as:
Respuesta
-
fun region
-
fatal region
-
final region
-
false region
Pregunta 85
Pregunta
How to solve a problem of equal-size partitions?
Respuesta
-
unequal-size partitions
-
segmentation
-
compaction
-
virtual memory segmentation
Pregunta 86
Pregunta
Paging?
Respuesta
-
allows multiple programs to reside in separate areas of core at the time
-
is a method of memory allocation by which the program is subdivided into equal portions, or pages and core is subdivided equal portions or blocks
-
is a method of allocating processor time
-
consists of those addresses that may be generated by a processor during execution of a computation
Pregunta 87
Pregunta
In internal fragmentation, memory is internal to a partition and:
Respuesta
-
is not being used
-
none of the above
-
is always used
-
is being used
Pregunta 88
Pregunta
A set of processes is deadlock if:
Respuesta
-
each process is blocked and will remain so forever
-
none of the above
-
all processes are trying to kill each other
-
each process is terminated
Pregunta 89
Pregunta
A memory used to provide a high speed is called?
Respuesta
-
cache
-
main memory
-
disk buffer
-
stack pointer
Pregunta 90
Pregunta
In indirect communication between processes P and Q:
Respuesta
-
there is a mailbox to help communication between P and Q
-
none of the above
-
there is another machine between the two processes to help communication
-
there is another process R to handle and pass on the messages between P and Q
Pregunta 91
Pregunta
Semaphore is a/an _____ to solve the critical section problem?
Respuesta
-
special program for a system
-
complex structure
-
integer variable
-
hardware for a system
Pregunta 92
Pregunta
Which of the following is not the state of a process?
Respuesta
-
new
-
running
-
old
-
ready
Pregunta 93
Pregunta
The address of the next instruction to be executed by the current process is provided by the:
Respuesta
-
pipe
-
program counter
-
CPU registers
-
process stack
Pregunta 94
Pregunta
Which of the following is not true about the memory management?
Respuesta
-
segmentation suffers from external fragmentation
-
paging suffers from internal fragmentation
-
virtual memory is used only in multi-user systems
-
segmented memory can be paged
Pregunta 95
Pregunta
The primary distinction between the short-term scheduler and long-term scheduler is:
Respuesta
-
the length of their queues
-
none of the above
-
the type of processes the schedule
-
the frequency of their execution
Pregunta 96
Pregunta
In the non-blocking send, blocking receive:
Respuesta
-
the sending process sends the message and resumes operation
-
sender continues on, receiver is blocked until the requested message arrives
-
the sending process keeps sending until it receives a message
-
none of the above
Pregunta 97
Pregunta
The objective of multi-programming is to:
Respuesta
-
have multiple programs waiting in a queue ready to run
-
to maximize CPU utilization
-
to minimize CPU utilization
-
all of the above
Pregunta 98
Pregunta
A system is in the safe state if:
Respuesta
-
a. the system can allocate resources to each process in some order and stil avoid a deadlock
-
b. there exist a safe sequence
-
both a and b
-
none of the above
Pregunta 99
Pregunta
When memory is divided into a several fixed sized partitions, each partition may contain _____
Respuesta
-
exactly one process
-
none of the above
-
at least one process
-
multiple processes at once
Pregunta 100
Pregunta
In the non-blocking send, non-blocking receive:
Respuesta
-
the sending process keeps sending until it receives a message
-
neither of processes are required to wait
-
the sending process keeps sending until the message is received
-
the sending process sends the message and resumes operation
Pregunta 101
Pregunta
A process can be terminated due to:
Respuesta
-
fatal error
-
normal exit
-
all of the mentioned
-
killed by another process
Pregunta 102
Pregunta
What is a short-term scheduler?
Respuesta
-
it selects which process has to be executed next and allocates CPU
-
none of the above
-
it selects which process has to be brought into the ready queue
-
it selects which process has to remove from memory by swapping
Pregunta 103
Pregunta
In contiguous memory allocation:
Respuesta
-
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
Pregunta 104
Pregunta
External fragmentation exists when:
Respuesta
-
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
Pregunta 105
Pregunta
CPU fetches the instruction from memory according to the value of?
Respuesta
-
status register
-
program counter
-
instruction register
-
program status word
Pregunta 106
Pregunta
A sequence of instructions, in a computer language, to get the desired result, is known as:
Respuesta
-
algorithm
-
instruction
-
process
-
program
Pregunta 107
Pregunta
Semaphores:
Respuesta
-
are used for memory management
-
synchronize critical resources to prevent deadlock
-
are used to do I/O
-
synchronize critical resources to prevent contention
Pregunta 108
Pregunta
This matrix defines the current allocation to process i of the resource j
Respuesta
-
Allocation matrix
-
Resource matrix
-
Request matrix
-
Claim matrix
Pregunta 109
Pregunta
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
Respuesta
-
memory
-
page
-
frame
-
segment
Pregunta 110
Pregunta
For non-sharable resources like a printer, mutual exclusion:
Respuesta
-
must exist
-
none of the above
-
must not exist
-
may exist
Pregunta 111
Pregunta
If a process is executing in its critical section, then no other processes can be executing in their critical section. This condition is called
Respuesta
-
critical exclusion
-
asynchronous exclusion
-
mutual exclusion
-
synchronous exclusion
Pregunta 112
Pregunta
Interprocess communication:
Respuesta
-
allows process to synchronize activity
-
is never necessary
-
is usually done via disk drives
-
is required for all processes
Pregunta 113
Pregunta
The available vector defines:
Respuesta
-
total amount of resources required for all processes
-
total amount of each resource in the system
-
total amount of each resource allocated to all processes
-
total amount of each resource NOT allocated to any process
Pregunta 114
Pregunta
A task in a blocked state
Respuesta
-
is running
-
is executable
-
must still be placed in the run queues
-
is waiting for same temporarily unavailable resources
Pregunta 115
Pregunta
The systems which allows only one process execution at a time, are called:
Respuesta
-
unitasking systems
-
uniprocessing systems
-
uniprogramming systems
-
none of the above
Pregunta 116
Pregunta
What is NOT an example of reusable resource
Respuesta
-
semaphores
-
processors
-
interrupt
-
i/o channels
Pregunta 117
Pregunta
An un-interruptible unit is known as:
Respuesta
-
single
-
none of the above
-
static
-
atomic
Pregunta 118
Pregunta
How to solve a problem of "external" fragmentation?
Respuesta
-
unequal-size partitions
-
segmentation
-
compaction
-
virtual memory segmentation
Pregunta 119
Pregunta
Runtime mapping from virtual to physical address is done by?
Respuesta
-
CPU
-
none of the above
-
memory management unit
-
PCI
Pregunta 120
Pregunta
A solution to the problem of external fragmentation is:
Respuesta
-
compaction
-
larger memory size
-
unequal size parts
-
smaller memory space
Pregunta 121
Pregunta
in the non-blocking send, non-blocking receive:
Respuesta
-
Neither of processes are required to wait
-
The sending process keeps sending until it receives a message
-
The sending process keeps sending until the message is received
-
The sending process sends the message and resumes operation
Pregunta 122
Pregunta
In segmentation, each address is specified by:
Respuesta
-
A segment number and an offset
-
A page number and an offset
-
A frame number and an offset
-
A segment number and a key
Pregunta 123
Pregunta
Virtual memory takes advantage of:
Respuesta
-
Large secondary memory
-
Modular programming
-
Fast CPU
-
Scheduling
Pregunta 124
Pregunta
Which of the replacement algorithms selects for the next reference is the longest?
Respuesta
-
Optimal
-
LRU
-
Clock
¿Quieres crear tus propios Tests gratis con GoConqr? Más información.