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

 //j_3_p_4 

//comparision of two string

#include <iostream.h>
#include <conio.h>
#include <string.h>

class string
{
    char str[20];

    public:
        void get()
        {
            cout << "Enter string: " ;
            cin.getline(str, 20);
        }
        int operator > (string);
        int operator < (string);
        friend operator == (string, string)
};
int string :: operator > (string ob2)
{
    if(strcmp(str, ob2.str) > 0)
    {
        return 1;
    }
    else
    {
        return 0;
    }

}
int string :: operator < (string ob2)
{
    if(strcmp(str, ob2.str) < 0)
    {
        return 1;
    }
    else
    {
        return 0;
    }
}
int operator == (string ob1, string ob2)
{
    if(strcmp(ob1.str, ob2.str) == 0)
    {
        return 1;
    }
    else
    {
        return 0;
    }
}
void main()
{
    clrscr();
    string obj1, obj2, obj3;
    obj1.get();
    obj2.get();
    if(obj1 > obj2)
    {
        cout << "  First string is greater than second string" << endl;
    }

    if(obj1 < obj2)
    {
        cout << "  First string is less than second string" << endl;
    }

    if(obj1 == obj2)
    {
        cout << " both string is equal" << endl;
    }
    getch();

}