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_9
Create a class Father that has height & color as data member. Create a class Mother that
has color & eyeColor as data member. Create a class child that will inherits the Father &
Mother class. (Multiple)
*/
#include <iostream.h>
#include <conio.h>

class father
{     public:
    int h;
    char fclr[10];
};
class mother
{
    public:
    char mclr[10], eyeclr[10];
};
class child : virtual public father, virtual public mother
{
    void father()
    {
        cout << "Enter Father Height : ";
        cin >> h;

        cout << "Enter Father color : ";
        cin >> fclr;
    }
    void mother()
    {
        cout << "Enter Mother color : ";
        cin >> mclr;

        cout << "Enter Mother eye color : ";
        cin >> eyeclr;
    }
    void print()
    {
        cout << "Father Height is " << h << endl;
        cout << "Father color is" << fclr << endl;
        cout << "Mother color is " << mclr << endl;
        cout << "Mother eye color is " << mclr;
    }
};
void main()
{
    clrscr();

    child obj;

    obj.father();
    obj.mother();
    obj.print();

    getch();
}