OS | 178 questions [NEW BAZA]

Good Guy Beket
Quiz by Good Guy Beket, updated more than 1 year ago
Good Guy Beket
Created by Good Guy Beket about 2 years ago
694
14

Description

Suicidal Operating Systems [Teachers: Teshebayeva Karagoz, Mishina Aigerim ; Final Exam + STATE EXAM] ▼ Quiz on OS | 178 questions [NEW BAZA], created by Good Guy Beket on 03/28/2019.

Resource summary

Question 1

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

Question 2

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

Question 3

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

Question 4

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

Question 5

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

Question 6

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

Question 7

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

Question 8

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

Question 9

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

Question 10

Question
In fully associative mapping, there are the following fields
Answer
  • tag, word
  • tag, block, word
  • tag, set, word
  • tag, block

Question 11

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

Question 12

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

Question 13

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

Question 14

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

Question 15

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

Question 16

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

Question 17

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

Question 18

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

Question 19

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

Question 20

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

Question 21

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

Question 22

Question
Which is the fastest cache mapping function?
Answer
  • Direct mapping
  • Set associative mapping
  • Fully associative mapping

Question 23

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

Question 24

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

Question 25

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

Question 26

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

Question 27

Question
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:
Answer
  • 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))

Question 28

Question
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:
Answer
  • 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

Question 29

Question
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:
Answer
  • 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

Question 30

Question
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:
Answer
  • 2
  • 12
  • 42
  • 7

Question 31

Question
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
Answer
  • 42
  • 2
  • 7
  • 12

Question 32

Question
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 ?
Answer
  • one
  • two
  • three
  • four

Question 33

Question
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
Answer
  • A1 A2 B1 B2
  • A1 B1 A2 B2
  • A1 B1 B2 A2
  • B1 B2 A1 A2

Question 34

Question
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
Answer
  • A1 B1 A2 B2
  • A1 B1 B2 A2
  • B1 A1 B2 A2
  • B1 B2 A1 A2

Question 35

Question
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?
Answer
  • B1 A1 B2 A2
  • B1 A1 A2 B2
  • B1 B2 A1 A2
  • A1 A2 B1 B2

Question 36

Question
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?
Answer
  • A1 A2 B1 B2
  • B1 A1 B2 A2
  • B1 A1 A2 B2
  • B1 B2 A1 A2

Question 37

Question
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?
Answer
  • A1 A2 B1 B2
  • A1 B1 B2 A2
  • B1 A1 A2 B2
  • B1 B2 A1 A2

Question 38

Question
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?
Answer
  • A1 B1 A2 B2
  • B1 A1 B2 A2
  • B1 A1 A2 B2
  • B1 B2 A1 A2

Question 39

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

Question 40

Question
Concurrent writes:
Answer
  • 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

Question 41

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

Question 42

Question
sem.signal () ...
Answer
  • decrements the semaphore
  • increments the semaphore
  • reads the semaphore
  • initializes the semaphore

Question 43

Question
sem.wait () ...
Answer
  • decrements the semaphore
  • increments the semaphore
  • reads the semaphore
  • initializes the semaphore

Question 44

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

Question 45

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

Question 46

Question
Semaphores were invented by
Answer
  • Edsger Dijkstra
  • Tim Berners-Lee
  • Vint Cerf
  • Leonard Kleinrock

Question 47

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

Question 48

Question
Block size is:
Answer
  • 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

Question 49

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

Question 50

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

Question 51

Question
If the contents of a block in the cache are altered, then it is needed to save it back to main memory before replacing it. This is called:
Answer
  • write policy
  • locality of reference
  • replacement algorithm
  • mapping function

Question 52

Question
This chooses which block to replace when a new block is to be loaded into the cache and the cache already had all slots filled with other blocks:
Answer
  • cache size
  • write policy
  • locality of reference
  • replacement algorithm

Question 53

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

Question 54

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

Question 55

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

Question 56

Question
Memory:
Answer
  • 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

Question 57

Question
Processor:
Answer
  • 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

Question 58

Question
Program:
Answer
  • 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

Question 59

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

Question 60

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

Question 61

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

Question 62

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

Question 63

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

Question 64

Question
A page fault?
Answer
  • 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

Question 65

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

Question 66

Question
Swapping:
Answer
  • 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

Question 67

Question
Swapping:
Answer
  • 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

Question 68

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

Question 69

Question
Segmentation suffers from external fragmentation?
Answer
  • True
  • False

Question 70

Question
Paging suffers from external fragmentation?
Answer
  • True
  • False

Question 71

Question
Paging ...
Answer
  • 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

Question 72

Question
What is a method of memory allocation by which the program is subdivided into equal portions, or pages and core is subdivided into equal portions or blocks?
Answer
  • paging
  • partition
  • segmentation
  • virtual memory

Question 73

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

Question 74

Question
A relationship between processes such that each has some part (critical section) which must not be executed while the critical section of another is being executed, is known as?
Answer
  • mutual exclusion
  • semaphore
  • multiprogramming
  • multitasking

Question 75

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

Question 76

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

Question 77

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

Question 78

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

Question 79

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

Question 80

Question
Program always deals with:
Answer
  • logical address
  • physical address
  • absolute address
  • relative address

Question 81

Question
What is compaction?
Answer
  • a technique for overcoming external fragmentation
  • a paging technique
  • a technique for overcoming internal fragmentation
  • a technique for overcoming fatal error

Question 82

Question
Operating System maintains the page table for:
Answer
  • each process
  • each thread
  • each instruction
  • each address

Question 83

Question
In contiguous memory allocation:
Answer
  • 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

Question 84

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

Question 85

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

Question 86

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

Question 87

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

Question 88

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

Question 89

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

Question 90

Question
External fragmentation exists when:
Answer
  • 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

Question 91

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

Question 92

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

Question 93

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

Question 94

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

Question 95

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

Question 96

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

Question 97

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

Question 98

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

Question 99

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

Question 100

Question
The operating system maintains a ______ table that keeps track of how many frames have been allocated, how many are there, and how many are available.
Answer
  • frame
  • page
  • segment
  • memory

Question 101

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

Question 102

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

Question 103

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

Question 104

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

Question 105

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

Question 106

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

Question 107

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

Question 108

Question
This algorithm reduces the rate of production of small gaps
Answer
  • Best fit
  • Worst fit
  • First fit
  • Next fit

Question 109

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

Question 110

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

Question 111

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

Question 112

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

Question 113

Question
A binary semaphore is a semaphore with integer values::A binary semaphore is a semaphore with integer values
Answer
  • 1 and 0
  • 1 and -1
  • 0 and -1
  • 1 and 2

Question 114

Question
A monitor is a type of
Answer
  • binary semaphore
  • low level synchronization construct
  • high level synchronization construct
  • general semaphore

Question 115

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

Question 116

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

Question 117

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

Question 118

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

Question 119

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

Question 120

Question
A situation where several processes access and manipulate the same data concurrently and the outcome of the execution depends on the particular order in which access takes place is called:
Answer
  • race condition
  • data consistency
  • starvation
  • mutual exclusion

Question 121

Question
An un-interruptible unit is known as
Answer
  • single
  • atomic
  • static
  • safe

Question 122

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

Question 123

Question
Concurrent access to shared data may result in::Concurrent access to shared data may result in
Answer
  • data consistency
  • data insecurity
  • data inconsistency
  • data complexity

Question 124

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

Question 125

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

Question 126

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

Question 127

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

Question 128

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

Question 129

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

Question 130

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

Question 131

Question
In the non-blocking send:
Answer
  • 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

Question 132

Question
Interprocess communication:
Answer
  • allows processes to communicate and synchronize their actions without using the same address space
  • allows processes to communicate and synchronize their actions when using the same address space
  • allows the processes to only synchronize their actions without communication
  • none of the above

Question 133

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

Question 134

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

Question 135

Question
Mutual exclusion implies that
Answer
  • 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

Question 136

Question
Mutual exclusion means that?
Answer
  • 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

Question 137

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

Question 138

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

Question 139

Question
Semaphores are mostly used to implement
Answer
  • System calls
  • Interprocess communication mechanisms
  • System protection
  • Interrupts

Question 140

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

Question 141

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

Question 142

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

Question 143

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

Question 144

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

Question 145

Question
The monitor construct ensures that
Answer
  • 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

Question 146

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

Question 147

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

Question 148

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

Question 149

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

Question 150

Question
If the semaphore value is negative
Answer
  • 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

Question 151

Question
two kinds of semaphores are
Answer
  • mutex &; counting
  • binary & counting
  • counting & decimal
  • decimal & binary

Question 152

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

Question 153

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

Question 154

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

Question 155

Question
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
Answer
  • race condition
  • dynamic condition
  • essential condition
  • critical condition

Question 156

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

Question 157

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

Question 158

Question
The processor contains a single data register, called
Answer
  • AC
  • PC
  • IR
  • PSW

Question 159

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

Question 160

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

Question 161

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

Question 162

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

Question 163

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

Question 164

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

Question 165

Question
Which register contains the instruction most recently fetched?
Answer
  • Program counter
  • Instruction register
  • Execution register
  • Process counter

Question 166

Question
Control and status registers control the operation of the processor and the execution of programs
Answer
  • True
  • False

Question 167

Question
User-visible registers minimize main memory references by optimizing register use
Answer
  • True
  • False

Question 168

Question
Virtual memory takes advantage of
Answer
  • Fast CPU
  • Large secondary memory
  • Modular programming
  • Scheduling

Question 169

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

Question 170

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

Question 171

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

Question 172

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

Question 173

Question
What is the real address?
Answer
  • a physical address in main memory
  • a virtual address in main memory
  • a virtual address in secondary memory
  • a physical address in cache memory

Question 174

Question
What is virtual address?
Answer
  • 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.

Question 175

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

Question 176

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

Question 177

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

Question 178

Question
What is trashing? {
Answer
  • 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.
Show full summary Hide full summary

Similar

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
Components of An Operating System - Jason Madappattu
Jason EM
Architecture
Karen Hosie
Architecture
lindsey.reynolds