In two level scheme if each page is mapped by 4-byte (22) page table entry then to create a page table composed of 220 page table entry one requires

Related MCQs

• In defining page table structure in virtual memory, A page number portion of a virtual address is mapped into a hash table using simple hash function, where hash table contains a pointer to the inverted page table, which contains page table entries, this approach is referred as
• In two level scheme for page table, if one assume byte-level addressing and 4-kbyte (212 pages) then the 4-Gbyte (232) virtual address space is composed of
• Match the following in RAID scheme : A- Parallel access array, B-Independent access array, 1- All member disks participate in the execution of every I/O request. 2- Each member disk participates separately in the execution of every I/O request. 3- Here spindles of the individual drives are synchronized so that each disk head is in the same position on each disk at any given time.
• In memory management Free page list is: A- A list of page frames available for reading in pages. B- A list where replaced page is assigned without modification. C-A list where replaced page is assigned with modification.
• The RAID (Redundant Array of Independent Disks) level one requires
• Dirty bit for a page in a page table
• In RAID scheme, which of the RAID level does not use parity calculation in redundancy achievement
• In RAID (Redundant Array of Independent Disks) scheme, which of the following RAID level does not include redundancy to improve performance ?
• In 16 G byte disk with 512-bit block, the bit table requires
• The memory management, y one clock policy is applied then the page first loaded into a frame in memory its use bit is set to