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

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

If Segment = 1000 and Offset = 0020, what will be the Physical Address?

• A) 10020h
• B) 10000
• C) 10020
• D) 10010h

In Logical to Physical Address Translation, how is the 20-bit Physical Address calculated?

• A) Segment * Offset
• B) (Segment * 16) + Offset
• C) (Segment / 16) + Offset
• D) Segment + Offset

Which function is used to pause the screen at the end of the program in c language?

• A) system("pause")
• B) pause()
• C) stop()
• D) end()

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

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

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

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

Which header file is used to access the log2 function in C?

• A) <stdio.h>
• B) <math.h>
• C) <string.h>
• D) <stdlib.h>

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