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: $1 \mathrm{~K}=2^{10}, 1 \mathrm{M}=2^{20}, 1 \mathrm{G}=2^{30}$

Consider contiguous allocation of physical memory to processes using variable partitioning scheme. Suppose there are 8 holes in the memory of sizes $20 \mathrm{~KB}, 4 \mathrm{~KB}$, $25 \mathrm{~KB}, 18 \mathrm{~KB}, 7 \mathrm{~KB}, 9 \mathrm{~KB}, 15 \mathrm{~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: $1 \mathrm{~K}=2^{10}$

In C runtime environment, which one of the following is stored in heap?

$$\text { Consider the following three ANSI-C programs, P1, P2 and P3 }$$

Which one of the following statements is true?