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

/* jurnal_3 program_8
Create a class a class BASE. Create two classes Derived1 & Derived2 that inherits the
BASE class. Create objects of Derived1 & Derived2 & access member functions of BASE
class and own. (Hierarchical)
*/
#include <iostream.h>
#include <conio.h>

class BASE
{
    public:
        void show()
        {
            cout << "THIS IS BASE CLASS" << endl;
        }
};
class Derived1 : public BASE
{};
class Derived2 : public BASE
{};
void main()
{
    clrscr();

    Derived1 obj1;
    Derived2 obj2;

    obj1.show();
    obj2.show();

    getch();
}