Good Guy Beket
Quiz por , criado more than 1 year ago

Suicidal Operating Systems [Teachers: Teshebayeva Karagoz, Mishina Aigerim ; Final Exam + STATE EXAM] ▼ Quiz sobre OS | 178 questions [NEW BAZA], criado por Good Guy Beket em 28-03-2019.

1052
14
0
Good Guy Beket
Criado por Good Guy Beket mais de 5 anos atrás
Fechar

OS | 178 questions [NEW BAZA]

OS | 178 questions [NEW BAZA]

Questão 1 de 178

1

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

Selecione uma das seguintes:

  • Processor

  • Main memory

  • System bus

  • Operating bus

Explicação

Questão 2 de 178

1

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

Selecione uma das seguintes:

  • Processor

  • Main memory

  • System bus

  • I/O modules

Explicação

Questão 3 de 178

1

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

Selecione uma das seguintes:

  • Processor

  • Main memory

  • System bus

  • I/O modules

Explicação

Questão 4 de 178

1

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

Selecione uma das seguintes:

  • Processor

  • Main memory

  • System bus

  • I/O modules

Explicação

Questão 5 de 178

1

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

Selecione uma das seguintes:

  • Processor

  • Main memory

  • System bus

  • I/O modules

Explicação

Questão 6 de 178

1

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

Selecione uma das seguintes:

  • MAR and MBR

  • I/OAR and I/OBR

  • PC and IR

  • Program status word

Explicação

Questão 7 de 178

1

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

Selecione uma das seguintes:

  • MAR and MBR

  • I/OAR and I/OBR

  • PC and IR

  • Program status word

Explicação

Questão 8 de 178

1

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

Selecione uma das seguintes:

  • cache latency

  • cache hit

  • cache delay

  • cache miss

Explicação

Questão 9 de 178

1

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

Selecione uma das seguintes:

  • block

  • tag

  • word

  • set

Explicação

Questão 10 de 178

1

In fully associative mapping, there are the following fields

Selecione uma das seguintes:

  • tag, word

  • tag, block, word

  • tag, set, word

  • tag, block

Explicação

Questão 11 de 178

1

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

Selecione uma das seguintes:

  • Replacement algorithm

  • Renewal algorithm

  • Updation

  • Compaction

Explicação

Questão 12 de 178

1

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

Selecione uma das seguintes:

  • Control bit

  • Reference bit

  • Dirty bit

  • Valid bit

Explicação

Questão 13 de 178

1

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

Selecione uma das seguintes:

  • Hash function

  • Mapping function

  • Locale function

  • Assign function

Explicação

Questão 14 de 178

1

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

Selecione uma das seguintes:

  • Locality of reference

  • Memory localisation

  • Memory size

  • Memory access time

Explicação

Questão 15 de 178

1

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

Selecione uma das seguintes:

  • Hash functions

  • Write policy

  • Replacement policy

  • Mapping functions

Explicação

Questão 16 de 178

1

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

Selecione uma das seguintes:

  • Set associative

  • Fully associative

  • Direct

  • Indirect

Explicação

Questão 17 de 178

1

The reason for the implementation of the cache memory is ________

Selecione uma das seguintes:

  • 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

Explicação

Questão 18 de 178

1

The spatial aspect of the locality of reference means ________

Selecione uma das seguintes:

  • 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

Explicação

Questão 19 de 178

1

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

Selecione uma das seguintes:

  • Linear search

  • Binary search

  • Associative search

  • Indirect search

Explicação

Questão 20 de 178

1

The temporal aspect of the locality of reference means ________

Selecione uma das seguintes:

  • 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

Explicação

Questão 21 de 178

1

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

Selecione uma das seguintes:

  • Control bit

  • Reference bit

  • Dirty bit

  • Valid bit

Explicação

Questão 22 de 178

1

Which is the fastest cache mapping function?

Selecione uma das seguintes:

  • Direct mapping

  • Set associative mapping

  • Fully associative mapping

Explicação

Questão 23 de 178

1

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

Selecione uma das seguintes:

  • tag

  • block/slot

  • word

  • ID

Explicação

Questão 24 de 178

1

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

Selecione uma das opções:

  • VERDADEIRO
  • FALSO

Explicação

Questão 25 de 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:

Selecione uma das seguintes:

  • Ts = H1 × T1

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

  • Ts = H1 × T1 + H1 × T2

  • Ts = H1 × (T1 + T2)

Explicação

Questão 26 de 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:

Selecione uma das seguintes:

  • Ts = H1 × T1

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

  • Ts = H1 × T1 + H1 × T2

  • Ts = H1 × (T1 + T2)

Explicação

Questão 27 de 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:

Selecione uma das seguintes:

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

Explicação

Questão 28 de 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:

Selecione uma das seguintes:

  • 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

Explicação

Questão 29 de 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:

Selecione uma das seguintes:

  • 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

Explicação

Questão 30 de 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:

Selecione uma das seguintes:

  • 2

  • 12

  • 42

  • 7

Explicação

Questão 31 de 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

Selecione uma das seguintes:

  • 42

  • 2

  • 7

  • 12

Explicação

Questão 32 de 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 ?

Selecione uma das seguintes:

  • one

  • two

  • three

  • four

Explicação

Questão 33 de 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

Selecione uma das seguintes:

  • A1 A2 B1 B2

  • A1 B1 A2 B2

  • A1 B1 B2 A2

  • B1 B2 A1 A2

Explicação

Questão 34 de 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

Selecione uma das seguintes:

  • A1 B1 A2 B2

  • A1 B1 B2 A2

  • B1 A1 B2 A2

  • B1 B2 A1 A2

Explicação

Questão 35 de 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?

Selecione uma das seguintes:

  • B1 A1 B2 A2

  • B1 A1 A2 B2

  • B1 B2 A1 A2

  • A1 A2 B1 B2

Explicação

Questão 36 de 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?

Selecione uma das seguintes:

  • A1 A2 B1 B2

  • B1 A1 B2 A2

  • B1 A1 A2 B2

  • B1 B2 A1 A2

Explicação

Questão 37 de 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?

Selecione uma das seguintes:

  • A1 A2 B1 B2

  • A1 B1 B2 A2

  • B1 A1 A2 B2

  • B1 B2 A1 A2

Explicação

Questão 38 de 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?

Selecione uma das seguintes:

  • A1 B1 A2 B2

  • B1 A1 B2 A2

  • B1 A1 A2 B2

  • B1 B2 A1 A2

Explicação

Questão 39 de 178

1

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

Selecione uma das seguintes:

  • Serialization and Mutual exclusion

  • Queueing and dispatching

  • Scheduling and dispatching

  • Serialization and Mutual inclusion

Explicação

Questão 40 de 178

1

Concurrent writes:

Selecione uma das seguintes:

  • 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

Explicação

Questão 41 de 178

1

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

Selecione uma das seguintes:

  • non-deterministic

  • non-distributed

  • non-deadlocked

  • non-divisible

Explicação

Questão 42 de 178

1

sem.signal () ...

Selecione uma das seguintes:

  • decrements the semaphore

  • increments the semaphore

  • reads the semaphore

  • initializes the semaphore

Explicação

Questão 43 de 178

1

sem.wait () ...

Selecione uma das seguintes:

  • decrements the semaphore

  • increments the semaphore

  • reads the semaphore

  • initializes the semaphore

Explicação

Questão 44 de 178

1

Semaphore operation sem.P( ) is alternative to

Selecione uma das seguintes:

  • sem.signal

  • sem.wait

  • semaphore initialization

  • semaphore read

Explicação

Questão 45 de 178

1

Semaphore operation sem.V( ) is alternative to

Selecione uma das seguintes:

  • sem.signal ( )

  • sem.wait( )

  • semaphore initialization

  • semaphore read

Explicação

Questão 46 de 178

1

Semaphores were invented by

Selecione uma das seguintes:

  • Edsger Dijkstra

  • Tim Berners-Lee

  • Vint Cerf

  • Leonard Kleinrock

Explicação

Questão 47 de 178

1

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

Selecione uma das seguintes:

  • Concurrent

  • Constrained

  • Sequential

  • Mutually excluded

Explicação

Questão 48 de 178

1

Block size is:

Selecione uma das seguintes:

  • 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

Explicação

Questão 49 de 178

1

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

Selecione uma das seguintes:

  • hit

  • win

  • bingo

  • evrika

Explicação

Questão 50 de 178

1

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

Selecione uma das seguintes:

  • miss

  • loss

  • ricochet

  • zero

Explicação

Questão 51 de 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:

Selecione uma das seguintes:

  • write policy

  • locality of reference

  • replacement algorithm

  • mapping function

Explicação

Questão 52 de 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:

Selecione uma das seguintes:

  • cache size

  • write policy

  • locality of reference

  • replacement algorithm

Explicação

Questão 53 de 178

1

This determines which cache location the block will occupy:

Selecione uma das seguintes:

  • mapping function

  • write policy

  • locality of reference

  • block size

Explicação

Questão 54 de 178

1

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

Selecione uma das seguintes:

  • Cache

  • Main memory

  • Disk

  • CD

Explicação

Questão 55 de 178

1

Which of the following statements is false:

Selecione uma das seguintes:

  • 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

Explicação

Questão 56 de 178

1

Memory:

Selecione uma das seguintes:

  • 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

Explicação

Questão 57 de 178

1

Processor:

Selecione uma das seguintes:

  • 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

Explicação

Questão 58 de 178

1

Program:

Selecione uma das seguintes:

  • 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

Explicação

Questão 59 de 178

1

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

Selecione uma das seguintes:

  • segmentation

  • swapping

  • multiple contiguous fixed partitions

  • pure demand paging

Explicação

Questão 60 de 178

1

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

Selecione uma das seguintes:

  • fixed partitioning

  • segmentation

  • virtual memory segmentation

  • pure demand paging

Explicação

Questão 61 de 178

1

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

Selecione uma das seguintes:

  • internal fragmentation

  • segmentation

  • external fragmentation

  • paging

Explicação

Questão 62 de 178

1

How to solve problem of equal-size partitions?

Selecione uma das seguintes:

  • unequal-size partitions

  • segmentation

  • virtual memory segmentation

  • compaction

Explicação

Questão 63 de 178

1

How to solve problem of "external" fragmentation?

Selecione uma das seguintes:

  • compaction

  • segmentation

  • virtual memory segmentation

  • unequal-size partitions

Explicação

Questão 64 de 178

1

A page fault?

Selecione uma das seguintes:

  • 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

Explicação

Questão 65 de 178

1

Which of the following statements is false?

Selecione uma das seguintes:

  • 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

Explicação

Questão 66 de 178

1

Swapping:

Selecione uma das seguintes:

  • 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

Explicação

Questão 67 de 178

1

Swapping:

Selecione uma das seguintes:

  • 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

Explicação

Questão 68 de 178

1

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

Selecione uma das seguintes:

  • virtual memory is used only in multi-user systems

  • segmentation suffers from external fragmentation

  • paging suffers from internal fragmentation

  • segmented memory can be paged

Explicação

Questão 69 de 178

1

Segmentation suffers from external fragmentation?

Selecione uma das opções:

  • VERDADEIRO
  • FALSO

Explicação

Questão 70 de 178

1

Paging suffers from external fragmentation?

Selecione uma das opções:

  • VERDADEIRO
  • FALSO

Explicação

Questão 71 de 178

1

Paging ...

Selecione uma das seguintes:

  • 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

Explicação

Questão 72 de 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?

Selecione uma das seguintes:

  • paging

  • partition

  • segmentation

  • virtual memory

Explicação

Questão 73 de 178

1

In memory systems, boundary registers?

Selecione uma das seguintes:

  • 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

Explicação

Questão 74 de 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?

Selecione uma das seguintes:

  • mutual exclusion

  • semaphore

  • multiprogramming

  • multitasking

Explicação

Questão 75 de 178

1

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

Selecione uma das seguintes:

  • program counter

  • status register

  • instruction register

  • program status word

Explicação

Questão 76 de 178

1

A memory used to provide a high speed is called?

Selecione uma das seguintes:

  • cache

  • stack pointer

  • disk buffer

  • main memory

Explicação

Questão 77 de 178

1

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

Selecione uma das seguintes:

  • logical address

  • physical address

  • absolute address

  • none of the above

Explicação

Questão 78 de 178

1

Runtime mapping from virtual to physical address is done by?

Selecione uma das seguintes:

  • memory management unit

  • CPU

  • PCI

  • none of the above

Explicação

Questão 79 de 178

1

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

Selecione uma das seguintes:

  • page table base register

  • stack pointer

  • page register

  • program counter

Explicação

Questão 80 de 178

1

Program always deals with:

Selecione uma das seguintes:

  • logical address

  • physical address

  • absolute address

  • relative address

Explicação

Questão 81 de 178

1

What is compaction?

Selecione uma das seguintes:

  • a technique for overcoming external fragmentation

  • a paging technique

  • a technique for overcoming internal fragmentation

  • a technique for overcoming fatal error

Explicação

Questão 82 de 178

1

Operating System maintains the page table for:

Selecione uma das seguintes:

  • each process

  • each thread

  • each instruction

  • each address

Explicação

Questão 83 de 178

1

In contiguous memory allocation:

Selecione uma das seguintes:

  • 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

Explicação

Questão 84 de 178

1

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

Selecione uma das seguintes:

  • exactly one process

  • at least one process

  • multiple processes at once

  • none of the above

Explicação

Questão 85 de 178

1

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

Selecione uma das seguintes:

  • the number of partitions

  • the CPU utilization

  • the memory size

  • all of the above

Explicação

Questão 86 de 178

1

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

Selecione uma das seguintes:

  • 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

Explicação

Questão 87 de 178

1

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

Selecione uma das seguintes:

  • is not being used

  • is being used

  • is always used

  • none of the above

Explicação

Questão 88 de 178

1

A solution to the problem of external fragmentation is:

Selecione uma das seguintes:

  • compaction

  • larger memory space

  • smaller memory space

  • unequal size parts

Explicação

Questão 89 de 178

1

__________ is generally faster than _________ .

Selecione uma das seguintes:

  • first fit, best fit

  • best fit, first fit

  • worst fit, best fit

  • none of the above

Explicação

Questão 90 de 178

1

External fragmentation exists when:

Selecione uma das seguintes:

  • 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

Explicação

Questão 91 de 178

1

External fragmentation will not occur when:

Selecione uma das seguintes:

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

  • first fit is used

  • best fit is used

  • next fit is used

Explicação

Questão 92 de 178

1

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

Selecione uma das seguintes:

  • internal fragmentation occurs

  • external fragmentation occurs

  • both will occur

  • none of the above

Explicação

Questão 93 de 178

1

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

Selecione uma das seguintes:

  • frames

  • pages

  • segments

  • none of the above

Explicação

Questão 94 de 178

1

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

Selecione uma das seguintes:

  • frames

  • pages

  • segments

  • none of the above

Explicação

Questão 95 de 178

1

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

Selecione uma das seguintes:

  • frames

  • pages

  • segments

  • none of the above

Explicação

Questão 96 de 178

1

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

Selecione uma ou mais das seguintes:

  • page number

  • page offset

  • frame bit

  • frame offset

Explicação

Questão 97 de 178

1

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

Selecione uma das seguintes:

  • page number

  • frame bit

  • page offset

  • frame offset

Explicação

Questão 98 de 178

1

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

Selecione uma das seguintes:

  • page

  • process

  • memory

  • frame

Explicação

Questão 99 de 178

1

With paging there is no ________ fragmentation.

Selecione uma das seguintes:

  • external

  • internal

  • either type of

  • none of the above

Explicação

Questão 100 de 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.

Selecione uma das seguintes:

  • frame

  • page

  • segment

  • memory

Explicação

Questão 101 de 178

1

For every process there is a __________.

Selecione uma das seguintes:

  • page table

  • copy of page table

  • pointer to page table

  • frame table

Explicação

Questão 102 de 178

1

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

Selecione uma das seguintes:

  • TLB miss

  • buffer miss

  • TLB hit

  • page fault

Explicação

Questão 103 de 178

1

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

Selecione uma das seguintes:

  • TLB miss

  • buffer miss

  • TLB hit

  • page fault

Explicação

Questão 104 de 178

1

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

Selecione uma das seguintes:

  • TLB miss

  • buffer miss

  • TLB hit

  • page fault

Explicação

Questão 105 de 178

1

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

Selecione uma das seguintes:

  • Internal fragmentation

  • External fragmentation

  • Compaction

  • Memory distribution

Explicação

Questão 106 de 178

1

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

Selecione uma das seguintes:

  • First-fit algorithm

  • Next-fit algorithm

  • Buddy system

  • Best-fit algorithm

Explicação

Questão 107 de 178

1

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

Selecione uma das seguintes:

  • Process isolation

  • Process termination

  • Protection and access control

  • Automatic allocation and management

Explicação

Questão 108 de 178

1

This algorithm reduces the rate of production of small gaps

Selecione uma das seguintes:

  • Best fit

  • Worst fit

  • First fit

  • Next fit

Explicação

Questão 109 de 178

1

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

Selecione uma das seguintes:

  • Best fit

  • Worst fit

  • First fit

  • Next fit

Explicação

Questão 110 de 178

1

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

Selecione uma das seguintes:

  • Best fit

  • Worst fit

  • First fit

  • Next fit

Explicação

Questão 111 de 178

1

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

Selecione uma das seguintes:

  • Best fit

  • Worst fit

  • First fit

  • Next fit

Explicação

Questão 112 de 178

1

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

Selecione uma ou mais das seguintes:

  • a segment number

  • an offset

  • a value

  • a key

Explicação

Questão 113 de 178

1

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

Selecione uma das seguintes:

  • 1 and 0

  • 1 and -1

  • 0 and -1

  • 1 and 2

Explicação

Questão 114 de 178

1

A monitor is a type of

Selecione uma das seguintes:

  • binary semaphore

  • low level synchronization construct

  • high level synchronization construct

  • general semaphore

Explicação

Questão 115 de 178

1

A monitor is a type of

Selecione uma das seguintes:

  • high level synchronization construct

  • deadlock

  • low level synchronization construct

  • none of the above

Explicação

Questão 116 de 178

1

A mutex

Selecione uma das seguintes:

  • is a hexadecimal value

  • must be accessed from only one process

  • can be accessed from multiple processes

  • cannot be accessed by processes

Explicação

Questão 117 de 178

1

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

Selecione uma das seguintes:

  • process, semaphore

  • process, monitor

  • semaphore, semaphore

  • monitor, monitor

Explicação

Questão 118 de 178

1

A semaphore

Selecione uma das seguintes:

  • is a binary mutex

  • must be accessed from only one process

  • can be accessed from multiple processes

  • is a data structure

Explicação

Questão 119 de 178

1

A set of processes is deadlock if:

Selecione uma das seguintes:

  • 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

Explicação

Questão 120 de 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:

Selecione uma das seguintes:

  • race condition

  • data consistency

  • starvation

  • mutual exclusion

Explicação

Questão 121 de 178

1

An un-interruptible unit is known as

Selecione uma das seguintes:

  • single

  • atomic

  • static

  • safe

Explicação

Questão 122 de 178

1

An un-interruptible unit is known as

Selecione uma das seguintes:

  • atomic

  • single

  • static

  • None of the above

Explicação

Questão 123 de 178

1

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

Selecione uma das seguintes:

  • data consistency

  • data insecurity

  • data inconsistency

  • data complexity

Explicação

Questão 124 de 178

1

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

Selecione uma das seguintes:

  • hold and wait

  • deadlock avoidance

  • race condition

  • starvation

Explicação

Questão 125 de 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

Selecione uma das seguintes:

  • mutual exclusion

  • critical exclusion

  • synchronous exclusion

  • asynchronous exclusion

Explicação

Questão 126 de 178

1

If no process is suspended, the signal operation

Selecione uma das seguintes:

  • puts the system into a deadlock state

  • suspends some default process' execution

  • nothing happens

  • the output is unpredictable

Explicação

Questão 127 de 178

1

In indirect communication between processes P and Q:

Selecione uma das seguintes:

  • 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

Explicação

Questão 128 de 178

1

In the blocking send, blocking receive:

Selecione uma das seguintes:

  • 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

Explicação

Questão 129 de 178

1

In the non-blocking send, blocking receive:

Selecione uma das seguintes:

  • 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

Explicação

Questão 130 de 178

1

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

Selecione uma das seguintes:

  • 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

Explicação

Questão 131 de 178

1

In the non-blocking send:

Selecione uma das seguintes:

  • 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

Explicação

Questão 132 de 178

1

Interprocess communication:

Selecione uma das seguintes:

  • 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

Explicação

Questão 133 de 178

1

Mutual exclusion can be provided by the

Selecione uma das seguintes:

  • mutex locks

  • binary semaphores

  • both mutex locks and binary semaphores

  • none of the mentioned

Explicação

Questão 134 de 178

1

Mutual exclusion can be provided by the

Selecione uma das seguintes:

  • mutex locks

  • binary semaphores

  • both

  • none of the above

Explicação

Questão 135 de 178

1

Mutual exclusion implies that

Selecione uma das seguintes:

  • 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

Explicação

Questão 136 de 178

1

Mutual exclusion means that?

Selecione uma das seguintes:

  • 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

Explicação

Questão 137 de 178

1

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

Selecione uma das seguintes:

  • critical section

  • mutual exclusion

  • semaphores

  • directory

Explicação

Questão 138 de 178

1

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

Selecione uma das seguintes:

  • integer variable

  • hardware for a system

  • special program for a system

  • complex structure

Explicação

Questão 139 de 178

1

Semaphores are mostly used to implement

Selecione uma das seguintes:

  • System calls

  • Interprocess communication mechanisms

  • System protection

  • Interrupts

Explicação

Questão 140 de 178

1

Semaphores:

Selecione uma das seguintes:

  • synchronize critical resources to prevent deadlock

  • synchronize critical resources to prevent contention

  • are used to do I/O

  • are used for memory management

Explicação

Questão 141 de 178

1

The bounded buffer problem is also known as

Selecione uma das seguintes:

  • Readers - Writers problem

  • Dining - Philosophers problem

  • Producer - Consumer problem

  • Banker's algorithm

Explicação

Questão 142 de 178

1

The code that changes the value of the semaphore is:

Selecione uma das seguintes:

  • critical section code

  • remainder section code

  • non - critical section code

  • None of the above

Explicação

Questão 143 de 178

1

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

Selecione uma das seguintes:

  • 1

  • 0

  • 2

  • 10

Explicação

Questão 144 de 178

1

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

Selecione uma das seguintes:

  • communication link

  • message-passing link

  • synchronization link

  • all of the above

Explicação

Questão 145 de 178

1

The monitor construct ensures that

Selecione uma das seguintes:

  • 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

Explicação

Questão 146 de 178

1

The operations that can be invoked on a condition variable are

Selecione uma das seguintes:

  • wait & signal

  • hold & wait

  • signal & hold

  • continue & signal

Explicação

Questão 147 de 178

1

The process invoking the wait operation is

Selecione uma das seguintes:

  • 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

Explicação

Questão 148 de 178

1

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

Selecione uma das seguintes:

  • critical section

  • program

  • mutual exclusion

  • non-critical section

Explicação

Questão 149 de 178

1

The two atomic operations permissible on semaphores are

Selecione uma das seguintes:

  • wait, signal

  • stop, start

  • hold, wait

  • wait, call

Explicação

Questão 150 de 178

1

If the semaphore value is negative

Selecione uma das seguintes:

  • 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

Explicação

Questão 151 de 178

1

two kinds of semaphores are

Selecione uma das seguintes:

  • mutex &; counting

  • binary & counting

  • counting & decimal

  • decimal & binary

Explicação

Questão 152 de 178

1

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

Selecione uma das seguintes:

  • 1

  • 10

  • 0

  • 2

Explicação

Questão 153 de 178

1

To enable a process to wait within the monitor

Selecione uma das seguintes:

  • a condition variable must be declared as condition

  • condition variables must be used as boolean objects

  • semaphore must be used

  • all of the mentioned

Explicação

Questão 154 de 178

1

What is a trap/exception?

Selecione uma das seguintes:

  • 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

Explicação

Questão 155 de 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

Selecione uma das seguintes:

  • race condition

  • dynamic condition

  • essential condition

  • critical condition

Explicação

Questão 156 de 178

1

Which of the following are TRUE for direct communication

Selecione uma das seguintes:

  • 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

Explicação

Questão 157 de 178

1

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

Selecione uma das seguintes:

  • Data registers

  • Address registers

  • Control registers

  • Status registers

Explicação

Questão 158 de 178

1

The processor contains a single data register, called

Selecione uma das seguintes:

  • AC

  • PC

  • IR

  • PSW

Explicação

Questão 159 de 178

1

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

Selecione uma das seguintes:

  • Memory buffer register

  • Memory address register

  • I/OAR

  • I/OBR

Explicação

Questão 160 de 178

1

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

Selecione uma das seguintes:

  • Memory buffer register

  • Memory address register

  • I/OAR

  • I/OBR

Explicação

Questão 161 de 178

1

This register specifies a particular input/output device

Selecione uma das seguintes:

  • Memory buffer register

  • Memory address register

  • I/OAR

  • I/OBR

Explicação

Questão 162 de 178

1

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

Selecione uma das seguintes:

  • Memory buffer register

  • Memory address register

  • I/OAR

  • I/OBR

Explicação

Questão 163 de 178

1

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

Selecione uma das seguintes:

  • Program status word

  • Program counter

  • Stack pointer

  • Accumulator

Explicação

Questão 164 de 178

1

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

Selecione uma das seguintes:

  • Program counter

  • Instruction register

  • Execution register

  • Process counter

Explicação

Questão 165 de 178

1

Which register contains the instruction most recently fetched?

Selecione uma das seguintes:

  • Program counter

  • Instruction register

  • Execution register

  • Process counter

Explicação

Questão 166 de 178

1

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

Selecione uma das opções:

  • VERDADEIRO
  • FALSO

Explicação

Questão 167 de 178

1

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

Selecione uma das opções:

  • VERDADEIRO
  • FALSO

Explicação

Questão 168 de 178

1

Virtual memory takes advantage of

Selecione uma das seguintes:

  • Fast CPU

  • Large secondary memory

  • Modular programming

  • Scheduling

Explicação

Questão 169 de 178

1

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

Selecione uma das seguintes:

  • optimal

  • LRU

  • FIFO

  • Clock

Explicação

Questão 170 de 178

1

What does process page table entry contain?

Selecione uma das seguintes:

  • 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

Explicação

Questão 171 de 178

1

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

Selecione uma das seguintes:

  • optimal

  • LRU

  • FIFO

  • Clock

Explicação

Questão 172 de 178

1

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

Selecione uma das seguintes:

  • optimal

  • LRU

  • FIFO

  • Clock

Explicação

Questão 173 de 178

1

What is the real address?

Selecione uma das seguintes:

  • a physical address in main memory

  • a virtual address in main memory

  • a virtual address in secondary memory

  • a physical address in cache memory

Explicação

Questão 174 de 178

1

What is virtual address?

Selecione uma das seguintes:

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

Explicação

Questão 175 de 178

1

The size of virtual storage is limited by...

Selecione uma das seguintes:

  • 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

Explicação

Questão 176 de 178

1

What is the resident set of the process?

Selecione uma das seguintes:

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

Explicação

Questão 177 de 178

1

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

Selecione uma das seguintes:

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

Explicação

Questão 178 de 178

1

What is trashing? {

Selecione uma das seguintes:

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

Explicação

Anterior
Verificar resposta
Próximo