Long description

A vertical block labeled Hash table has eight partitions. There is a chain of 10 nodes with arrows so that all nodes are connected except the first and last node. The first node is labeled Front (LRU) and the last node is labeled Rear (MRU). An arrow from the second partition of the Hash table points to the first node. An arrow from the third partition of the Hash table points to the third node. An arrow from the fifth partition of the Hash table points to the second node. An arrow from the seventh partition of the Hash table points to the ninth node. An arrow from the eighth partition of the Hash table points to the tenth node. An arrow from the first node in the queue points to the seventh node. An arrow from the second node in the queue points to the fourth node. An arrow from the third node in the queue points to the fifth node. An arrow from the fourth node in the queue points to the sixth node. An arrow from the fifth node in the queue points to the eighth node.