/* J_3_P_1
Write a C++ program, which shows the use of arithmetic operators overloading for two
objects of the same class. (Addition, subtraction, multiplication and division of two objects).
*/
#include <iostream.h>
#include <conio.h>
class math
{
int a, b, s, m, d;
public:
void get()
{
cout << "Enter value a = ";
cin >> a;
}
math operator+(math obj2)
{
math add;
add.b = a + obj2.a;
return add;
}
math operator - (math obj2)
{
math sub;
sub.s = a - obj2.a;
return sub;
}
math operator * (math obj2)
{
math mul;
mul.m = a * obj2.a;
return mul;
}
math operator / (math obj2)
{
math div;
div.d = a / obj2.a;
return div;
}
void diplay()
{
cout << "Addition = "<< b << endl;
cout << "Substraction = " << s << endl;
cout << "Multiplication = " << m << endl;
cout << "Division = " << d << endl;
}
};
void main()
{
clrscr();
math obj1, obj2, obj3;
obj1.get();
obj2.get();
obj3 = obj1 + obj2;
obj3 = obj1 - obj2;
obj3 = obj1 * obj2;
obj3 = obj1 / obj2;
obj3.diplay();
getch();
}
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
Answer : Sequence of Block Addresses: 0, 8, 6, 5, 10, 15, 8 (accessed twice in the same sequence) Cache Configurations: Direct-Mapped Cache : 4 blocks Two-Way Set-Associative Cache : 2 sets with 2 blocks each Fully Associative Cache : 4 blocks Simulation: Direct-Mapped Cache: Access Address Index Cache Content Hit/Miss 1 0 0 0 Miss 2 8 0 8 Miss 3 6 2 8, 6 Miss 4 5 1 8, 6, 5 Miss 5 10 2 8, 10, 5 Miss 6 15 3 8, 10, 5, 15 Miss 7 8 0 8, 10, 5, 15 Hit 8 0 0 0, 10, 5, 15 Miss 9 8 0 8, 10, 5, 15 Miss 10 6 2 8, 6, 5, 15 Miss 11 5 1 8, 6, 5, 15 Hit 12 10 2 8, 10, 5, 15 Miss 13 15 3 8, 10, 5, 15 Hit 14 8 0 8, 10, 5, 15 Hit Direct-Mapped Cache Hits: 3 Two-Way Set-Associative Cache: Access Address Index Set Content Hit/Miss 1 0 0 (0, -) Miss 2 8 0 (0, 8) Miss 3 6 1 (0, 8), (6, -) Miss 4 5 1 (0, 8), (6, 5) Miss 5 10 0 (10, 8), (6, 5) Miss 6 15 1 (10, 8), (6, 15) Miss 7 8 0 (10, 8), (6, 15) Hit 8 0 0 (0, 8), (6, 15) Miss 9 8 0 (0, 8), (6, 15) Hit 10 6 1 (0, 8), (6, 15) Hit 11 5 1 (0, 8), (5, 15) M
Comments
Post a Comment