7.2 (2pts)I prefer a program with a loop accessing scattered data (not array)
7.6 (2pts)I prefer a program with multiple statements without loop or jump

7.7 (4 pts)
Refer.	Hit/Miss	Block#	Address
 1	M		 0	
 4	M		 1	17
 8	M		 2	
 5	M		 3	19
20	M		 4	 4
17	M		 5	 5
19	M		 6	 6
56	M		 7	
 9	M		 8	56 
11	M		 9	 9
 4	M		10
43	M		11	43
 5	H		12
 6	M		13
 9	H		14
17	H		15

7.20 (4 pts)
Refer.	Hit/Miss	Slot#	Blk#1	Blk#2
 1	M		0	56	8	
 4	M		1	17	9
 8	M		2	
 5	M		3	43	11
20	M		4	 4	20
17	M		5	 5
19	M		6	 6
56	M		7	
 9	M		 
11	M		 
 4	H		
43	M		
 5	H		
 6	M		
 9	H		
17	H		

7.24 (4 pts)
Number of sets in the cache: S/AB
#bits for index: log2(S/AB)
Total bits for cache: S/B*(k-log2(S/AB)-b+1+8B)

#6 (4 pts) Only the slots 0-3 are shown here. Only changes are shown.

0010			0020		641C		6514
Slot#	Tag#1	Tag#2	Tag#1	Tag#2	Tag#1	Tag#2	Tag#1	Tag#2
0			
1	00		00		00	64	65	64
2			00		00		00
3

6520			6422		0010
Slot#	Tag#1	Tag#2	Tag#1	Tag#2	Tag#1	Tag#2
0	
1	65	64	65	64	65	00
2	00	65	64	65	64	65
3