Question 21 : Each entry in a Translation lookaside buffer (TLB) consists of :
1. key
2. value
3. bit value
4. constant
View Answer   Discuss with Members

Question 22 : Time taken in memory access through PTBR is :
1. extended by a factor of 3
2. extended by a factor of 2
3. slowed by a factor of 3
4. slowed by a factor of 2
View Answer   Discuss with Members

Question 23 : For every process there is a __________
1. page table
2. copy of page table
3. pointer to page table
4. all of the mentioned
View Answer   Discuss with Members

Question 24 : For larger page tables, they are kept in main memory and a __________ points to the page table.
1. page table base register
2. page table base pointer
3. page table register pointer
4. page table base
View Answer   Discuss with Members

Question 25 : The page table registers should be built with _______
1. very low speed logic
2. very high speed logic
3. a large memory space
4. none of the mentioned
View Answer   Discuss with Members

Question 26 : Smaller page tables are implemented as a set of _______
1. queues
2. stacks
3. counters
4. registers
View Answer   Discuss with Members

Question 27 : Paging increases the ______ time.
1. waiting
2. execution
3. context – switch
4. all of the mentioned
View Answer   Discuss with Members

Question 28 : The operating system maintains a ______ table that keeps track of how many frames have been allocated, how many are there, and how many are available.
1. page
2. mapping
3. frame
4. memory
View Answer   Discuss with Members

Question 29 : With paging there is no ________ fragmentation.
1. internal
2. external
3. either type of
4. none of the mentioned
View Answer   Discuss with Members

Question 30 : If the size of logical address space is 2 to the power of m, and a page size is 2 to the power of n addressing units, then the high order _____ bits of a logical address designate the page number, and the ____ low order bits designate the page offset.
1. m, n
2. n, m
3. m – n, m
4. m – n, n
View Answer   Discuss with Members