A byte-addressable computer has a small data cache capable of holding eight 32-bit words. Each cache block consists of two 32-bit words. When a given program is executed, the processor reads data sequentially from the following hex addresses:

208, 20C, 2F0, 2F4, 204, 20C, 208, 20C, 218, 2F0, 248, 24C

Assume the cache is initially empty. Show the contents of the cache at the end of the first pass through the loop if:

1. An associative-mapped cache that uses the LRU algorithm, and compute the hit rate.

2. Two-way set-associative mapped cache that uses the LRU algorithm, and compute the hit rate.

You can receive up to 4 points for this homework question (1 point for the hit rate calculation and 1 point for the cache map for each techniques).