What is the formula for calculating physical address size, if the page number is p, frame number is f memory is mem and offset is d?

• A) pages + mem
• B) f + d
• C) p + f
• D) p + d

The address generated by CPU is commonly referred to as the ___________.

• A) Physical address
• B) Logical address
• C) Sample address
• D) Complex address

Suppose there are 32 number of frames so number of bits needed for f is:

• A) 3
• B) 2
• C) 5
• D) 4

Logical Address generated by the CPU is divided into two parts: a page number (p) and a page offset (d) and is calculated by following formula:

• A) p + d
• B) p / d
• C) p * d
• D) p % d

Paging allows physical address space to be_______________.

• A) noncontiguous
• B) sequential
• C) processed
• D) contiguous

Consider a program statement seg = seg*16; in 20-bit Physical Address calculation. What will happen if no multiplication by 16 is done?

• A) Incorrect physical address is calculated
• B) Correct physical address is calculated
• C) Program will crash
• D) Nothing happens in address calculation

The address seen by memory unit i.e. the address loaded into the memory address register is commonly referred to as the ___________.

• A) Complex address
• B) Logical address
• C) Physical address
• D) Simple address

For Logical to Physical Address Translation , which register is used to hold the physical address in memory?

• A) Instruction Register (IR)
• B) Stack Pointer (SP)
• C) Program Counter (PC)
• D) Memory Address Register (MAR)

As long as there is no________, the effective access time is equal to the memory access time.

• A) queue faults
• B) demand faults
• C) page faults
• D) stack faults

In most computers memory access time is ranging from ______________.

• A) 10 to 200 nanoseconds
• B) 10 to 200 microseconds
• C) 200 to 300 microseconds
• D) 300 to 600 microseconds

____________has the significant effect on computer performance.

• A) Self paging
• B) Queue paging
• C) Demand paging
• D) Stack paging

Page Replacement Algorithm LRU is called:

• A) Low Reset UP
• B) Low Resolution Used
• C) Low Reset Used
• D) Least Recently Used

Least Recently Used (LRU) page replacement algorithm basically works on the concept that the pages that are heavily used in _______instructions are likely to be used heavily in next instructions.

• A) previous
• B) push
• C) pop
• D) hash

In _________________Page Replacement algorithm. If we use the recent past as an approximation of the near future, then we will replace the page that has not been used for the longest period of time.

• A) Low Reset UP (LRU)
• B) Low Resolution Used (LRU)
• C) Least Recently Used (LRU)
• D) Low Reset Used (LRU)

What is calculated by available[i] = maxres[i] - allocation[i] in Baker’s algorithm?

• A) Remaining resources
• B) Average memory usage
• C) Process priority
• D) Total resource usage

In Banker's algorithm we can say that a system is in a ______if all of the processes in the system can be executed to termination in some order.

• A) reverse state
• B) safe state
• C) stop state
• D) halt state

In Banker algorithm Max data structure is used. If______, then process Pi can request maximum k instances of resource type Rj.

• A) Max[k,j] = i
• B) Max[i,j] = k
• C) Max[ j,i ] = k
• D) Max[i,k] = j

In dining philosopher problem, a philosopher can start eating once he has ______chopsticks

• A) 5
• B) 3
• C) 4
• D) 2

In Banker’s algorithm the order of process termination is called__________________.

• A) safe sequence
• B) bulk execution
• C) random sequence
• D) priority check

In Banker's Algorithm, the system must know the ________ resource demand of each process in advance.

• A) maximum
• B) minimum
• C) average
• D) current