Kopieren und bearbeiten

OS | 178 questions [NEW BAZA]

Beschreibung

Suicidal Operating Systems [Teachers: Teshebayeva Karagoz, Mishina Aigerim ; Final Exam + STATE EXAM] ▼ Quiz am OS | 178 questions [NEW BAZA], erstellt von Good Guy Beket am 28/03/2019.
Good Guy Beket
Quiz von Good Guy Beket, aktualisiert more than 1 year ago
Good Guy Beket
Erstellt von Good Guy Beket vor etwa 5 Jahre
1008
14
0

Zusammenfassung der Ressource

Frage 1

Frage
What is not a main structural element of a computer system?
Antworten
  • Processor
  • Main memory
  • System bus
  • Operating bus

Frage 2

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

Frage 3

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

Frage 4

Frage
Which of the following element of a computer system stores data and programs?
Antworten
  • Processor
  • Main memory
  • System bus
  • I/O modules

Frage 5

Frage
Which of the following provides for communication among elements of a computer system?
Antworten
  • Processor
  • Main memory
  • System bus
  • I/O modules

Frage 6

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

Frage 7

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

Frage 8

Frage
If the required block is not present in the cache then ______ occurs.
Antworten
  • cache latency
  • cache hit
  • cache delay
  • cache miss

Frage 9

Frage
In direct mapping the presence of the block in memory is checked with the help of _____ field.
Antworten
  • block
  • tag
  • word
  • set

Frage 10

Frage
In fully associative mapping, there are the following fields
Antworten
  • tag, word
  • tag, block, word
  • tag, set, word
  • tag, block

Frage 11

Frage
The algorithm to remove and place new contents into the cache is called _______
Antworten
  • Replacement algorithm
  • Renewal algorithm
  • Updation
  • Compaction

Frage 12

Frage
The bit used to indicate whether the block was recently used or not is _______
Antworten
  • Control bit
  • Reference bit
  • Dirty bit
  • Valid bit

Frage 13

Frage
The correspondence between the main memory blocks and those in the cache is given by _________
Antworten
  • Hash function
  • Mapping function
  • Locale function
  • Assign function

Frage 14

Frage
The effectiveness of the cache memory is based on the property of ________</
Antworten
  • Locality of reference
  • Memory localisation
  • Memory size
  • Memory access time

Frage 15

Frage
The memory blocks are mapped on to the cache with the help of ______
Antworten
  • Hash functions
  • Write policy
  • Replacement policy
  • Mapping functions

Frage 16

Frage
The method of mapping the consecutive memory blocks to consecutive cache blocks is called ______
Antworten
  • Set associative
  • Fully associative
  • Direct
  • Indirect

Frage 17

Frage
The reason for the implementation of the cache memory is ________
Antworten
  • 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

Frage 18

Frage
The spatial aspect of the locality of reference means ________
Antworten
  • 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

Frage 19

Frage
The technique of searching for a block by going through all the tags is ______
Antworten
  • Linear search
  • Binary search
  • Associative search
  • Indirect search

Frage 20

Frage
The temporal aspect of the locality of reference means ________
Antworten
  • 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

Frage 21

Frage
This bit indicates if the slot holds a block belonging to the program being executed
Antworten
  • Control bit
  • Reference bit
  • Dirty bit
  • Valid bit

Frage 22

Frage
Which is the fastest cache mapping function?
Antworten
  • Direct mapping
  • Set associative mapping
  • Fully associative mapping

Frage 23

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

Frage 24

Frage
The set-associative map technique is a combination of the direct and associative technique
Antworten
  • True
  • False

Frage 25

Frage
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:
Antworten
  • Ts = H1 × T1
  • Ts = H1 × T1 + (1 — H1) × (T1 + T2)
  • Ts = H1 × T1 + H1 × T2
  • Ts = H1 × (T1 + T2)

Frage 26

Frage
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:
Antworten
  • Ts = H1 × T1
  • Ts = H1 × T1 + (1 - H1) × (T1 + T2)
  • Ts = H1 × T1 + H1 × T2
  • Ts = H1 × (T1 + T2)

Frage 27

Frage
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:
Antworten
  • 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))

Frage 28

Frage
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:
Antworten
  • 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

Frage 29

Frage
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:
Antworten
  • 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

Frage 30

Frage
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:
Antworten
  • 2
  • 12
  • 42
  • 7

Frage 31

Frage
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
Antworten
  • 42
  • 2
  • 7
  • 12

Frage 32

Frage
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 ?
Antworten
  • one
  • two
  • three
  • four

Frage 33

Frage
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
Antworten
  • A1 A2 B1 B2
  • A1 B1 A2 B2
  • A1 B1 B2 A2
  • B1 B2 A1 A2

Frage 34

Frage
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
Antworten
  • A1 B1 A2 B2
  • A1 B1 B2 A2
  • B1 A1 B2 A2
  • B1 B2 A1 A2

Frage 35

Frage
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?
Antworten
  • B1 A1 B2 A2
  • B1 A1 A2 B2
  • B1 B2 A1 A2
  • A1 A2 B1 B2

Frage 36

Frage
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?
Antworten
  • A1 A2 B1 B2
  • B1 A1 B2 A2
  • B1 A1 A2 B2
  • B1 B2 A1 A2

Frage 37

Frage
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?
Antworten
  • A1 A2 B1 B2
  • A1 B1 B2 A2
  • B1 A1 A2 B2
  • B1 B2 A1 A2

Frage 38

Frage
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?
Antworten
  • A1 B1 A2 B2
  • B1 A1 B2 A2
  • B1 A1 A2 B2
  • B1 B2 A1 A2

Frage 39

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

Frage 40

Frage
Concurrent writes:
Antworten
  • 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

Frage 41

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

Frage 42

Frage
sem.signal () ...
Antworten
  • decrements the semaphore
  • increments the semaphore
  • reads the semaphore
  • initializes the semaphore

Frage 43

Frage
sem.wait () ...
Antworten
  • decrements the semaphore
  • increments the semaphore
  • reads the semaphore
  • initializes the semaphore

Frage 44

Frage
Semaphore operation sem.P( ) is alternative to
Antworten
  • sem.signal
  • sem.wait
  • semaphore initialization
  • semaphore read

Frage 45

Frage
Semaphore operation sem.V( ) is alternative to
Antworten
  • sem.signal ( )
  • sem.wait( )
  • semaphore initialization
  • semaphore read

Frage 46

Frage
Semaphores were invented by
Antworten
  • Edsger Dijkstra
  • Tim Berners-Lee
  • Vint Cerf
  • Leonard Kleinrock

Frage 47

Frage
Two events are ______________ if we cannot tell by looking at the program which will happen first
Antworten
  • Concurrent
  • Constrained
  • Sequential
  • Mutually excluded

Frage 48

Frage
Block size is:
Antworten
  • 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

Frage 49

Frage
If the accessed word is found in the faster memory, that is defined as a:
Antworten
  • hit
  • win
  • bingo
  • evrika

Frage 50

Frage
If the accessed word is not found in the faster memory, that is defined as a:
Antworten
  • miss
  • loss
  • ricochet
  • zero

Frage 51

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
  • locality of reference
  • replacement algorithm
  • mapping function

Frage 52

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
  • cache size
  • write policy
  • locality of reference
  • replacement algorithm

Frage 53

Frage
This determines which cache location the block will occupy:
Antworten
  • mapping function
  • write policy
  • locality of reference
  • block size

Frage 54

Frage
When a processor attempts to read a byte or word of memory, it firstly checks the:
Antworten
  • Cache
  • Main memory
  • Disk
  • CD

Frage 55

Frage
Which of the following statements is false:
Antworten
  • 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

Frage 56

Frage
Memory:
Antworten
  • 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

Frage 57

Frage
Processor:
Antworten
  • 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

Frage 58

Frage
Program:
Antworten
  • 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

Frage 59

Frage
The memory allocation scheme subject to "external" fragmentation is?
Antworten
  • segmentation
  • swapping
  • multiple contiguous fixed partitions
  • pure demand paging

Frage 60

Frage
The memory allocation scheme subject to "internal" fragmentation is?
Antworten
  • fixed partitioning
  • segmentation
  • virtual memory segmentation
  • pure demand paging

Frage 61

Frage
Any program, no matter how small, will occupy an entire partition results in?
Antworten
  • internal fragmentation
  • segmentation
  • external fragmentation
  • paging

Frage 62

Frage
How to solve problem of equal-size partitions?
Antworten
  • unequal-size partitions
  • segmentation
  • virtual memory segmentation
  • compaction

Frage 63

Frage
How to solve problem of "external" fragmentation?
Antworten
  • compaction
  • segmentation
  • virtual memory segmentation
  • unequal-size partitions

Frage 64

Frage
A page fault?
Antworten
  • 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

Frage 65

Frage
Which of the following statements is false?
Antworten
  • 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

Frage 66

Frage
Swapping:
Antworten
  • 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

Frage 67

Frage
Swapping:
Antworten
  • 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

Frage 68

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

Frage 69

Frage
Segmentation suffers from external fragmentation?
Antworten
  • True
  • False

Frage 70

Frage
Paging suffers from external fragmentation?
Antworten
  • True
  • False

Frage 71

Frage
Paging ...
Antworten
  • 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

Frage 72

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
  • paging
  • partition
  • segmentation
  • virtual memory

Frage 73

Frage
In memory systems, boundary registers?
Antworten
  • 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

Frage 74

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
  • mutual exclusion
  • semaphore
  • multiprogramming
  • multitasking

Frage 75

Frage
CPU fetches the instruction from memory according to the value of?
Antworten
  • program counter
  • status register
  • instruction register
  • program status word

Frage 76

Frage
A memory used to provide a high speed is called?
Antworten
  • cache
  • stack pointer
  • disk buffer
  • main memory

Frage 77

Frage
Which one of the following is the address generated by CPU?
Antworten
  • logical address
  • physical address
  • absolute address
  • none of the above

Frage 78

Frage
Runtime mapping from virtual to physical address is done by?
Antworten
  • memory management unit
  • CPU
  • PCI
  • none of the above

Frage 79

Frage
The address of a page table in memory is pointed by:
Antworten
  • page table base register
  • stack pointer
  • page register
  • program counter

Frage 80

Frage
Program always deals with:
Antworten
  • logical address
  • physical address
  • absolute address
  • relative address

Frage 81

Frage
What is compaction?
Antworten
  • a technique for overcoming external fragmentation
  • a paging technique
  • a technique for overcoming internal fragmentation
  • a technique for overcoming fatal error

Frage 82

Frage
Operating System maintains the page table for:
Antworten
  • each process
  • each thread
  • each instruction
  • each address

Frage 83

Frage
In contiguous memory allocation:
Antworten
  • 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

Frage 84

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

Frage 85

Frage
In fixed sized partition, the degree of multiprogramming is bounded by ___________.
Antworten
  • the number of partitions
  • the CPU utilization
  • the memory size
  • all of the above

Frage 86

Frage
The first fit, best fit and worst fit are strategies to select a ______.
Antworten
  • 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

Frage 87

Frage
In internal fragmentation, memory is internal to a partition and:
Antworten
  • is not being used
  • is being used
  • is always used
  • none of the above

Frage 88

Frage
A solution to the problem of external fragmentation is:
Antworten
  • compaction
  • larger memory space
  • smaller memory space
  • unequal size parts

Frage 89

Frage
__________ is generally faster than _________ .
Antworten
  • first fit, best fit
  • best fit, first fit
  • worst fit, best fit
  • none of the above

Frage 90

Frage
External fragmentation exists when:
Antworten
  • 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

Frage 91

Frage
External fragmentation will not occur when:
Antworten
  • no matter which algorithm is used, it will always occur
  • first fit is used
  • best fit is used
  • next fit is used

Frage 92

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

Frage 93

Frage
Main memory is broken into fixed-sized blocks called ________.
Antworten
  • frames
  • pages
  • segments
  • none of the above

Frage 94

Frage
Fixed-length block of data in secondary memory is called ________.
Antworten
  • frames
  • pages
  • segments
  • none of the above

Frage 95

Frage
Variable-length block of data that resides in secondary memory is called ________.
Antworten
  • frames
  • pages
  • segments
  • none of the above

Frage 96

Frage
Every address generated by the CPU is divided into two parts:
Antworten
  • page number
  • page offset
  • frame bit
  • frame offset

Frage 97

Frage
The __________ is used as an index into the page table.
Antworten
  • page number
  • frame bit
  • page offset
  • frame offset

Frage 98

Frage
The _____ table contains the base address of each page in physical memory.
Antworten
  • page
  • process
  • memory
  • frame

Frage 99

Frage
With paging there is no ________ fragmentation.
Antworten
  • external
  • internal
  • either type of
  • none of the above

Frage 100

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
  • frame
  • page
  • segment
  • memory

Frage 101

Frage
For every process there is a __________.
Antworten
  • page table
  • copy of page table
  • pointer to page table
  • frame table

Frage 102

Frage
If a page number is not found in the TLB, then it is known as a:
Antworten
  • TLB miss
  • buffer miss
  • TLB hit
  • page fault

Frage 103

Frage
If a page table entry is present in the TLB, then it is known as a:
Antworten
  • TLB miss
  • buffer miss
  • TLB hit
  • page fault

Frage 104

Frage
If a page table entry is not in main memory, then it is known as a:
Antworten
  • TLB miss
  • buffer miss
  • TLB hit
  • page fault

Frage 105

Frage
When free memory is split into many unconnected pieces we call it:
Antworten
  • Internal fragmentation
  • External fragmentation
  • Compaction
  • Memory distribution

Frage 106

Frage
Memory partitioning algorithm that uses binary tree as a data structure is called:
Antworten
  • First-fit algorithm
  • Next-fit algorithm
  • Buddy system
  • Best-fit algorithm

Frage 107

Frage
Which of the following is not a principle of storage management responsibilities?
Antworten
  • Process isolation
  • Process termination
  • Protection and access control
  • Automatic allocation and management

Frage 108

Frage
This algorithm reduces the rate of production of small gaps
Antworten
  • Best fit
  • Worst fit
  • First fit
  • Next fit

Frage 109

Frage
This is the fastest algorithm because it searches as little as possible
Antworten
  • Best fit
  • Worst fit
  • First fit
  • Next fit

Frage 110

Frage
This algorithm is slow, and may even tend to fill up memory with tiny useless holes
Antworten
  • Best fit
  • Worst fit
  • First fit
  • Next fit

Frage 111

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

Frage 112

Frage
In segmentation, each address is specified by (choose two):
Antworten
  • a segment number
  • an offset
  • a value
  • a key

Frage 113

Frage
A binary semaphore is a semaphore with integer values::A binary semaphore is a semaphore with integer values
Antworten
  • 1 and 0
  • 1 and -1
  • 0 and -1
  • 1 and 2

Frage 114

Frage
A monitor is a type of
Antworten
  • binary semaphore
  • low level synchronization construct
  • high level synchronization construct
  • general semaphore

Frage 115

Frage
A monitor is a type of
Antworten
  • high level synchronization construct
  • deadlock
  • low level synchronization construct
  • none of the above

Frage 116

Frage
A mutex
Antworten
  • is a hexadecimal value
  • must be accessed from only one process
  • can be accessed from multiple processes
  • cannot be accessed by processes

Frage 117

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

Frage 118

Frage
A semaphore
Antworten
  • is a binary mutex
  • must be accessed from only one process
  • can be accessed from multiple processes
  • is a data structure

Frage 119

Frage
A set of processes is deadlock if:
Antworten
  • 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

Frage 120

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
  • race condition
  • data consistency
  • starvation
  • mutual exclusion

Frage 121

Frage
An un-interruptible unit is known as
Antworten
  • single
  • atomic
  • static
  • safe

Frage 122

Frage
An un-interruptible unit is known as
Antworten
  • atomic
  • single
  • static
  • None of the above

Frage 123

Frage
Concurrent access to shared data may result in::Concurrent access to shared data may result in
Antworten
  • data consistency
  • data insecurity
  • data inconsistency
  • data complexity

Frage 124

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

Frage 125

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
  • critical exclusion
  • synchronous exclusion
  • asynchronous exclusion

Frage 126

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

Frage 127

Frage
In indirect communication between processes P and Q:
Antworten
  • 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

Frage 128

Frage
In the blocking send, blocking receive:
Antworten
  • 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

Frage 129

Frage
In the non-blocking send, blocking receive:
Antworten
  • 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

Frage 130

Frage
In the non-blocking send, non-blocking receive:
Antworten
  • 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

Frage 131

Frage
In the non-blocking send:
Antworten
  • 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

Frage 132

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 133

Frage
Mutual exclusion can be provided by the
Antworten
  • mutex locks
  • binary semaphores
  • both mutex locks and binary semaphores
  • none of the mentioned

Frage 134

Frage
Mutual exclusion can be provided by the
Antworten
  • mutex locks
  • binary semaphores
  • both
  • none of the above

Frage 135

Frage
Mutual exclusion implies that
Antworten
  • 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

Frage 136

Frage
Mutual exclusion means that?
Antworten
  • 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

Frage 137

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

Frage 138

Frage
Semaphore is a/an _______ to solve the critical section problem?
Antworten
  • integer variable
  • hardware for a system
  • special program for a system
  • complex structure

Frage 139

Frage
Semaphores are mostly used to implement
Antworten
  • System calls
  • Interprocess communication mechanisms
  • System protection
  • Interrupts

Frage 140

Frage
Semaphores:
Antworten
  • synchronize critical resources to prevent deadlock
  • synchronize critical resources to prevent contention
  • are used to do I/O
  • are used for memory management

Frage 141

Frage
The bounded buffer problem is also known as
Antworten
  • Readers - Writers problem
  • Dining - Philosophers problem
  • Producer - Consumer problem
  • Banker's algorithm

Frage 142

Frage
The code that changes the value of the semaphore is:
Antworten
  • critical section code
  • remainder section code
  • non - critical section code
  • None of the above

Frage 143

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

Frage 144

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

Frage 145

Frage
The monitor construct ensures that
Antworten
  • 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

Frage 146

Frage
The operations that can be invoked on a condition variable are
Antworten
  • wait & signal
  • hold & wait
  • signal & hold
  • continue & signal

Frage 147

Frage
The process invoking the wait operation is
Antworten
  • 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

Frage 148

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

Frage 149

Frage
The two atomic operations permissible on semaphores are
Antworten
  • wait, signal
  • stop, start
  • hold, wait
  • wait, call

Frage 150

Frage
If the semaphore value is negative
Antworten
  • 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

Frage 151

Frage
two kinds of semaphores are
Antworten
  • mutex &; counting
  • binary & counting
  • counting & decimal
  • decimal & binary

Frage 152

Frage
To avoid the race condition, the number of processes that may be simultaneously inside their critical section is
Antworten
  • 1
  • 10
  • 0
  • 2

Frage 153

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

Frage 154

Frage
What is a trap/exception?
Antworten
  • 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

Frage 155

Frage
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
Antworten
  • race condition
  • dynamic condition
  • essential condition
  • critical condition

Frage 156

Frage
Which of the following are TRUE for direct communication
Antworten
  • 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

Frage 157

Frage
Index register, segment register, and stack register are example of:
Antworten
  • Data registers
  • Address registers
  • Control registers
  • Status registers

Frage 158

Frage
The processor contains a single data register, called
Antworten
  • AC
  • PC
  • IR
  • PSW

Frage 159

Frage
This register contains the data to be written into memory or which receives the data read from memory
Antworten
  • Memory buffer register
  • Memory address register
  • I/OAR
  • I/OBR

Frage 160

Frage
This register is used for the exchange of data between an I/O module and the processor
Antworten
  • Memory buffer register
  • Memory address register
  • I/OAR
  • I/OBR

Frage 161

Frage
This register specifies a particular input/output device
Antworten
  • Memory buffer register
  • Memory address register
  • I/OAR
  • I/OBR

Frage 162

Frage
This register specifies the location in memory for the next read or write
Antworten
  • Memory buffer register
  • Memory address register
  • I/OAR
  • I/OBR

Frage 163

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

Frage 164

Frage
Which register contains the address of the next instruction to be fetched?
Antworten
  • Program counter
  • Instruction register
  • Execution register
  • Process counter

Frage 165

Frage
Which register contains the instruction most recently fetched?
Antworten
  • Program counter
  • Instruction register
  • Execution register
  • Process counter

Frage 166

Frage
Control and status registers control the operation of the processor and the execution of programs
Antworten
  • True
  • False

Frage 167

Frage
User-visible registers minimize main memory references by optimizing register use
Antworten
  • True
  • False

Frage 168

Frage
Virtual memory takes advantage of
Antworten
  • Fast CPU
  • Large secondary memory
  • Modular programming
  • Scheduling

Frage 169

Frage
Which of the replacement algorithms selects for replacement that page for which the time to the next reference is the longest?
Antworten
  • optimal
  • LRU
  • FIFO
  • Clock

Frage 170

Frage
What does process page table entry contain?
Antworten
  • 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

Frage 171

Frage
Which of the replacement algorithms replaces the page in memory that has not been referenced for the longest time?
Antworten
  • optimal
  • LRU
  • FIFO
  • Clock

Frage 172

Frage
Which of the replacement algorithms treats the page frames allocated to a process as a circular buffer?
Antworten
  • optimal
  • LRU
  • FIFO
  • Clock

Frage 173

Frage
What is the real address?
Antworten
  • a physical address in main memory
  • a virtual address in main memory
  • a virtual address in secondary memory
  • a physical address in cache memory

Frage 174

Frage
What is virtual address?
Antworten
  • 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.

Frage 175

Frage
The size of virtual storage is limited by...
Antworten
  • 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

Frage 176

Frage
What is the resident set of the process?
Antworten
  • 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.

Frage 177

Frage
When does processor generate an interrupt indicating a memory access fault? {
Antworten
  • 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.

Frage 178

Frage
What is trashing? {
Antworten
  • 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.
Zusammenfassung anzeigen Zusammenfassung ausblenden

Möchten Sie mit GoConqr kostenlos Ihre eigenen Quiz erstellen? eigenen Mehr erfahren.

ähnlicher Inhalt

Microbiology MCQs 3rd Year Final- PMU
Med Student
Anatomy and Physiology
pressey_property
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
Bibliothek durchsuchen