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_4
Write a C++ program that overloads the + operator and appropriate (suitable) relational
operator to perform the following operations:
a) Concatenation of two strings.
b) Comparison of two strings.
*/
#include <iostream.h>
#include <conio.h>
#include <string.h>

class string
{
    char str1[10];
    public:
        void get()
        {
            cout << "Enter string = ";
            cin.getline(str1, 10);
        }
        string operator+(string s)
        {
            string obj;
            strcat(str1,s.str1);
            strcpy(obj.str1, str1);
            return obj;
        }
        void display()
        {
            cout << "\n\t String :" << str1;
        }

};
void main()
{
    clrscr();

    string obj1, obj2, obj3;
    obj1.get();
    obj2.get();

    obj3 = obj1 + obj2;
    obj3.display();

    getch();
}