Questions 2 : Assume there are three small caches, each consisting of four one-word blocks. On cache is direct-mapped, a second is two-way set-associative, and the third is fully associative. Find the number of hits for each cache organization given the following sequence of block addresses: 0, 8, 6, 5, 10, 15 and 8 are accessed twice in the same sequence. Make a tabular column as given below to show the cache content on each of columns as required. Show all the pass independently pass. Draw as many numbers Assume the writing policy is LRU. Memory location Hit/Mis Add as many columns as required

 // Return by refernce

#include <iostream.h>

#include <conio.h>

void main()

{

int a, b;

int &refa = a;

int &refb = b;

clrscr();

int & max( int &, int &);

cout << "Enter value a : ";

cin >> a;

cout << "Enter value b : ";

cin >> b;

cout << "Before calling function : " << endl;

cout << "A = " << a << endl;

cout << "B = " << b << endl;

max(refa, refb) = -1;

cout << "After calling function :" << endl;

cout << "A = " << a << endl;

cout << "B = " << b << endl;

getch();

}

int & max( int &ref1, int &ref2)

{

if(ref1 > ref2)

{

return ref1;

}

else

{

return ref2;

}

}