Line 2 i looked it up on my phone
Answer:
Offset bits: 3-bits
Set number of cache: 12-bits
Tag bits: 7-bits
22-bit physical address
Explanation:
Since the system is 32K so,
=2⁵.2¹⁰
=2¹⁵
As we know that it is 8-way set associative so,
=2¹⁵/2³
=2¹⁵⁻³
=2¹²
2¹² are cache blocks
22-bit physical address
Off-set bits are 3 as they are calulated from 8-way set associative information.
Set number of cache : 12-bits
For tag-bits:
Add off-set bits and cache bits and subtract from the total bits of physical address.
=22 - (12+3)
=22 - 15
=7
4. Only (ii)
<u>Explanation:</u>
The declaration of the array can be of two types:
1. int a[100];
2. int[] a = new int[100];
The general thing about an array is that whenever we want to undergo traversal in an array, we always have to start from the 0th position as the size of the array may be a whole number (let us say 10). So, to undergo traversal in an array, we start from 0 to n-1 (in this case 9) such that it covers the size of the array.
The size of an array can be finite or infinite. The general rule is it starts from 0 to n-1 where n is the size of the array. In the above example, the range of the index of the array will be 0 through 100 and not 1 through 100.
Yes, this statement is true.
Actually this statement is about using Microsoft PowerPoint, shapes in the shape gallery can be combined to show relationships among the elements.
In the shape gallery of Microsoft PowerPoint, there are many shapes such as oval, square, rectangle, star, line and many more. One can use any shape to illustrate the concept or to show relationship between something.
