(b) (5%) Assume that the initial AVL tree is empty. Please draw the AVL tree after the numbers 8, 9, 6, 3 and 2 are inserted into the tree sequentially.

3. (10%) A computer whose processes have 2048 pages in their address spaces keeps its page tables in memory. The overhead required for reading a word from the page table is 500 nsec. To reduce this overhead, the computer has a TLB, which holds 32 (page, frame) pairs and can do a lookup in 50 nsec. What hit rate is needed to reduce the mean overhead to 150 nsec or less, assuming that TLB is looked up first before the page table is read?

題組內容

(b) (5%) Assume that the initial AVL tree is empty. Please draw the AVL tree after the numbers 8, 9, 6, 3 and 2 are inserted into the tree sequentially.

相關申論題

相關試卷