Good Guy Beket
Quiz von , erstellt am more than 1 year ago

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.

1012
14
0
Good Guy Beket
Erstellt von Good Guy Beket vor mehr als 5 Jahre
Schließen

OS | 178 questions [NEW BAZA]

Frage 1 von 178

1

What is not a main structural element of a computer system?

Wähle eine der folgenden:

  • Processor

  • Main memory

  • System bus

  • Operating bus

Erklärung

Frage 2 von 178

1

Which of the following element of a computer system controls the operation of the computer and performs its data processing functions?

Wähle eine der folgenden:

  • Processor

  • Main memory

  • System bus

  • I/O modules

Erklärung

Frage 3 von 178

1

Which of the following element of a computer system moves data between the the computer and its external environment?

Wähle eine der folgenden:

  • Processor

  • Main memory

  • System bus

  • I/O modules

Erklärung

Frage 4 von 178

1

Which of the following element of a computer system stores data and programs?

Wähle eine der folgenden:

  • Processor

  • Main memory

  • System bus

  • I/O modules

Erklärung

Frage 5 von 178

1

Which of the following provides for communication among elements of a computer system?

Wähle eine der folgenden:

  • Processor

  • Main memory

  • System bus

  • I/O modules

Erklärung

Frage 6 von 178

1

Which of the following registers are used by the processor to exchange data with memory?

Wähle eine der folgenden:

  • MAR and MBR

  • I/OAR and I/OBR

  • PC and IR

  • Program status word

Erklärung

Frage 7 von 178

1

Which of the following registers are used by the processor to exchange data with input/output module?

Wähle eine der folgenden:

  • MAR and MBR

  • I/OAR and I/OBR

  • PC and IR

  • Program status word

Erklärung

Frage 8 von 178

1

If the required block is not present in the cache then ______ occurs.

Wähle eine der folgenden:

  • cache latency

  • cache hit

  • cache delay

  • cache miss

Erklärung

Frage 9 von 178

1

In direct mapping the presence of the block in memory is checked with the help of _____ field.

Wähle eine der folgenden:

  • block

  • tag

  • word

  • set

Erklärung

Frage 10 von 178

1

In fully associative mapping, there are the following fields

Wähle eine der folgenden:

  • tag, word

  • tag, block, word

  • tag, set, word

  • tag, block

Erklärung

Frage 11 von 178

1

The algorithm to remove and place new contents into the cache is called _______

Wähle eine der folgenden:

  • Replacement algorithm

  • Renewal algorithm

  • Updation

  • Compaction

Erklärung

Frage 12 von 178

1

The bit used to indicate whether the block was recently used or not is _______

Wähle eine der folgenden:

  • Control bit

  • Reference bit

  • Dirty bit

  • Valid bit

Erklärung

Frage 13 von 178

1

The correspondence between the main memory blocks and those in the cache is given by _________

Wähle eine der folgenden:

  • Hash function

  • Mapping function

  • Locale function

  • Assign function

Erklärung

Frage 14 von 178

1

The effectiveness of the cache memory is based on the property of ________</

Wähle eine der folgenden:

  • Locality of reference

  • Memory localisation

  • Memory size

  • Memory access time

Erklärung

Frage 15 von 178

1

The memory blocks are mapped on to the cache with the help of ______

Wähle eine der folgenden:

  • Hash functions

  • Write policy

  • Replacement policy

  • Mapping functions

Erklärung

Frage 16 von 178

1

The method of mapping the consecutive memory blocks to consecutive cache blocks is called ______

Wähle eine der folgenden:

  • Set associative

  • Fully associative

  • Direct

  • Indirect

Erklärung

Frage 17 von 178

1

The reason for the implementation of the cache memory is ________

Wähle eine der folgenden:

  • 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

Erklärung

Frage 18 von 178

1

The spatial aspect of the locality of reference means ________

Wähle eine der folgenden:

  • 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

Erklärung

Frage 19 von 178

1

The technique of searching for a block by going through all the tags is ______

Wähle eine der folgenden:

  • Linear search

  • Binary search

  • Associative search

  • Indirect search

Erklärung

Frage 20 von 178

1

The temporal aspect of the locality of reference means ________

Wähle eine der folgenden:

  • 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

Erklärung

Frage 21 von 178

1

This bit indicates if the slot holds a block belonging to the program being executed

Wähle eine der folgenden:

  • Control bit

  • Reference bit

  • Dirty bit

  • Valid bit

Erklärung

Frage 22 von 178

1

Which is the fastest cache mapping function?

Wähle eine der folgenden:

  • Direct mapping

  • Set associative mapping

  • Fully associative mapping

Erklärung

Frage 23 von 178

1

While using the direct mapping technique, in a 16 bit system the higher order 5 bits are used for ________

Wähle eine der folgenden:

  • tag

  • block/slot

  • word

  • ID

Erklärung

Frage 24 von 178

1

The set-associative map technique is a combination of the direct and associative technique

Wähle eins der folgenden:

  • WAHR
  • FALSCH

Erklärung

Frage 25 von 178

1

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:

Wähle eine der folgenden:

  • Ts = H1 × T1

  • Ts = H1 × T1 + (1 — H1) × (T1 + T2)

  • Ts = H1 × T1 + H1 × T2

  • Ts = H1 × (T1 + T2)

Erklärung

Frage 26 von 178

1

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:

Wähle eine der folgenden:

  • Ts = H1 × T1

  • Ts = H1 × T1 + (1 - H1) × (T1 + T2)

  • Ts = H1 × T1 + H1 × T2

  • Ts = H1 × (T1 + T2)

Erklärung

Frage 27 von 178

1

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:

Wähle eine der folgenden:

  • 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))

Erklärung

Frage 28 von 178

1

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:

Wähle eine der folgenden:

  • 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

Erklärung

Frage 29 von 178

1

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:

Wähle eine der folgenden:

  • 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

Erklärung

Frage 30 von 178

1

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:

Wähle eine der folgenden:

  • 2

  • 12

  • 42

  • 7

Erklärung

Frage 31 von 178

1

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

Wähle eine der folgenden:

  • 42

  • 2

  • 7

  • 12

Erklärung

Frage 32 von 178

1

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 ?

Wähle eine der folgenden:

  • one

  • two

  • three

  • four

Erklärung

Frage 33 von 178

1

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

Wähle eine der folgenden:

  • A1 A2 B1 B2

  • A1 B1 A2 B2

  • A1 B1 B2 A2

  • B1 B2 A1 A2

Erklärung

Frage 34 von 178

1

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

Wähle eine der folgenden:

  • A1 B1 A2 B2

  • A1 B1 B2 A2

  • B1 A1 B2 A2

  • B1 B2 A1 A2

Erklärung

Frage 35 von 178

1

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?

Wähle eine der folgenden:

  • B1 A1 B2 A2

  • B1 A1 A2 B2

  • B1 B2 A1 A2

  • A1 A2 B1 B2

Erklärung

Frage 36 von 178

1

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?

Wähle eine der folgenden:

  • A1 A2 B1 B2

  • B1 A1 B2 A2

  • B1 A1 A2 B2

  • B1 B2 A1 A2

Erklärung

Frage 37 von 178

1

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?

Wähle eine der folgenden:

  • A1 A2 B1 B2

  • A1 B1 B2 A2

  • B1 A1 A2 B2

  • B1 B2 A1 A2

Erklärung

Frage 38 von 178

1

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?

Wähle eine der folgenden:

  • A1 B1 A2 B2

  • B1 A1 B2 A2

  • B1 A1 A2 B2

  • B1 B2 A1 A2

Erklärung

Frage 39 von 178

1

Computer programmers are often concerned with synchronization constraints, which are requirements pertaining to the order of events. They are:

Wähle eine der folgenden:

  • Serialization and Mutual exclusion

  • Queueing and dispatching

  • Scheduling and dispatching

  • Serialization and Mutual inclusion

Erklärung

Frage 40 von 178

1

Concurrent writes:

Wähle eine der folgenden:

  • 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

Erklärung

Frage 41 von 178

1

If it is not possible to tell, by looking at the program, what will happen when it executes, then the program is

Wähle eine der folgenden:

  • non-deterministic

  • non-distributed

  • non-deadlocked

  • non-divisible

Erklärung

Frage 42 von 178

1

sem.signal () ...

Wähle eine der folgenden:

  • decrements the semaphore

  • increments the semaphore

  • reads the semaphore

  • initializes the semaphore

Erklärung

Frage 43 von 178

1

sem.wait () ...

Wähle eine der folgenden:

  • decrements the semaphore

  • increments the semaphore

  • reads the semaphore

  • initializes the semaphore

Erklärung

Frage 44 von 178

1

Semaphore operation sem.P( ) is alternative to

Wähle eine der folgenden:

  • sem.signal

  • sem.wait

  • semaphore initialization

  • semaphore read

Erklärung

Frage 45 von 178

1

Semaphore operation sem.V( ) is alternative to

Wähle eine der folgenden:

  • sem.signal ( )

  • sem.wait( )

  • semaphore initialization

  • semaphore read

Erklärung

Frage 46 von 178

1

Semaphores were invented by

Wähle eine der folgenden:

  • Edsger Dijkstra

  • Tim Berners-Lee

  • Vint Cerf

  • Leonard Kleinrock

Erklärung

Frage 47 von 178

1

Two events are ______________ if we cannot tell by looking at the program which will happen first

Wähle eine der folgenden:

  • Concurrent

  • Constrained

  • Sequential

  • Mutually excluded

Erklärung

Frage 48 von 178

1

Block size is:

Wähle eine der folgenden:

  • 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

Erklärung

Frage 49 von 178

1

If the accessed word is found in the faster memory, that is defined as a:

Wähle eine der folgenden:

  • hit

  • win

  • bingo

  • evrika

Erklärung

Frage 50 von 178

1

If the accessed word is not found in the faster memory, that is defined as a:

Wähle eine der folgenden:

  • miss

  • loss

  • ricochet

  • zero

Erklärung

Frage 51 von 178

1

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:

Wähle eine der folgenden:

  • write policy

  • locality of reference

  • replacement algorithm

  • mapping function

Erklärung

Frage 52 von 178

1

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:

Wähle eine der folgenden:

  • cache size

  • write policy

  • locality of reference

  • replacement algorithm

Erklärung

Frage 53 von 178

1

This determines which cache location the block will occupy:

Wähle eine der folgenden:

  • mapping function

  • write policy

  • locality of reference

  • block size

Erklärung

Frage 54 von 178

1

When a processor attempts to read a byte or word of memory, it firstly checks the:

Wähle eine der folgenden:

  • Cache

  • Main memory

  • Disk

  • CD

Erklärung

Frage 55 von 178

1

Which of the following statements is false:

Wähle eine der folgenden:

  • 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

Erklärung

Frage 56 von 178

1

Memory:

Wähle eine der folgenden:

  • 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

Erklärung

Frage 57 von 178

1

Processor:

Wähle eine der folgenden:

  • 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

Erklärung

Frage 58 von 178

1

Program:

Wähle eine der folgenden:

  • 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

Erklärung

Frage 59 von 178

1

The memory allocation scheme subject to "external" fragmentation is?

Wähle eine der folgenden:

  • segmentation

  • swapping

  • multiple contiguous fixed partitions

  • pure demand paging

Erklärung

Frage 60 von 178

1

The memory allocation scheme subject to "internal" fragmentation is?

Wähle eine der folgenden:

  • fixed partitioning

  • segmentation

  • virtual memory segmentation

  • pure demand paging

Erklärung

Frage 61 von 178

1

Any program, no matter how small, will occupy an entire partition results in?

Wähle eine der folgenden:

  • internal fragmentation

  • segmentation

  • external fragmentation

  • paging

Erklärung

Frage 62 von 178

1

How to solve problem of equal-size partitions?

Wähle eine der folgenden:

  • unequal-size partitions

  • segmentation

  • virtual memory segmentation

  • compaction

Erklärung

Frage 63 von 178

1

How to solve problem of "external" fragmentation?

Wähle eine der folgenden:

  • compaction

  • segmentation

  • virtual memory segmentation

  • unequal-size partitions

Erklärung

Frage 64 von 178

1

A page fault?

Wähle eine der folgenden:

  • 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

Erklärung

Frage 65 von 178

1

Which of the following statements is false?

Wähle eine der folgenden:

  • 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

Erklärung

Frage 66 von 178

1

Swapping:

Wähle eine der folgenden:

  • 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

Erklärung

Frage 67 von 178

1

Swapping:

Wähle eine der folgenden:

  • 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

Erklärung

Frage 68 von 178

1

Which of the following is not true about the memory management?

Wähle eine der folgenden:

  • virtual memory is used only in multi-user systems

  • segmentation suffers from external fragmentation

  • paging suffers from internal fragmentation

  • segmented memory can be paged

Erklärung

Frage 69 von 178

1

Segmentation suffers from external fragmentation?

Wähle eins der folgenden:

  • WAHR
  • FALSCH

Erklärung

Frage 70 von 178

1

Paging suffers from external fragmentation?

Wähle eins der folgenden:

  • WAHR
  • FALSCH

Erklärung

Frage 71 von 178

1

Paging ...

Wähle eine der folgenden:

  • 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

Erklärung

Frage 72 von 178

1

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?

Wähle eine der folgenden:

  • paging

  • partition

  • segmentation

  • virtual memory

Erklärung

Frage 73 von 178

1

In memory systems, boundary registers?

Wähle eine der folgenden:

  • 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

Erklärung

Frage 74 von 178

1

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?

Wähle eine der folgenden:

  • mutual exclusion

  • semaphore

  • multiprogramming

  • multitasking

Erklärung

Frage 75 von 178

1

CPU fetches the instruction from memory according to the value of?

Wähle eine der folgenden:

  • program counter

  • status register

  • instruction register

  • program status word

Erklärung

Frage 76 von 178

1

A memory used to provide a high speed is called?

Wähle eine der folgenden:

  • cache

  • stack pointer

  • disk buffer

  • main memory

Erklärung

Frage 77 von 178

1

Which one of the following is the address generated by CPU?

Wähle eine der folgenden:

  • logical address

  • physical address

  • absolute address

  • none of the above

Erklärung

Frage 78 von 178

1

Runtime mapping from virtual to physical address is done by?

Wähle eine der folgenden:

  • memory management unit

  • CPU

  • PCI

  • none of the above

Erklärung

Frage 79 von 178

1

The address of a page table in memory is pointed by:

Wähle eine der folgenden:

  • page table base register

  • stack pointer

  • page register

  • program counter

Erklärung

Frage 80 von 178

1

Program always deals with:

Wähle eine der folgenden:

  • logical address

  • physical address

  • absolute address

  • relative address

Erklärung

Frage 81 von 178

1

What is compaction?

Wähle eine der folgenden:

  • a technique for overcoming external fragmentation

  • a paging technique

  • a technique for overcoming internal fragmentation

  • a technique for overcoming fatal error

Erklärung

Frage 82 von 178

1

Operating System maintains the page table for:

Wähle eine der folgenden:

  • each process

  • each thread

  • each instruction

  • each address

Erklärung

Frage 83 von 178

1

In contiguous memory allocation:

Wähle eine der folgenden:

  • 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

Erklärung

Frage 84 von 178

1

When memory is divided into several fixed sized partitions, each partition may contain ________.

Wähle eine der folgenden:

  • exactly one process

  • at least one process

  • multiple processes at once

  • none of the above

Erklärung

Frage 85 von 178

1

In fixed sized partition, the degree of multiprogramming is bounded by ___________.

Wähle eine der folgenden:

  • the number of partitions

  • the CPU utilization

  • the memory size

  • all of the above

Erklärung

Frage 86 von 178

1

The first fit, best fit and worst fit are strategies to select a ______.

Wähle eine der folgenden:

  • 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

Erklärung

Frage 87 von 178

1

In internal fragmentation, memory is internal to a partition and:

Wähle eine der folgenden:

  • is not being used

  • is being used

  • is always used

  • none of the above

Erklärung

Frage 88 von 178

1

A solution to the problem of external fragmentation is:

Wähle eine der folgenden:

  • compaction

  • larger memory space

  • smaller memory space

  • unequal size parts

Erklärung

Frage 89 von 178

1

__________ is generally faster than _________ .

Wähle eine der folgenden:

  • first fit, best fit

  • best fit, first fit

  • worst fit, best fit

  • none of the above

Erklärung

Frage 90 von 178

1

External fragmentation exists when:

Wähle eine der folgenden:

  • 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

Erklärung

Frage 91 von 178

1

External fragmentation will not occur when:

Wähle eine der folgenden:

  • no matter which algorithm is used, it will always occur

  • first fit is used

  • best fit is used

  • next fit is used

Erklärung

Frage 92 von 178

1

When the memory allocated to a process is slightly larger than the process, then:

Wähle eine der folgenden:

  • internal fragmentation occurs

  • external fragmentation occurs

  • both will occur

  • none of the above

Erklärung

Frage 93 von 178

1

Main memory is broken into fixed-sized blocks called ________.

Wähle eine der folgenden:

  • frames

  • pages

  • segments

  • none of the above

Erklärung

Frage 94 von 178

1

Fixed-length block of data in secondary memory is called ________.

Wähle eine der folgenden:

  • frames

  • pages

  • segments

  • none of the above

Erklärung

Frage 95 von 178

1

Variable-length block of data that resides in secondary memory is called ________.

Wähle eine der folgenden:

  • frames

  • pages

  • segments

  • none of the above

Erklärung

Frage 96 von 178

1

Every address generated by the CPU is divided into two parts:

Wähle eine oder mehr der folgenden:

  • page number

  • page offset

  • frame bit

  • frame offset

Erklärung

Frage 97 von 178

1

The __________ is used as an index into the page table.

Wähle eine der folgenden:

  • page number

  • frame bit

  • page offset

  • frame offset

Erklärung

Frage 98 von 178

1

The _____ table contains the base address of each page in physical memory.

Wähle eine der folgenden:

  • page

  • process

  • memory

  • frame

Erklärung

Frage 99 von 178

1

With paging there is no ________ fragmentation.

Wähle eine der folgenden:

  • external

  • internal

  • either type of

  • none of the above

Erklärung

Frage 100 von 178

1

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.

Wähle eine der folgenden:

  • frame

  • page

  • segment

  • memory

Erklärung

Frage 101 von 178

1

For every process there is a __________.

Wähle eine der folgenden:

  • page table

  • copy of page table

  • pointer to page table

  • frame table

Erklärung

Frage 102 von 178

1

If a page number is not found in the TLB, then it is known as a:

Wähle eine der folgenden:

  • TLB miss

  • buffer miss

  • TLB hit

  • page fault

Erklärung

Frage 103 von 178

1

If a page table entry is present in the TLB, then it is known as a:

Wähle eine der folgenden:

  • TLB miss

  • buffer miss

  • TLB hit

  • page fault

Erklärung

Frage 104 von 178

1

If a page table entry is not in main memory, then it is known as a:

Wähle eine der folgenden:

  • TLB miss

  • buffer miss

  • TLB hit

  • page fault

Erklärung

Frage 105 von 178

1

When free memory is split into many unconnected pieces we call it:

Wähle eine der folgenden:

  • Internal fragmentation

  • External fragmentation

  • Compaction

  • Memory distribution

Erklärung

Frage 106 von 178

1

Memory partitioning algorithm that uses binary tree as a data structure is called:

Wähle eine der folgenden:

  • First-fit algorithm

  • Next-fit algorithm

  • Buddy system

  • Best-fit algorithm

Erklärung

Frage 107 von 178

1

Which of the following is not a principle of storage management responsibilities?

Wähle eine der folgenden:

  • Process isolation

  • Process termination

  • Protection and access control

  • Automatic allocation and management

Erklärung

Frage 108 von 178

1

This algorithm reduces the rate of production of small gaps

Wähle eine der folgenden:

  • Best fit

  • Worst fit

  • First fit

  • Next fit

Erklärung

Frage 109 von 178

1

This is the fastest algorithm because it searches as little as possible

Wähle eine der folgenden:

  • Best fit

  • Worst fit

  • First fit

  • Next fit

Erklärung

Frage 110 von 178

1

This algorithm is slow, and may even tend to fill up memory with tiny useless holes

Wähle eine der folgenden:

  • Best fit

  • Worst fit

  • First fit

  • Next fit

Erklärung

Frage 111 von 178

1

To find a free partition this algorithm starts searching from where it left off, not from the beginning

Wähle eine der folgenden:

  • Best fit

  • Worst fit

  • First fit

  • Next fit

Erklärung

Frage 112 von 178

1

In segmentation, each address is specified by (choose two):

Wähle eine oder mehr der folgenden:

  • a segment number

  • an offset

  • a value

  • a key

Erklärung

Frage 113 von 178

1

A binary semaphore is a semaphore with integer values::A binary semaphore is a semaphore with integer values

Wähle eine der folgenden:

  • 1 and 0

  • 1 and -1

  • 0 and -1

  • 1 and 2

Erklärung

Frage 114 von 178

1

A monitor is a type of

Wähle eine der folgenden:

  • binary semaphore

  • low level synchronization construct

  • high level synchronization construct

  • general semaphore

Erklärung

Frage 115 von 178

1

A monitor is a type of

Wähle eine der folgenden:

  • high level synchronization construct

  • deadlock

  • low level synchronization construct

  • none of the above

Erklärung

Frage 116 von 178

1

A mutex

Wähle eine der folgenden:

  • is a hexadecimal value

  • must be accessed from only one process

  • can be accessed from multiple processes

  • cannot be accessed by processes

Erklärung

Frage 117 von 178

1

A procedure defined within a ________ can access only those variables declared locally within the _______ and its formal parameters

Wähle eine der folgenden:

  • process, semaphore

  • process, monitor

  • semaphore, semaphore

  • monitor, monitor

Erklärung

Frage 118 von 178

1

A semaphore

Wähle eine der folgenden:

  • is a binary mutex

  • must be accessed from only one process

  • can be accessed from multiple processes

  • is a data structure

Erklärung

Frage 119 von 178

1

A set of processes is deadlock if:

Wähle eine der folgenden:

  • 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

Erklärung

Frage 120 von 178

1

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:

Wähle eine der folgenden:

  • race condition

  • data consistency

  • starvation

  • mutual exclusion

Erklärung

Frage 121 von 178

1

An un-interruptible unit is known as

Wähle eine der folgenden:

  • single

  • atomic

  • static

  • safe

Erklärung

Frage 122 von 178

1

An un-interruptible unit is known as

Wähle eine der folgenden:

  • atomic

  • single

  • static

  • None of the above

Erklärung

Frage 123 von 178

1

Concurrent access to shared data may result in::Concurrent access to shared data may result in

Wähle eine der folgenden:

  • data consistency

  • data insecurity

  • data inconsistency

  • data complexity

Erklärung

Frage 124 von 178

1

Four necessary conditions for deadlock to exist are: mutual exclusion, no-preemption, circular wait and

Wähle eine der folgenden:

  • hold and wait

  • deadlock avoidance

  • race condition

  • starvation

Erklärung

Frage 125 von 178

1

If a process is executing in its critical section, then no other processes can be executing in their critical section. This condition is called

Wähle eine der folgenden:

  • mutual exclusion

  • critical exclusion

  • synchronous exclusion

  • asynchronous exclusion

Erklärung

Frage 126 von 178

1

If no process is suspended, the signal operation

Wähle eine der folgenden:

  • puts the system into a deadlock state

  • suspends some default process' execution

  • nothing happens

  • the output is unpredictable

Erklärung

Frage 127 von 178

1

In indirect communication between processes P and Q:

Wähle eine der folgenden:

  • 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

Erklärung

Frage 128 von 178

1

In the blocking send, blocking receive:

Wähle eine der folgenden:

  • 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

Erklärung

Frage 129 von 178

1

In the non-blocking send, blocking receive:

Wähle eine der folgenden:

  • 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

Erklärung

Frage 130 von 178

1

In the non-blocking send, non-blocking receive:

Wähle eine der folgenden:

  • 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

Erklärung

Frage 131 von 178

1

In the non-blocking send:

Wähle eine der folgenden:

  • 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

Erklärung

Frage 132 von 178

1

Interprocess communication:

Wähle eine der folgenden:

  • 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

Erklärung

Frage 133 von 178

1

Mutual exclusion can be provided by the

Wähle eine der folgenden:

  • mutex locks

  • binary semaphores

  • both mutex locks and binary semaphores

  • none of the mentioned

Erklärung

Frage 134 von 178

1

Mutual exclusion can be provided by the

Wähle eine der folgenden:

  • mutex locks

  • binary semaphores

  • both

  • none of the above

Erklärung

Frage 135 von 178

1

Mutual exclusion implies that

Wähle eine der folgenden:

  • 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

Erklärung

Frage 136 von 178

1

Mutual exclusion means that?

Wähle eine der folgenden:

  • 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

Erklärung

Frage 137 von 178

1

Part of a program where the shared memory is accessed and which should be executed invisibly, is called:

Wähle eine der folgenden:

  • critical section

  • mutual exclusion

  • semaphores

  • directory

Erklärung

Frage 138 von 178

1

Semaphore is a/an _______ to solve the critical section problem?

Wähle eine der folgenden:

  • integer variable

  • hardware for a system

  • special program for a system

  • complex structure

Erklärung

Frage 139 von 178

1

Semaphores are mostly used to implement

Wähle eine der folgenden:

  • System calls

  • Interprocess communication mechanisms

  • System protection

  • Interrupts

Erklärung

Frage 140 von 178

1

Semaphores:

Wähle eine der folgenden:

  • synchronize critical resources to prevent deadlock

  • synchronize critical resources to prevent contention

  • are used to do I/O

  • are used for memory management

Erklärung

Frage 141 von 178

1

The bounded buffer problem is also known as

Wähle eine der folgenden:

  • Readers - Writers problem

  • Dining - Philosophers problem

  • Producer - Consumer problem

  • Banker's algorithm

Erklärung

Frage 142 von 178

1

The code that changes the value of the semaphore is:

Wähle eine der folgenden:

  • critical section code

  • remainder section code

  • non - critical section code

  • None of the above

Erklärung

Frage 143 von 178

1

The initial value of the semaphore that allows only one of the many processes to enter their critical sections, is?

Wähle eine der folgenden:

  • 1

  • 0

  • 2

  • 10

Erklärung

Frage 144 von 178

1

The link between two processes P and Q to send and receive messages is called:

Wähle eine der folgenden:

  • communication link

  • message-passing link

  • synchronization link

  • all of the above

Erklärung

Frage 145 von 178

1

The monitor construct ensures that

Wähle eine der folgenden:

  • 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

Erklärung

Frage 146 von 178

1

The operations that can be invoked on a condition variable are

Wähle eine der folgenden:

  • wait & signal

  • hold & wait

  • signal & hold

  • continue & signal

Erklärung

Frage 147 von 178

1

The process invoking the wait operation is

Wähle eine der folgenden:

  • 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

Erklärung

Frage 148 von 178

1

The segment of code in which the process may change common variables, update tables, write into files is known as?

Wähle eine der folgenden:

  • critical section

  • program

  • mutual exclusion

  • non-critical section

Erklärung

Frage 149 von 178

1

The two atomic operations permissible on semaphores are

Wähle eine der folgenden:

  • wait, signal

  • stop, start

  • hold, wait

  • wait, call

Erklärung

Frage 150 von 178

1

If the semaphore value is negative

Wähle eine der folgenden:

  • 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

Erklärung

Frage 151 von 178

1

two kinds of semaphores are

Wähle eine der folgenden:

  • mutex &; counting

  • binary & counting

  • counting & decimal

  • decimal & binary

Erklärung

Frage 152 von 178

1

To avoid the race condition, the number of processes that may be simultaneously inside their critical section is

Wähle eine der folgenden:

  • 1

  • 10

  • 0

  • 2

Erklärung

Frage 153 von 178

1

To enable a process to wait within the monitor

Wähle eine der folgenden:

  • a condition variable must be declared as condition

  • condition variables must be used as boolean objects

  • semaphore must be used

  • all of the mentioned

Erklärung

Frage 154 von 178

1

What is a trap/exception?

Wähle eine der folgenden:

  • 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

Erklärung

Frage 155 von 178

1

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

Wähle eine der folgenden:

  • race condition

  • dynamic condition

  • essential condition

  • critical condition

Erklärung

Frage 156 von 178

1

Which of the following are TRUE for direct communication

Wähle eine der folgenden:

  • 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

Erklärung

Frage 157 von 178

1

Index register, segment register, and stack register are example of:

Wähle eine der folgenden:

  • Data registers

  • Address registers

  • Control registers

  • Status registers

Erklärung

Frage 158 von 178

1

The processor contains a single data register, called

Wähle eine der folgenden:

  • AC

  • PC

  • IR

  • PSW

Erklärung

Frage 159 von 178

1

This register contains the data to be written into memory or which receives the data read from memory

Wähle eine der folgenden:

  • Memory buffer register

  • Memory address register

  • I/OAR

  • I/OBR

Erklärung

Frage 160 von 178

1

This register is used for the exchange of data between an I/O module and the processor

Wähle eine der folgenden:

  • Memory buffer register

  • Memory address register

  • I/OAR

  • I/OBR

Erklärung

Frage 161 von 178

1

This register specifies a particular input/output device

Wähle eine der folgenden:

  • Memory buffer register

  • Memory address register

  • I/OAR

  • I/OBR

Erklärung

Frage 162 von 178

1

This register specifies the location in memory for the next read or write

Wähle eine der folgenden:

  • Memory buffer register

  • Memory address register

  • I/OAR

  • I/OBR

Erklärung

Frage 163 von 178

1

Which register contains condition codes set by the processor hardware as the result of operations?{

Wähle eine der folgenden:

  • Program status word

  • Program counter

  • Stack pointer

  • Accumulator

Erklärung

Frage 164 von 178

1

Which register contains the address of the next instruction to be fetched?

Wähle eine der folgenden:

  • Program counter

  • Instruction register

  • Execution register

  • Process counter

Erklärung

Frage 165 von 178

1

Which register contains the instruction most recently fetched?

Wähle eine der folgenden:

  • Program counter

  • Instruction register

  • Execution register

  • Process counter

Erklärung

Frage 166 von 178

1

Control and status registers control the operation of the processor and the execution of programs

Wähle eins der folgenden:

  • WAHR
  • FALSCH

Erklärung

Frage 167 von 178

1

User-visible registers minimize main memory references by optimizing register use

Wähle eins der folgenden:

  • WAHR
  • FALSCH

Erklärung

Frage 168 von 178

1

Virtual memory takes advantage of

Wähle eine der folgenden:

  • Fast CPU

  • Large secondary memory

  • Modular programming

  • Scheduling

Erklärung

Frage 169 von 178

1

Which of the replacement algorithms selects for replacement that page for which the time to the next reference is the longest?

Wähle eine der folgenden:

  • optimal

  • LRU

  • FIFO

  • Clock

Erklärung

Frage 170 von 178

1

What does process page table entry contain?

Wähle eine der folgenden:

  • 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

Erklärung

Frage 171 von 178

1

Which of the replacement algorithms replaces the page in memory that has not been referenced for the longest time?

Wähle eine der folgenden:

  • optimal

  • LRU

  • FIFO

  • Clock

Erklärung

Frage 172 von 178

1

Which of the replacement algorithms treats the page frames allocated to a process as a circular buffer?

Wähle eine der folgenden:

  • optimal

  • LRU

  • FIFO

  • Clock

Erklärung

Frage 173 von 178

1

What is the real address?

Wähle eine der folgenden:

  • a physical address in main memory

  • a virtual address in main memory

  • a virtual address in secondary memory

  • a physical address in cache memory

Erklärung

Frage 174 von 178

1

What is virtual address?

Wähle eine der folgenden:

  • 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.

Erklärung

Frage 175 von 178

1

The size of virtual storage is limited by...

Wähle eine der folgenden:

  • 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

Erklärung

Frage 176 von 178

1

What is the resident set of the process?

Wähle eine der folgenden:

  • 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.

Erklärung

Frage 177 von 178

1

When does processor generate an interrupt indicating a memory access fault? {

Wähle eine der folgenden:

  • 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.

Erklärung

Frage 178 von 178

1

What is trashing? {

Wähle eine der folgenden:

  • 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.

Erklärung

Vorherige
Antwort prüfen
Nächste