Copiar e Editar

OS | 178 questions [NEW BAZA]

Descrição

Suicidal Operating Systems [Teachers: Teshebayeva Karagoz, Mishina Aigerim ; Final Exam + STATE EXAM] ▼ Quiz sobre OS | 178 questions [NEW BAZA], criado por Good Guy Beket em 28-03-2019.
Good Guy Beket
Quiz por Good Guy Beket, atualizado more than 1 year ago
Good Guy Beket
Criado por Good Guy Beket mais de 5 anos atrás
1051
14
0

Resumo de Recurso

Questão 1

Questão
What is not a main structural element of a computer system?
Responda
  • Processor
  • Main memory
  • System bus
  • Operating bus

Questão 2

Questão
Which of the following element of a computer system controls the operation of the computer and performs its data processing functions?
Responda
  • Processor
  • Main memory
  • System bus
  • I/O modules

Questão 3

Questão
Which of the following element of a computer system moves data between the the computer and its external environment?
Responda
  • Processor
  • Main memory
  • System bus
  • I/O modules

Questão 4

Questão
Which of the following element of a computer system stores data and programs?
Responda
  • Processor
  • Main memory
  • System bus
  • I/O modules

Questão 5

Questão
Which of the following provides for communication among elements of a computer system?
Responda
  • Processor
  • Main memory
  • System bus
  • I/O modules

Questão 6

Questão
Which of the following registers are used by the processor to exchange data with memory?
Responda
  • MAR and MBR
  • I/OAR and I/OBR
  • PC and IR
  • Program status word

Questão 7

Questão
Which of the following registers are used by the processor to exchange data with input/output module?
Responda
  • MAR and MBR
  • I/OAR and I/OBR
  • PC and IR
  • Program status word

Questão 8

Questão
If the required block is not present in the cache then ______ occurs.
Responda
  • cache latency
  • cache hit
  • cache delay
  • cache miss

Questão 9

Questão
In direct mapping the presence of the block in memory is checked with the help of _____ field.
Responda
  • block
  • tag
  • word
  • set

Questão 10

Questão
In fully associative mapping, there are the following fields
Responda
  • tag, word
  • tag, block, word
  • tag, set, word
  • tag, block

Questão 11

Questão
The algorithm to remove and place new contents into the cache is called _______
Responda
  • Replacement algorithm
  • Renewal algorithm
  • Updation
  • Compaction

Questão 12

Questão
The bit used to indicate whether the block was recently used or not is _______
Responda
  • Control bit
  • Reference bit
  • Dirty bit
  • Valid bit

Questão 13

Questão
The correspondence between the main memory blocks and those in the cache is given by _________
Responda
  • Hash function
  • Mapping function
  • Locale function
  • Assign function

Questão 14

Questão
The effectiveness of the cache memory is based on the property of ________</
Responda
  • Locality of reference
  • Memory localisation
  • Memory size
  • Memory access time

Questão 15

Questão
The memory blocks are mapped on to the cache with the help of ______
Responda
  • Hash functions
  • Write policy
  • Replacement policy
  • Mapping functions

Questão 16

Questão
The method of mapping the consecutive memory blocks to consecutive cache blocks is called ______
Responda
  • Set associative
  • Fully associative
  • Direct
  • Indirect

Questão 17

Questão
The reason for the implementation of the cache memory is ________
Responda
  • To increase the internal memory of the system
  • The difference in speeds of operation of the processor and memory
  • To reduce the memory access and cycle time
  • To increase the memory access and cycle time

Questão 18

Questão
The spatial aspect of the locality of reference means ________
Responda
  • That the recently executed instruction is executed again next
  • That the recently executed won’t be executed again
  • That the instruction executed will be executed at a later time
  • That the instruction in close proximity of the instruction executed will be executed in future

Questão 19

Questão
The technique of searching for a block by going through all the tags is ______
Responda
  • Linear search
  • Binary search
  • Associative search
  • Indirect search

Questão 20

Questão
The temporal aspect of the locality of reference means ________
Responda
  • That the recently executed instruction won’t be executed soon
  • That the recently executed instruction is temporarily not referenced
  • That the recently executed instruction will be executed soon again
  • None of the mentioned

Questão 21

Questão
This bit indicates if the slot holds a block belonging to the program being executed
Responda
  • Control bit
  • Reference bit
  • Dirty bit
  • Valid bit

Questão 22

Questão
Which is the fastest cache mapping function?
Responda
  • Direct mapping
  • Set associative mapping
  • Fully associative mapping

Questão 23

Questão
While using the direct mapping technique, in a 16 bit system the higher order 5 bits are used for ________
Responda
  • tag
  • block/slot
  • word
  • ID

Questão 24

Questão
The set-associative map technique is a combination of the direct and associative technique
Responda
  • True
  • False

Questão 25

Questão
We have Ts = average (system) access time T1 = access time of M1 (e.g. cache) T2 = access time of M2 (e.g. main memory) T3 = access time of M3 (e.g. disk) H1 = hit ratio, fraction of time reference is found in M1 H2 = hit ratio, fraction of time reference is found in M2 The average time to access an item, in case the item in cache is:
Responda
  • Ts = H1 × T1
  • Ts = H1 × T1 + (1 — H1) × (T1 + T2)
  • Ts = H1 × T1 + H1 × T2
  • Ts = H1 × (T1 + T2)

Questão 26

Questão
We have Ts = average (system) access time T1 = access time of M1 (e.g. cache) T2 = access time of M2 (e.g. main memory) T3 = access time of M3 (e.g. disk) H1 = hit ratio, fraction of time reference is found in M1 H2 = hit ratio, fraction of time reference is found in M2 The average time to access an item, in case the item in main memory is:
Responda
  • Ts = H1 × T1
  • Ts = H1 × T1 + (1 - H1) × (T1 + T2)
  • Ts = H1 × T1 + H1 × T2
  • Ts = H1 × (T1 + T2)

Questão 27

Questão
We have Ts = average (system) access time T1 = access time of M1 (e.g. cache) T2 = access time of M2 (e.g. main memory) T3 = access time of M3 (e.g. disk) H1 = hit ratio, fraction of time reference is found in M1 H2 = hit ratio, fraction of time reference is found in M2 The average time to access an item, in case the item in disk is:
Responda
  • Ts = H1 × T1 + H2 × T2 + (1 — H2) × T3
  • Ts = H1 × T1 + (1 - H1) × (H1 × T1 + H2 × (T1 + T2) + (1 — H2) × (T2 + T3))
  • Ts = H1 × T1 + (1 — H1) × H2 × (T2 + T3)
  • Ts = H1 × T1 + (1 — H1) × (H2 × (T1 + T2) + (1 — H2) × (T1 + T2 + T3))

Questão 28

Questão
All processes share a semaphore variable mutex, initialized to 1. Each process must execute wait(mutex) before entering the critical section and signal(mutex) afterward. Suppose a process executes in the following manner: singal (mutex); critical section; wait (mutex); In this situation:
Responda
  • a deadlock will occur
  • processes will starve to enter critical section
  • several processes maybe executing in their critical section
  • only one process allowed to enter the critical section

Questão 29

Questão
All processes share a semaphore variable mutex, initialized to 1. Each process must execute wait(mutex) before entering the critical section and signal(mutex) afterward. Suppose a process executes in the following manner: wait (mutex); critical section; wait (mutex); In this situation:
Responda
  • a deadlock will occur
  • processes will starve to enter critical section
  • several processes maybe executing in their critical section
  • only one process allowed to enter the critical section

Questão 30

Questão
At a particular time of computation the value of a counting semaphore is 7.Then 20 V operations and 15 P operations were completed on this semaphore. The resulting value of the semaphore is:
Responda
  • 2
  • 12
  • 42
  • 7

Questão 31

Questão
At a particular time of computation the value of a counting semaphore is 7.Then 20 P operations and 15 V operations were completed on this semaphore. The resulting value of the semaphore is
Responda
  • 42
  • 2
  • 7
  • 12

Questão 32

Questão
The program follows to use a shared binary semaphore T Process A int Y; A1 : Y = X × 2; A2 : X = Y; signal (T); Process B int Z; B1 : wait (T); B2 : Z = X+1; X = Z; T is set to 0 before either process begins execution and, as before, X is set to 5. Now, how many different values of X are possible after both processes finish executing ?
Responda
  • one
  • two
  • three
  • four

Questão 33

Questão
The following pair of processes share a common variable X Process A int Y; A1 : Y = X × 2; A2 : X = Y; Process B int Z; B1: Z = X+1; B2: X = Z; X is set to 5 before either process begins execution. As usual, statements within a process are executed sequentially, but statements in process A may execute in any order with respect to statements in process B. Which possible execution path gives X=11
Responda
  • A1 A2 B1 B2
  • A1 B1 A2 B2
  • A1 B1 B2 A2
  • B1 B2 A1 A2

Questão 34

Questão
The following pair of processes share a common variable X Process A int Y; A1 : Y = X × 2; A2 : X = Y; Process B int Z; B1: Z = X+1; B2: X = Z; X is set to 5 before either process begins execution. As usual, statements within a process are executed sequentially, but statements in process A may execute in any order with respect to statements in process B. Which possible execution path gives X=6
Responda
  • A1 B1 A2 B2
  • A1 B1 B2 A2
  • B1 A1 B2 A2
  • B1 B2 A1 A2

Questão 35

Questão
The following pair of processes share a common variable X Process A int Y; A1 : Y = X × 2; A2 : X = Y; Process B int Z; B1: Z = X+1; B2: X = Z; X is set to 5 before either process begins execution. As usual, statements within a process are executed sequentially, but statements in process A may execute in any order with respect to statements in process B. Which possible execution path gives X=6?
Responda
  • B1 A1 B2 A2
  • B1 A1 A2 B2
  • B1 B2 A1 A2
  • A1 A2 B1 B2

Questão 36

Questão
The following pair of processes share a common variable X Process A int Y; A1 : Y = X × 2; A2 : X = Y; Process B int Z; B1: Z = X+1; B2: X = Z; X is set to 5 before either process begins execution. As usual, statements within a process are executed sequentially, but statements in process A may execute in any order with respect to statements in process B. Which possible execution path gives X=12?
Responda
  • A1 A2 B1 B2
  • B1 A1 B2 A2
  • B1 A1 A2 B2
  • B1 B2 A1 A2

Questão 37

Questão
The following pair of processes share a common variable X Process A int Y; A1 : Y = X × 2; A2 : X = Y; Process B int Z; B1: Z = X+1; B2: X = Z; X is set to 5 before either process begins execution. As usual, statements within a process are executed sequentially, but statements in process A may execute in any order with respect to statements in process B. Which possible execution path gives X=10?
Responda
  • A1 A2 B1 B2
  • A1 B1 B2 A2
  • B1 A1 A2 B2
  • B1 B2 A1 A2

Questão 38

Questão
The following pair of processes share a common variable X Process A int Y; A1 : Y = X × 2; A2 : X = Y; Process B int Z; B1: Z = X+1; B2: X = Z; X is set to 5 before either process begins execution. As usual, statements within a process are executed sequentially, but statements in process A may execute in any order with respect to statements in process B. Which possible execution path gives X=10?
Responda
  • A1 B1 A2 B2
  • B1 A1 B2 A2
  • B1 A1 A2 B2
  • B1 B2 A1 A2

Questão 39

Questão
Computer programmers are often concerned with synchronization constraints, which are requirements pertaining to the order of events. They are:
Responda
  • Serialization and Mutual exclusion
  • Queueing and dispatching
  • Scheduling and dispatching
  • Serialization and Mutual inclusion

Questão 40

Questão
Concurrent writes:
Responda
  • x is a shared variable accessed by two writers
  • x is a local variable accessed by two writers
  • x is a shared variable accessed by two readers
  • x is a shared variable accessed by one writer and one reader

Questão 41

Questão
If it is not possible to tell, by looking at the program, what will happen when it executes, then the program is
Responda
  • non-deterministic
  • non-distributed
  • non-deadlocked
  • non-divisible

Questão 42

Questão
sem.signal () ...
Responda
  • decrements the semaphore
  • increments the semaphore
  • reads the semaphore
  • initializes the semaphore

Questão 43

Questão
sem.wait () ...
Responda
  • decrements the semaphore
  • increments the semaphore
  • reads the semaphore
  • initializes the semaphore

Questão 44

Questão
Semaphore operation sem.P( ) is alternative to
Responda
  • sem.signal
  • sem.wait
  • semaphore initialization
  • semaphore read

Questão 45

Questão
Semaphore operation sem.V( ) is alternative to
Responda
  • sem.signal ( )
  • sem.wait( )
  • semaphore initialization
  • semaphore read

Questão 46

Questão
Semaphores were invented by
Responda
  • Edsger Dijkstra
  • Tim Berners-Lee
  • Vint Cerf
  • Leonard Kleinrock

Questão 47

Questão
Two events are ______________ if we cannot tell by looking at the program which will happen first
Responda
  • Concurrent
  • Constrained
  • Sequential
  • Mutually excluded

Questão 48

Questão
Block size is:
Responda
  • the unit of data exchanged between cache and main memory
  • the unit of data exchanged between cache and registers
  • the unit of data exchanged between registers and main memory
  • the unit of data exchanged between cache and secondary memory

Questão 49

Questão
If the accessed word is found in the faster memory, that is defined as a:
Responda
  • hit
  • win
  • bingo
  • evrika

Questão 50

Questão
If the accessed word is not found in the faster memory, that is defined as a:
Responda
  • miss
  • loss
  • ricochet
  • zero

Questão 51

Questão
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:
Responda
  • write policy
  • locality of reference
  • replacement algorithm
  • mapping function

Questão 52

Questão
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:
Responda
  • cache size
  • write policy
  • locality of reference
  • replacement algorithm

Questão 53

Questão
This determines which cache location the block will occupy:
Responda
  • mapping function
  • write policy
  • locality of reference
  • block size

Questão 54

Questão
When a processor attempts to read a byte or word of memory, it firstly checks the:
Responda
  • Cache
  • Main memory
  • Disk
  • CD

Questão 55

Questão
Which of the following statements is false:
Responda
  • compaction does not involve relocation of programs
  • compaction is also known as garbage collection
  • the system must stop everything while it performs the compaction
  • the technique of storage compaction involves moving all occupied areas of storage to one end or other of main storage

Questão 56

Questão
Memory:
Responda
  • is the device where information is stored
  • is a device that performs a sequence of operations specified by instructions in memory
  • is a sequence of instructions
  • is typically characterized by interactive processing and time-slicing of the CPU's time to allow quick response to each user

Questão 57

Questão
Processor:
Responda
  • is the device where information is stored
  • is a device that performs a sequence of operations specified by instructions in memory
  • is a sequence of instructions
  • is typically characterized by interactive processing and time-slicing of the CPU's time to allow quick response to each user

Questão 58

Questão
Program:
Responda
  • is the device where information is stored
  • is a sequence of 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

Questão 59

Questão
The memory allocation scheme subject to "external" fragmentation is?
Responda
  • segmentation
  • swapping
  • multiple contiguous fixed partitions
  • pure demand paging

Questão 60

Questão
The memory allocation scheme subject to "internal" fragmentation is?
Responda
  • fixed partitioning
  • segmentation
  • virtual memory segmentation
  • pure demand paging

Questão 61

Questão
Any program, no matter how small, will occupy an entire partition results in?
Responda
  • internal fragmentation
  • segmentation
  • external fragmentation
  • paging

Questão 62

Questão
How to solve problem of equal-size partitions?
Responda
  • unequal-size partitions
  • segmentation
  • virtual memory segmentation
  • compaction

Questão 63

Questão
How to solve problem of "external" fragmentation?
Responda
  • compaction
  • segmentation
  • virtual memory segmentation
  • unequal-size partitions

Questão 64

Questão
A page fault?
Responda
  • is an access to a page not currently in memory
  • is an error is a specific page
  • occurs when a program accesses a page of memory
  • is a reference to a page belonging to another program

Questão 65

Questão
Which of the following statements is false?
Responda
  • internal fragmentation is increased with small pages
  • a small page size causes large page tables
  • a large page size causes instructions and data that will not be referenced brought into primary storage
  • I/O transfers are more efficient with large pages

Questão 66

Questão
Swapping:
Responda
  • allows each program in turn to use the memory
  • allows many programs to use memory simultaneously
  • does not work with overlaying
  • none of the above

Questão 67

Questão
Swapping:
Responda
  • transferring processes between main memory and secondary memory
  • allows many programs to use memory simultaneously
  • allocate processes in the smallest block of memory
  • none of the above

Questão 68

Questão
Which of the following is not true about the memory management?
Responda
  • virtual memory is used only in multi-user systems
  • segmentation suffers from external fragmentation
  • paging suffers from internal fragmentation
  • segmented memory can be paged

Questão 69

Questão
Segmentation suffers from external fragmentation?
Responda
  • True
  • False

Questão 70

Questão
Paging suffers from external fragmentation?
Responda
  • True
  • False

Questão 71

Questão
Paging ...
Responda
  • 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
  • consists of those addresses that may be generated by a processor during execution of a computation
  • is a method of allocating processor time
  • allows multiple programs to reside in separate areas of core at the time

Questão 72

Questão
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?
Responda
  • paging
  • partition
  • segmentation
  • virtual memory

Questão 73

Questão
In memory systems, boundary registers?
Responda
  • track the beginning and ending of programs
  • are only necessary with unequal-length partitions
  • are only necessary with fixed partitions
  • are used for temporary program variable storage

Questão 74

Questão
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?
Responda
  • mutual exclusion
  • semaphore
  • multiprogramming
  • multitasking

Questão 75

Questão
CPU fetches the instruction from memory according to the value of?
Responda
  • program counter
  • status register
  • instruction register
  • program status word

Questão 76

Questão
A memory used to provide a high speed is called?
Responda
  • cache
  • stack pointer
  • disk buffer
  • main memory

Questão 77

Questão
Which one of the following is the address generated by CPU?
Responda
  • logical address
  • physical address
  • absolute address
  • none of the above

Questão 78

Questão
Runtime mapping from virtual to physical address is done by?
Responda
  • memory management unit
  • CPU
  • PCI
  • none of the above

Questão 79

Questão
The address of a page table in memory is pointed by:
Responda
  • page table base register
  • stack pointer
  • page register
  • program counter

Questão 80

Questão
Program always deals with:
Responda
  • logical address
  • physical address
  • absolute address
  • relative address

Questão 81

Questão
What is compaction?
Responda
  • a technique for overcoming external fragmentation
  • a paging technique
  • a technique for overcoming internal fragmentation
  • a technique for overcoming fatal error

Questão 82

Questão
Operating System maintains the page table for:
Responda
  • each process
  • each thread
  • each instruction
  • each address

Questão 83

Questão
In contiguous memory allocation:
Responda
  • each process is contained in a single contiguous section of memory
  • all processes are contained in a single contiguous section of memory
  • the memory space is contiguous
  • none of the above

Questão 84

Questão
When memory is divided into several fixed sized partitions, each partition may contain ________.
Responda
  • exactly one process
  • at least one process
  • multiple processes at once
  • none of the above

Questão 85

Questão
In fixed sized partition, the degree of multiprogramming is bounded by ___________.
Responda
  • the number of partitions
  • the CPU utilization
  • the memory size
  • all of the above

Questão 86

Questão
The first fit, best fit and worst fit are strategies to select a ______.
Responda
  • free hole from a set of available holes
  • process from a queue to put in memory
  • processor to run the next process
  • all of the above

Questão 87

Questão
In internal fragmentation, memory is internal to a partition and:
Responda
  • is not being used
  • is being used
  • is always used
  • none of the above

Questão 88

Questão
A solution to the problem of external fragmentation is:
Responda
  • compaction
  • larger memory space
  • smaller memory space
  • unequal size parts

Questão 89

Questão
__________ is generally faster than _________ .
Responda
  • first fit, best fit
  • best fit, first fit
  • worst fit, best fit
  • none of the above

Questão 90

Questão
External fragmentation exists when:
Responda
  • enough total memory exists to satisfy a request but it is not contiguous
  • the total memory is insufficient to satisfy a request
  • a request cannot be satisfied even when the total memory is free
  • none of the above

Questão 91

Questão
External fragmentation will not occur when:
Responda
  • no matter which algorithm is used, it will always occur
  • first fit is used
  • best fit is used
  • next fit is used

Questão 92

Questão
When the memory allocated to a process is slightly larger than the process, then:
Responda
  • internal fragmentation occurs
  • external fragmentation occurs
  • both will occur
  • none of the above

Questão 93

Questão
Main memory is broken into fixed-sized blocks called ________.
Responda
  • frames
  • pages
  • segments
  • none of the above

Questão 94

Questão
Fixed-length block of data in secondary memory is called ________.
Responda
  • frames
  • pages
  • segments
  • none of the above

Questão 95

Questão
Variable-length block of data that resides in secondary memory is called ________.
Responda
  • frames
  • pages
  • segments
  • none of the above

Questão 96

Questão
Every address generated by the CPU is divided into two parts:
Responda
  • page number
  • page offset
  • frame bit
  • frame offset

Questão 97

Questão
The __________ is used as an index into the page table.
Responda
  • page number
  • frame bit
  • page offset
  • frame offset

Questão 98

Questão
The _____ table contains the base address of each page in physical memory.
Responda
  • page
  • process
  • memory
  • frame

Questão 99

Questão
With paging there is no ________ fragmentation.
Responda
  • external
  • internal
  • either type of
  • none of the above

Questão 100

Questão
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.
Responda
  • frame
  • page
  • segment
  • memory

Questão 101

Questão
For every process there is a __________.
Responda
  • page table
  • copy of page table
  • pointer to page table
  • frame table

Questão 102

Questão
If a page number is not found in the TLB, then it is known as a:
Responda
  • TLB miss
  • buffer miss
  • TLB hit
  • page fault

Questão 103

Questão
If a page table entry is present in the TLB, then it is known as a:
Responda
  • TLB miss
  • buffer miss
  • TLB hit
  • page fault

Questão 104

Questão
If a page table entry is not in main memory, then it is known as a:
Responda
  • TLB miss
  • buffer miss
  • TLB hit
  • page fault

Questão 105

Questão
When free memory is split into many unconnected pieces we call it:
Responda
  • Internal fragmentation
  • External fragmentation
  • Compaction
  • Memory distribution

Questão 106

Questão
Memory partitioning algorithm that uses binary tree as a data structure is called:
Responda
  • First-fit algorithm
  • Next-fit algorithm
  • Buddy system
  • Best-fit algorithm

Questão 107

Questão
Which of the following is not a principle of storage management responsibilities?
Responda
  • Process isolation
  • Process termination
  • Protection and access control
  • Automatic allocation and management

Questão 108

Questão
This algorithm reduces the rate of production of small gaps
Responda
  • Best fit
  • Worst fit
  • First fit
  • Next fit

Questão 109

Questão
This is the fastest algorithm because it searches as little as possible
Responda
  • Best fit
  • Worst fit
  • First fit
  • Next fit

Questão 110

Questão
This algorithm is slow, and may even tend to fill up memory with tiny useless holes
Responda
  • Best fit
  • Worst fit
  • First fit
  • Next fit

Questão 111

Questão
To find a free partition this algorithm starts searching from where it left off, not from the beginning
Responda
  • Best fit
  • Worst fit
  • First fit
  • Next fit

Questão 112

Questão
In segmentation, each address is specified by (choose two):
Responda
  • a segment number
  • an offset
  • a value
  • a key

Questão 113

Questão
A binary semaphore is a semaphore with integer values::A binary semaphore is a semaphore with integer values
Responda
  • 1 and 0
  • 1 and -1
  • 0 and -1
  • 1 and 2

Questão 114

Questão
A monitor is a type of
Responda
  • binary semaphore
  • low level synchronization construct
  • high level synchronization construct
  • general semaphore

Questão 115

Questão
A monitor is a type of
Responda
  • high level synchronization construct
  • deadlock
  • low level synchronization construct
  • none of the above

Questão 116

Questão
A mutex
Responda
  • is a hexadecimal value
  • must be accessed from only one process
  • can be accessed from multiple processes
  • cannot be accessed by processes

Questão 117

Questão
A procedure defined within a ________ can access only those variables declared locally within the _______ and its formal parameters
Responda
  • process, semaphore
  • process, monitor
  • semaphore, semaphore
  • monitor, monitor

Questão 118

Questão
A semaphore
Responda
  • is a binary mutex
  • must be accessed from only one process
  • can be accessed from multiple processes
  • is a data structure

Questão 119

Questão
A set of processes is deadlock if:
Responda
  • each process is blocked and will remain so forever
  • each process is terminated
  • all processes are trying to kill each other
  • none of the above

Questão 120

Questão
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:
Responda
  • race condition
  • data consistency
  • starvation
  • mutual exclusion

Questão 121

Questão
An un-interruptible unit is known as
Responda
  • single
  • atomic
  • static
  • safe

Questão 122

Questão
An un-interruptible unit is known as
Responda
  • atomic
  • single
  • static
  • None of the above

Questão 123

Questão
Concurrent access to shared data may result in::Concurrent access to shared data may result in
Responda
  • data consistency
  • data insecurity
  • data inconsistency
  • data complexity

Questão 124

Questão
Four necessary conditions for deadlock to exist are: mutual exclusion, no-preemption, circular wait and
Responda
  • hold and wait
  • deadlock avoidance
  • race condition
  • starvation

Questão 125

Questão
If a process is executing in its critical section, then no other processes can be executing in their critical section. This condition is called
Responda
  • mutual exclusion
  • critical exclusion
  • synchronous exclusion
  • asynchronous exclusion

Questão 126

Questão
If no process is suspended, the signal operation
Responda
  • puts the system into a deadlock state
  • suspends some default process' execution
  • nothing happens
  • the output is unpredictable

Questão 127

Questão
In indirect communication between processes P and Q:
Responda
  • there is a mailbox to help communication between P and Q
  • there is another process R to handle and pass on the messages between P and Q
  • there is another machine between the two processes to help communication
  • none of the above

Questão 128

Questão
In the blocking send, blocking receive:
Responda
  • the sending process sends the message and resumes operation
  • the sending process sends the message while receiver is blocked
  • both sender and receiver are blocked until message is delivered
  • none of the above

Questão 129

Questão
In the non-blocking send, blocking receive:
Responda
  • 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

Questão 130

Questão
In the non-blocking send, non-blocking receive:
Responda
  • the sending process sends the message and resumes operation
  • the sending process keeps sending until the message is received
  • the sending process keeps sending until it receives a message
  • neither of processes are required to wait

Questão 131

Questão
In the non-blocking send:
Responda
  • the sending process sends the message and resumes operation
  • the sending process keeps sending until the message is received
  • the sending process keeps sending until it receives a message
  • none of the above

Questão 132

Questão
Interprocess communication:
Responda
  • 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

Questão 133

Questão
Mutual exclusion can be provided by the
Responda
  • mutex locks
  • binary semaphores
  • both mutex locks and binary semaphores
  • none of the mentioned

Questão 134

Questão
Mutual exclusion can be provided by the
Responda
  • mutex locks
  • binary semaphores
  • both
  • none of the above

Questão 135

Questão
Mutual exclusion implies that
Responda
  • if a process is executing in its critical section, then no other process must be executing in their critical sections
  • if a process is executing in its critical section, then other processes must be executing in their critical sections
  • if a process is executing in its critical section, then all the resources of the system must be blocked until it finishes execution
  • if a process is executing in its critical section, then all the resources of the system must be unblocked until it finishes execution

Questão 136

Questão
Mutual exclusion means that?
Responda
  • if a process is executing in its critical section, then no other process must be executing in their critical sections
  • if a process is executing in its critical section, then other processes must be executing in their critical sections
  • if a process is executing in its critical section, then all the resources of the system must be blocked until it finishes execution
  • None of the above

Questão 137

Questão
Part of a program where the shared memory is accessed and which should be executed invisibly, is called:
Responda
  • critical section
  • mutual exclusion
  • semaphores
  • directory

Questão 138

Questão
Semaphore is a/an _______ to solve the critical section problem?
Responda
  • integer variable
  • hardware for a system
  • special program for a system
  • complex structure

Questão 139

Questão
Semaphores are mostly used to implement
Responda
  • System calls
  • Interprocess communication mechanisms
  • System protection
  • Interrupts

Questão 140

Questão
Semaphores:
Responda
  • synchronize critical resources to prevent deadlock
  • synchronize critical resources to prevent contention
  • are used to do I/O
  • are used for memory management

Questão 141

Questão
The bounded buffer problem is also known as
Responda
  • Readers - Writers problem
  • Dining - Philosophers problem
  • Producer - Consumer problem
  • Banker's algorithm

Questão 142

Questão
The code that changes the value of the semaphore is:
Responda
  • critical section code
  • remainder section code
  • non - critical section code
  • None of the above

Questão 143

Questão
The initial value of the semaphore that allows only one of the many processes to enter their critical sections, is?
Responda
  • 1
  • 0
  • 2
  • 10

Questão 144

Questão
The link between two processes P and Q to send and receive messages is called:
Responda
  • communication link
  • message-passing link
  • synchronization link
  • all of the above

Questão 145

Questão
The monitor construct ensures that
Responda
  • only one process can be active at a time within the monitor
  • n number of processes can be active at a time within the monitor (n being greater than 1)
  • the queue has only one process in it at a time
  • all of the mentioned

Questão 146

Questão
The operations that can be invoked on a condition variable are
Responda
  • wait & signal
  • hold & wait
  • signal & hold
  • continue & signal

Questão 147

Questão
The process invoking the wait operation is
Responda
  • suspended until another process invokes the signal operation
  • waiting for another process to complete before it can itself call the signal operation
  • stopped until the next process in the queue finishes execution
  • increments the semaphore value

Questão 148

Questão
The segment of code in which the process may change common variables, update tables, write into files is known as?
Responda
  • critical section
  • program
  • mutual exclusion
  • non-critical section

Questão 149

Questão
The two atomic operations permissible on semaphores are
Responda
  • wait, signal
  • stop, start
  • hold, wait
  • wait, call

Questão 150

Questão
If the semaphore value is negative
Responda
  • its magnitude is the number of processes waiting on that semaphore
  • it is invalid
  • it is reinitialized to 0
  • its magnitude is the number of processes allowed to enter the critical section

Questão 151

Questão
two kinds of semaphores are
Responda
  • mutex &; counting
  • binary & counting
  • counting & decimal
  • decimal & binary

Questão 152

Questão
To avoid the race condition, the number of processes that may be simultaneously inside their critical section is
Responda
  • 1
  • 10
  • 0
  • 2

Questão 153

Questão
To enable a process to wait within the monitor
Responda
  • a condition variable must be declared as condition
  • condition variables must be used as boolean objects
  • semaphore must be used
  • all of the mentioned

Questão 154

Questão
What is a trap/exception?
Responda
  • software generated interrupt caused by an error
  • hardware generated interrupt caused by an error
  • user generated interrupt caused by an error
  • failure of the system

Questão 155

Questão
When several processes access the same data concurrently and the outcome of the execution depends on the particular order in which the access takes place, is called
Responda
  • race condition
  • dynamic condition
  • essential condition
  • critical condition

Questão 156

Questão
Which of the following are TRUE for direct communication
Responda
  • A communication link can be associated with N number of process(N = max. number of processes supported by system)
  • A communication link can be associated with exactly two processes
  • Exactly N/2 links exist between each pair of processes(N = max. number of processes supported by system)
  • Exactly two link exists between each pair of processes

Questão 157

Questão
Index register, segment register, and stack register are example of:
Responda
  • Data registers
  • Address registers
  • Control registers
  • Status registers

Questão 158

Questão
The processor contains a single data register, called
Responda
  • AC
  • PC
  • IR
  • PSW

Questão 159

Questão
This register contains the data to be written into memory or which receives the data read from memory
Responda
  • Memory buffer register
  • Memory address register
  • I/OAR
  • I/OBR

Questão 160

Questão
This register is used for the exchange of data between an I/O module and the processor
Responda
  • Memory buffer register
  • Memory address register
  • I/OAR
  • I/OBR

Questão 161

Questão
This register specifies a particular input/output device
Responda
  • Memory buffer register
  • Memory address register
  • I/OAR
  • I/OBR

Questão 162

Questão
This register specifies the location in memory for the next read or write
Responda
  • Memory buffer register
  • Memory address register
  • I/OAR
  • I/OBR

Questão 163

Questão
Which register contains condition codes set by the processor hardware as the result of operations?{
Responda
  • Program status word
  • Program counter
  • Stack pointer
  • Accumulator

Questão 164

Questão
Which register contains the address of the next instruction to be fetched?
Responda
  • Program counter
  • Instruction register
  • Execution register
  • Process counter

Questão 165

Questão
Which register contains the instruction most recently fetched?
Responda
  • Program counter
  • Instruction register
  • Execution register
  • Process counter

Questão 166

Questão
Control and status registers control the operation of the processor and the execution of programs
Responda
  • True
  • False

Questão 167

Questão
User-visible registers minimize main memory references by optimizing register use
Responda
  • True
  • False

Questão 168

Questão
Virtual memory takes advantage of
Responda
  • Fast CPU
  • Large secondary memory
  • Modular programming
  • Scheduling

Questão 169

Questão
Which of the replacement algorithms selects for replacement that page for which the time to the next reference is the longest?
Responda
  • optimal
  • LRU
  • FIFO
  • Clock

Questão 170

Questão
What does process page table entry contain?
Responda
  • physical address of the page in secondary memory
  • virtual address of the page that is used by program
  • the frame number of corresponding page in main memory
  • size of the process

Questão 171

Questão
Which of the replacement algorithms replaces the page in memory that has not been referenced for the longest time?
Responda
  • optimal
  • LRU
  • FIFO
  • Clock

Questão 172

Questão
Which of the replacement algorithms treats the page frames allocated to a process as a circular buffer?
Responda
  • optimal
  • LRU
  • FIFO
  • Clock

Questão 173

Questão
What is the real address?
Responda
  • a physical address in main memory
  • a virtual address in main memory
  • a virtual address in secondary memory
  • a physical address in cache memory

Questão 174

Questão
What is virtual address?
Responda
  • The address of a storage location in virtual memory.
  • The address of a storage location in real memory.
  • The address of a storage location in cache memory.
  • The address of a storage location in main memory.

Questão 175

Questão
The size of virtual storage is limited by...
Responda
  • the actual number of main storage locations
  • the amount of main memory and secondary memory
  • the addressing scheme of the computer system and by the amount of secondary memory
  • the number of processors in a system

Questão 176

Questão
What is the resident set of the process?
Responda
  • The portion of a process that is in a secondary memory at any time.
  • The portion of a process that is actually in main memory at any time.
  • The portion of a secondary memory that contains pages or segments of particular application.
  • The set of physical addresses.

Questão 177

Questão
When does processor generate an interrupt indicating a memory access fault? {
Responda
  • If it encounters a logical address that is not in main memory.
  • If it encounters a logical address that is not in secondary memory.
  • If it encounters a logical address that is not in cache memory.
  • If there is no enough free memory for the running application.

Questão 178

Questão
What is trashing? {
Responda
  • Saving time by swapping unused pieces of process out of the memory.
  • Guessing, based on recent history, which pieces are least likely to be used in the near future.
  • Condition when the system spends most of is time swapping pieces rather than executing instructions.
  • Assumption that only a few pieces of a process will be needed over a short period of time.

Quer criar seus próprios Quizzes gratuitos com a GoConqr? Saiba mais.

Semelhante

Anatomy and Physiology
pressey_property
Microbiology MCQs 3rd Year Final- PMU
Med Student
Science Final Study Guide
Caroline Conlan
APUSH End-of-Year Cram Exam: Set 1
Nathaniel Rodriguez
sec + final
maxwell3254
CCNA Security Final Exam
Maikel Degrande
CCNP TShoot Final
palciny
Macroeconomics Final
Koda M
Architecture
lindsey.reynolds
Components of An Operating System - Jason Madappattu
Jason EM
audio electronics
Lillian Mehler
Explore a Biblioteca