Logical data refers to the instruction or data stored in the ____________.

• A) Physical memory location
• B) Process address space
• C) Secondary memory location
• D) Hash table space

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

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

Suppose there are 16 number of pages so number of bits needed for p is:

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

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

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

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

In most computers memory access time is ranging from ______________.

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

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

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

Paging allows physical address space to be_______________.

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

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

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

Page Replacement Algorithm LRU is called:

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

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) pop
• B) hash
• C) push
• D) previous

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) p + d
• C) p + f
• D) f + d

Two-dimensional array can be traversed in column major order if is traversed _______wise.

• A) row
• B) hash
• C) diagonal
• D) column

In the following declaration of two dimensional integer array: int A[1024][1024]; Integer array A has _________number of rows.

• A) 1024x 1024
• B) 1024
• C) 512
• D) 256

In _____________the pager brings only those necessary pages into memory that are needed.

• A) Push paging
• B) Self paging
• C) Hash paging
• D) Demand paging

Two-dimensional array can be traversed in row major order if it is traversed _______wise.

• A) row
• B) diagonal
• C) column
• D) hash

In Disk Free Space Management by using bit map and bit vector each block is represented by ___________.

• A) 4 bits
• B) 1 bit.
• C) 2 bits
• D) 3 bits

Overhead of Bit-Map in Free-Space Management is calculated as:

• A) overhead = (diskSize / freespaceSize)
• B) overhead = (diskSize / bit-vactorSize)
• C) overhead = (diskSize / blockSize)
• D) overhead = (fileSize / blockSize)

In Disk Free Space management free space list is implemented as a ___________.

• A) Bit Map or Bit Vector
• B) Bit Nap or Bit Tap
• C) Bit Sap or Bit Wap
• D) Bit Cap or Bit Tap

To show the present condition of the object _____________ can be used, because it sustains address to concrete state object.

• A) State
• B) Concrete State
• C) Context
• D) Function