Important Questions from Memory Management

1. A system has a Translation Lookaside Buffer (TLB) that has a reach of 1 MB. TLB reach is defined as the total amount of physical memory that can be accessed through the TLB entries. The paging system uses pages of size 4 KB. The virtual address space is 64 GB and physical address space is 1 GB. If each TLB entry stores a 4-bit process id, page number, frame number, and a 2-bit control field, then the size of the TLB (in bytes) is ___________. (answer in integer)
   
   Note: 1K=$2^{10}$, 1M=$2^{20}$, 1G=$2^{30}$
   Computer Organization and Architecture

   View Answer
2. Consider contiguous allocation of physical memory to processes using variable partitioning scheme. Suppose there are 8 holes in the memory of sizes 20 KB, 4 KB, 25 KB, 18 KB, 7 KB, 9 KB, 15 KB, and 12 KB. Assume that no two holes are adjacent. Two processes P1 of size 16 KB and P2 of size 9 KB arrive in that order, and they are allocated memory using the best-fit technique. After allocating space to P1 and P2, the number of holes of size less than 8 KB is ____________. (answer in integer)
   
   Note: 1K=$2^{10}$
   Computer Organization and Architecture

   View Answer
3. Match List I with List II
   

   List I	List II
   A. Clustered Page Table	I. Generally considered inappropriate for 64 bit architectures.
   B. Hierarchical Page Table	II. Has only entry for each real page (or frame) of memory.
   C. Segmentation	III. Useful for Sparse address spaces.
   D. Inverted Page Table	IV. Supports a user view of the system.

   
   Choose the correct answer from the options given below:
   Computer Organization and Architecture

   View Answer
4. Choose the correct answer.
   In memory management, page size is always, power of 2.
   Computer Organization and Architecture

   View Answer

5. Which of the following is a type of memory and is similar to RAM?

   Computer Organization and Architecture

   View Answer