Good Guy Beket
Quiz by , created more than 1 year ago

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

1011
14
0
Good Guy Beket
Created by Good Guy Beket over 5 years ago
Close

OS | 178 questions [NEW BAZA]

OS | 178 questions [NEW BAZA]

Question 1 of 178

1

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

Select one of the following:

  • Processor

  • Main memory

  • System bus

  • Operating bus

Explanation

Question 2 of 178

1

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

Select one of the following:

  • Processor

  • Main memory

  • System bus

  • I/O modules

Explanation

Question 3 of 178

1

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

Select one of the following:

  • Processor

  • Main memory

  • System bus

  • I/O modules

Explanation

Question 4 of 178

1

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

Select one of the following:

  • Processor

  • Main memory

  • System bus

  • I/O modules

Explanation

Question 5 of 178

1

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

Select one of the following:

  • Processor

  • Main memory

  • System bus

  • I/O modules

Explanation

Question 6 of 178

1

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

Select one of the following:

  • MAR and MBR

  • I/OAR and I/OBR

  • PC and IR

  • Program status word

Explanation

Question 7 of 178

1

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

Select one of the following:

  • MAR and MBR

  • I/OAR and I/OBR

  • PC and IR

  • Program status word

Explanation

Question 8 of 178

1

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

Select one of the following:

  • cache latency

  • cache hit

  • cache delay

  • cache miss

Explanation

Question 9 of 178

1

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

Select one of the following:

  • block

  • tag

  • word

  • set

Explanation

Question 10 of 178

1

In fully associative mapping, there are the following fields

Select one of the following:

  • tag, word

  • tag, block, word

  • tag, set, word

  • tag, block

Explanation

Question 11 of 178

1

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

Select one of the following:

  • Replacement algorithm

  • Renewal algorithm

  • Updation

  • Compaction

Explanation

Question 12 of 178

1

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

Select one of the following:

  • Control bit

  • Reference bit

  • Dirty bit

  • Valid bit

Explanation

Question 13 of 178

1

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

Select one of the following:

  • Hash function

  • Mapping function

  • Locale function

  • Assign function

Explanation

Question 14 of 178

1

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

Select one of the following:

  • Locality of reference

  • Memory localisation

  • Memory size

  • Memory access time

Explanation

Question 15 of 178

1

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

Select one of the following:

  • Hash functions

  • Write policy

  • Replacement policy

  • Mapping functions

Explanation

Question 16 of 178

1

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

Select one of the following:

  • Set associative

  • Fully associative

  • Direct

  • Indirect

Explanation

Question 17 of 178

1

The reason for the implementation of the cache memory is ________

Select one of the following:

  • 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

Explanation

Question 18 of 178

1

The spatial aspect of the locality of reference means ________

Select one of the following:

  • 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

Explanation

Question 19 of 178

1

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

Select one of the following:

  • Linear search

  • Binary search

  • Associative search

  • Indirect search

Explanation

Question 20 of 178

1

The temporal aspect of the locality of reference means ________

Select one of the following:

  • 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

Explanation

Question 21 of 178

1

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

Select one of the following:

  • Control bit

  • Reference bit

  • Dirty bit

  • Valid bit

Explanation

Question 22 of 178

1

Which is the fastest cache mapping function?

Select one of the following:

  • Direct mapping

  • Set associative mapping

  • Fully associative mapping

Explanation

Question 23 of 178

1

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

Select one of the following:

  • tag

  • block/slot

  • word

  • ID

Explanation

Question 24 of 178

1

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

Select one of the following:

  • True
  • False

Explanation

Question 25 of 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:

Select one of the following:

  • Ts = H1 × T1

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

  • Ts = H1 × T1 + H1 × T2

  • Ts = H1 × (T1 + T2)

Explanation

Question 26 of 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:

Select one of the following:

  • Ts = H1 × T1

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

  • Ts = H1 × T1 + H1 × T2

  • Ts = H1 × (T1 + T2)

Explanation

Question 27 of 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:

Select one of the following:

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

Explanation

Question 28 of 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:

Select one of the following:

  • 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

Explanation

Question 29 of 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:

Select one of the following:

  • 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

Explanation

Question 30 of 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:

Select one of the following:

  • 2

  • 12

  • 42

  • 7

Explanation

Question 31 of 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

Select one of the following:

  • 42

  • 2

  • 7

  • 12

Explanation

Question 32 of 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 ?

Select one of the following:

  • one

  • two

  • three

  • four

Explanation

Question 33 of 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

Select one of the following:

  • A1 A2 B1 B2

  • A1 B1 A2 B2

  • A1 B1 B2 A2

  • B1 B2 A1 A2

Explanation

Question 34 of 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

Select one of the following:

  • A1 B1 A2 B2

  • A1 B1 B2 A2

  • B1 A1 B2 A2

  • B1 B2 A1 A2

Explanation

Question 35 of 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?

Select one of the following:

  • B1 A1 B2 A2

  • B1 A1 A2 B2

  • B1 B2 A1 A2

  • A1 A2 B1 B2

Explanation

Question 36 of 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?

Select one of the following:

  • A1 A2 B1 B2

  • B1 A1 B2 A2

  • B1 A1 A2 B2

  • B1 B2 A1 A2

Explanation

Question 37 of 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?

Select one of the following:

  • A1 A2 B1 B2

  • A1 B1 B2 A2

  • B1 A1 A2 B2

  • B1 B2 A1 A2

Explanation

Question 38 of 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?

Select one of the following:

  • A1 B1 A2 B2

  • B1 A1 B2 A2

  • B1 A1 A2 B2

  • B1 B2 A1 A2

Explanation

Question 39 of 178

1

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

Select one of the following:

  • Serialization and Mutual exclusion

  • Queueing and dispatching

  • Scheduling and dispatching

  • Serialization and Mutual inclusion

Explanation

Question 40 of 178

1

Concurrent writes:

Select one of the following:

  • 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

Explanation

Question 41 of 178

1

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

Select one of the following:

  • non-deterministic

  • non-distributed

  • non-deadlocked

  • non-divisible

Explanation

Question 42 of 178

1

sem.signal () ...

Select one of the following:

  • decrements the semaphore

  • increments the semaphore

  • reads the semaphore

  • initializes the semaphore

Explanation

Question 43 of 178

1

sem.wait () ...

Select one of the following:

  • decrements the semaphore

  • increments the semaphore

  • reads the semaphore

  • initializes the semaphore

Explanation

Question 44 of 178

1

Semaphore operation sem.P( ) is alternative to

Select one of the following:

  • sem.signal

  • sem.wait

  • semaphore initialization

  • semaphore read

Explanation

Question 45 of 178

1

Semaphore operation sem.V( ) is alternative to

Select one of the following:

  • sem.signal ( )

  • sem.wait( )

  • semaphore initialization

  • semaphore read

Explanation

Question 46 of 178

1

Semaphores were invented by

Select one of the following:

  • Edsger Dijkstra

  • Tim Berners-Lee

  • Vint Cerf

  • Leonard Kleinrock

Explanation

Question 47 of 178

1

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

Select one of the following:

  • Concurrent

  • Constrained

  • Sequential

  • Mutually excluded

Explanation

Question 48 of 178

1

Block size is:

Select one of the following:

  • 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

Explanation

Question 49 of 178

1

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

Select one of the following:

  • hit

  • win

  • bingo

  • evrika

Explanation

Question 50 of 178

1

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

Select one of the following:

  • miss

  • loss

  • ricochet

  • zero

Explanation

Question 51 of 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:

Select one of the following:

  • write policy

  • locality of reference

  • replacement algorithm

  • mapping function

Explanation

Question 52 of 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:

Select one of the following:

  • cache size

  • write policy

  • locality of reference

  • replacement algorithm

Explanation

Question 53 of 178

1

This determines which cache location the block will occupy:

Select one of the following:

  • mapping function

  • write policy

  • locality of reference

  • block size

Explanation

Question 54 of 178

1

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

Select one of the following:

  • Cache

  • Main memory

  • Disk

  • CD

Explanation

Question 55 of 178

1

Which of the following statements is false:

Select one of the following:

  • 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

Explanation

Question 56 of 178

1

Memory:

Select one of the following:

  • 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

Explanation

Question 57 of 178

1

Processor:

Select one of the following:

  • 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

Explanation

Question 58 of 178

1

Program:

Select one of the following:

  • 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

Explanation

Question 59 of 178

1

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

Select one of the following:

  • segmentation

  • swapping

  • multiple contiguous fixed partitions

  • pure demand paging

Explanation

Question 60 of 178

1

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

Select one of the following:

  • fixed partitioning

  • segmentation

  • virtual memory segmentation

  • pure demand paging

Explanation

Question 61 of 178

1

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

Select one of the following:

  • internal fragmentation

  • segmentation

  • external fragmentation

  • paging

Explanation

Question 62 of 178

1

How to solve problem of equal-size partitions?

Select one of the following:

  • unequal-size partitions

  • segmentation

  • virtual memory segmentation

  • compaction

Explanation

Question 63 of 178

1

How to solve problem of "external" fragmentation?

Select one of the following:

  • compaction

  • segmentation

  • virtual memory segmentation

  • unequal-size partitions

Explanation

Question 64 of 178

1

A page fault?

Select one of the following:

  • 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

Explanation

Question 65 of 178

1

Which of the following statements is false?

Select one of the following:

  • 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

Explanation

Question 66 of 178

1

Swapping:

Select one of the following:

  • 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

Explanation

Question 67 of 178

1

Swapping:

Select one of the following:

  • 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

Explanation

Question 68 of 178

1

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

Select one of the following:

  • virtual memory is used only in multi-user systems

  • segmentation suffers from external fragmentation

  • paging suffers from internal fragmentation

  • segmented memory can be paged

Explanation

Question 69 of 178

1

Segmentation suffers from external fragmentation?

Select one of the following:

  • True
  • False

Explanation

Question 70 of 178

1

Paging suffers from external fragmentation?

Select one of the following:

  • True
  • False

Explanation

Question 71 of 178

1

Paging ...

Select one of the following:

  • 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

Explanation

Question 72 of 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?

Select one of the following:

  • paging

  • partition

  • segmentation

  • virtual memory

Explanation

Question 73 of 178

1

In memory systems, boundary registers?

Select one of the following:

  • 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

Explanation

Question 74 of 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?

Select one of the following:

  • mutual exclusion

  • semaphore

  • multiprogramming

  • multitasking

Explanation

Question 75 of 178

1

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

Select one of the following:

  • program counter

  • status register

  • instruction register

  • program status word

Explanation

Question 76 of 178

1

A memory used to provide a high speed is called?

Select one of the following:

  • cache

  • stack pointer

  • disk buffer

  • main memory

Explanation

Question 77 of 178

1

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

Select one of the following:

  • logical address

  • physical address

  • absolute address

  • none of the above

Explanation

Question 78 of 178

1

Runtime mapping from virtual to physical address is done by?

Select one of the following:

  • memory management unit

  • CPU

  • PCI

  • none of the above

Explanation

Question 79 of 178

1

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

Select one of the following:

  • page table base register

  • stack pointer

  • page register

  • program counter

Explanation

Question 80 of 178

1

Program always deals with:

Select one of the following:

  • logical address

  • physical address

  • absolute address

  • relative address

Explanation

Question 81 of 178

1

What is compaction?

Select one of the following:

  • a technique for overcoming external fragmentation

  • a paging technique

  • a technique for overcoming internal fragmentation

  • a technique for overcoming fatal error

Explanation

Question 82 of 178

1

Operating System maintains the page table for:

Select one of the following:

  • each process

  • each thread

  • each instruction

  • each address

Explanation

Question 83 of 178

1

In contiguous memory allocation:

Select one of the following:

  • 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

Explanation

Question 84 of 178

1

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

Select one of the following:

  • exactly one process

  • at least one process

  • multiple processes at once

  • none of the above

Explanation

Question 85 of 178

1

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

Select one of the following:

  • the number of partitions

  • the CPU utilization

  • the memory size

  • all of the above

Explanation

Question 86 of 178

1

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

Select one of the following:

  • 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

Explanation

Question 87 of 178

1

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

Select one of the following:

  • is not being used

  • is being used

  • is always used

  • none of the above

Explanation

Question 88 of 178

1

A solution to the problem of external fragmentation is:

Select one of the following:

  • compaction

  • larger memory space

  • smaller memory space

  • unequal size parts

Explanation

Question 89 of 178

1

__________ is generally faster than _________ .

Select one of the following:

  • first fit, best fit

  • best fit, first fit

  • worst fit, best fit

  • none of the above

Explanation

Question 90 of 178

1

External fragmentation exists when:

Select one of the following:

  • 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

Explanation

Question 91 of 178

1

External fragmentation will not occur when:

Select one of the following:

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

  • first fit is used

  • best fit is used

  • next fit is used

Explanation

Question 92 of 178

1

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

Select one of the following:

  • internal fragmentation occurs

  • external fragmentation occurs

  • both will occur

  • none of the above

Explanation

Question 93 of 178

1

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

Select one of the following:

  • frames

  • pages

  • segments

  • none of the above

Explanation

Question 94 of 178

1

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

Select one of the following:

  • frames

  • pages

  • segments

  • none of the above

Explanation

Question 95 of 178

1

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

Select one of the following:

  • frames

  • pages

  • segments

  • none of the above

Explanation

Question 96 of 178

1

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

Select one or more of the following:

  • page number

  • page offset

  • frame bit

  • frame offset

Explanation

Question 97 of 178

1

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

Select one of the following:

  • page number

  • frame bit

  • page offset

  • frame offset

Explanation

Question 98 of 178

1

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

Select one of the following:

  • page

  • process

  • memory

  • frame

Explanation

Question 99 of 178

1

With paging there is no ________ fragmentation.

Select one of the following:

  • external

  • internal

  • either type of

  • none of the above

Explanation

Question 100 of 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.

Select one of the following:

  • frame

  • page

  • segment

  • memory

Explanation

Question 101 of 178

1

For every process there is a __________.

Select one of the following:

  • page table

  • copy of page table

  • pointer to page table

  • frame table

Explanation

Question 102 of 178

1

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

Select one of the following:

  • TLB miss

  • buffer miss

  • TLB hit

  • page fault

Explanation

Question 103 of 178

1

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

Select one of the following:

  • TLB miss

  • buffer miss

  • TLB hit

  • page fault

Explanation

Question 104 of 178

1

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

Select one of the following:

  • TLB miss

  • buffer miss

  • TLB hit

  • page fault

Explanation

Question 105 of 178

1

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

Select one of the following:

  • Internal fragmentation

  • External fragmentation

  • Compaction

  • Memory distribution

Explanation

Question 106 of 178

1

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

Select one of the following:

  • First-fit algorithm

  • Next-fit algorithm

  • Buddy system

  • Best-fit algorithm

Explanation

Question 107 of 178

1

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

Select one of the following:

  • Process isolation

  • Process termination

  • Protection and access control

  • Automatic allocation and management

Explanation

Question 108 of 178

1

This algorithm reduces the rate of production of small gaps

Select one of the following:

  • Best fit

  • Worst fit

  • First fit

  • Next fit

Explanation

Question 109 of 178

1

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

Select one of the following:

  • Best fit

  • Worst fit

  • First fit

  • Next fit

Explanation

Question 110 of 178

1

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

Select one of the following:

  • Best fit

  • Worst fit

  • First fit

  • Next fit

Explanation

Question 111 of 178

1

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

Select one of the following:

  • Best fit

  • Worst fit

  • First fit

  • Next fit

Explanation

Question 112 of 178

1

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

Select one or more of the following:

  • a segment number

  • an offset

  • a value

  • a key

Explanation

Question 113 of 178

1

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

Select one of the following:

  • 1 and 0

  • 1 and -1

  • 0 and -1

  • 1 and 2

Explanation

Question 114 of 178

1

A monitor is a type of

Select one of the following:

  • binary semaphore

  • low level synchronization construct

  • high level synchronization construct

  • general semaphore

Explanation

Question 115 of 178

1

A monitor is a type of

Select one of the following:

  • high level synchronization construct

  • deadlock

  • low level synchronization construct

  • none of the above

Explanation

Question 116 of 178

1

A mutex

Select one of the following:

  • is a hexadecimal value

  • must be accessed from only one process

  • can be accessed from multiple processes

  • cannot be accessed by processes

Explanation

Question 117 of 178

1

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

Select one of the following:

  • process, semaphore

  • process, monitor

  • semaphore, semaphore

  • monitor, monitor

Explanation

Question 118 of 178

1

A semaphore

Select one of the following:

  • is a binary mutex

  • must be accessed from only one process

  • can be accessed from multiple processes

  • is a data structure

Explanation

Question 119 of 178

1

A set of processes is deadlock if:

Select one of the following:

  • 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

Explanation

Question 120 of 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:

Select one of the following:

  • race condition

  • data consistency

  • starvation

  • mutual exclusion

Explanation

Question 121 of 178

1

An un-interruptible unit is known as

Select one of the following:

  • single

  • atomic

  • static

  • safe

Explanation

Question 122 of 178

1

An un-interruptible unit is known as

Select one of the following:

  • atomic

  • single

  • static

  • None of the above

Explanation

Question 123 of 178

1

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

Select one of the following:

  • data consistency

  • data insecurity

  • data inconsistency

  • data complexity

Explanation

Question 124 of 178

1

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

Select one of the following:

  • hold and wait

  • deadlock avoidance

  • race condition

  • starvation

Explanation

Question 125 of 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

Select one of the following:

  • mutual exclusion

  • critical exclusion

  • synchronous exclusion

  • asynchronous exclusion

Explanation

Question 126 of 178

1

If no process is suspended, the signal operation

Select one of the following:

  • puts the system into a deadlock state

  • suspends some default process' execution

  • nothing happens

  • the output is unpredictable

Explanation

Question 127 of 178

1

In indirect communication between processes P and Q:

Select one of the following:

  • 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

Explanation

Question 128 of 178

1

In the blocking send, blocking receive:

Select one of the following:

  • 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

Explanation

Question 129 of 178

1

In the non-blocking send, blocking receive:

Select one of the following:

  • 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

Explanation

Question 130 of 178

1

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

Select one of the following:

  • 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

Explanation

Question 131 of 178

1

In the non-blocking send:

Select one of the following:

  • 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

Explanation

Question 132 of 178

1

Interprocess communication:

Select one of the following:

  • 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

Explanation

Question 133 of 178

1

Mutual exclusion can be provided by the

Select one of the following:

  • mutex locks

  • binary semaphores

  • both mutex locks and binary semaphores

  • none of the mentioned

Explanation

Question 134 of 178

1

Mutual exclusion can be provided by the

Select one of the following:

  • mutex locks

  • binary semaphores

  • both

  • none of the above

Explanation

Question 135 of 178

1

Mutual exclusion implies that

Select one of the following:

  • 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

Explanation

Question 136 of 178

1

Mutual exclusion means that?

Select one of the following:

  • 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

Explanation

Question 137 of 178

1

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

Select one of the following:

  • critical section

  • mutual exclusion

  • semaphores

  • directory

Explanation

Question 138 of 178

1

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

Select one of the following:

  • integer variable

  • hardware for a system

  • special program for a system

  • complex structure

Explanation

Question 139 of 178

1

Semaphores are mostly used to implement

Select one of the following:

  • System calls

  • Interprocess communication mechanisms

  • System protection

  • Interrupts

Explanation

Question 140 of 178

1

Semaphores:

Select one of the following:

  • synchronize critical resources to prevent deadlock

  • synchronize critical resources to prevent contention

  • are used to do I/O

  • are used for memory management

Explanation

Question 141 of 178

1

The bounded buffer problem is also known as

Select one of the following:

  • Readers - Writers problem

  • Dining - Philosophers problem

  • Producer - Consumer problem

  • Banker's algorithm

Explanation

Question 142 of 178

1

The code that changes the value of the semaphore is:

Select one of the following:

  • critical section code

  • remainder section code

  • non - critical section code

  • None of the above

Explanation

Question 143 of 178

1

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

Select one of the following:

  • 1

  • 0

  • 2

  • 10

Explanation

Question 144 of 178

1

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

Select one of the following:

  • communication link

  • message-passing link

  • synchronization link

  • all of the above

Explanation

Question 145 of 178

1

The monitor construct ensures that

Select one of the following:

  • 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

Explanation

Question 146 of 178

1

The operations that can be invoked on a condition variable are

Select one of the following:

  • wait & signal

  • hold & wait

  • signal & hold

  • continue & signal

Explanation

Question 147 of 178

1

The process invoking the wait operation is

Select one of the following:

  • 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

Explanation

Question 148 of 178

1

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

Select one of the following:

  • critical section

  • program

  • mutual exclusion

  • non-critical section

Explanation

Question 149 of 178

1

The two atomic operations permissible on semaphores are

Select one of the following:

  • wait, signal

  • stop, start

  • hold, wait

  • wait, call

Explanation

Question 150 of 178

1

If the semaphore value is negative

Select one of the following:

  • 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

Explanation

Question 151 of 178

1

two kinds of semaphores are

Select one of the following:

  • mutex &; counting

  • binary & counting

  • counting & decimal

  • decimal & binary

Explanation

Question 152 of 178

1

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

Select one of the following:

  • 1

  • 10

  • 0

  • 2

Explanation

Question 153 of 178

1

To enable a process to wait within the monitor

Select one of the following:

  • a condition variable must be declared as condition

  • condition variables must be used as boolean objects

  • semaphore must be used

  • all of the mentioned

Explanation

Question 154 of 178

1

What is a trap/exception?

Select one of the following:

  • 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

Explanation

Question 155 of 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

Select one of the following:

  • race condition

  • dynamic condition

  • essential condition

  • critical condition

Explanation

Question 156 of 178

1

Which of the following are TRUE for direct communication

Select one of the following:

  • 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

Explanation

Question 157 of 178

1

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

Select one of the following:

  • Data registers

  • Address registers

  • Control registers

  • Status registers

Explanation

Question 158 of 178

1

The processor contains a single data register, called

Select one of the following:

  • AC

  • PC

  • IR

  • PSW

Explanation

Question 159 of 178

1

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

Select one of the following:

  • Memory buffer register

  • Memory address register

  • I/OAR

  • I/OBR

Explanation

Question 160 of 178

1

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

Select one of the following:

  • Memory buffer register

  • Memory address register

  • I/OAR

  • I/OBR

Explanation

Question 161 of 178

1

This register specifies a particular input/output device

Select one of the following:

  • Memory buffer register

  • Memory address register

  • I/OAR

  • I/OBR

Explanation

Question 162 of 178

1

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

Select one of the following:

  • Memory buffer register

  • Memory address register

  • I/OAR

  • I/OBR

Explanation

Question 163 of 178

1

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

Select one of the following:

  • Program status word

  • Program counter

  • Stack pointer

  • Accumulator

Explanation

Question 164 of 178

1

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

Select one of the following:

  • Program counter

  • Instruction register

  • Execution register

  • Process counter

Explanation

Question 165 of 178

1

Which register contains the instruction most recently fetched?

Select one of the following:

  • Program counter

  • Instruction register

  • Execution register

  • Process counter

Explanation

Question 166 of 178

1

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

Select one of the following:

  • True
  • False

Explanation

Question 167 of 178

1

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

Select one of the following:

  • True
  • False

Explanation

Question 168 of 178

1

Virtual memory takes advantage of

Select one of the following:

  • Fast CPU

  • Large secondary memory

  • Modular programming

  • Scheduling

Explanation

Question 169 of 178

1

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

Select one of the following:

  • optimal

  • LRU

  • FIFO

  • Clock

Explanation

Question 170 of 178

1

What does process page table entry contain?

Select one of the following:

  • 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

Explanation

Question 171 of 178

1

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

Select one of the following:

  • optimal

  • LRU

  • FIFO

  • Clock

Explanation

Question 172 of 178

1

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

Select one of the following:

  • optimal

  • LRU

  • FIFO

  • Clock

Explanation

Question 173 of 178

1

What is the real address?

Select one of the following:

  • a physical address in main memory

  • a virtual address in main memory

  • a virtual address in secondary memory

  • a physical address in cache memory

Explanation

Question 174 of 178

1

What is virtual address?

Select one of the following:

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

Explanation

Question 175 of 178

1

The size of virtual storage is limited by...

Select one of the following:

  • 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

Explanation

Question 176 of 178

1

What is the resident set of the process?

Select one of the following:

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

Explanation

Question 177 of 178

1

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

Select one of the following:

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

Explanation

Question 178 of 178

1

What is trashing? {

Select one of the following:

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

Explanation

Previous
Check answer
Next