I’m pretty sure answer is B let me know if I’m wrong
Answer:
disk caching
Explanation:
Hi,
Magnetic hard drives use disk caching to speed up performance. This method is quite ingenious because what it does is that in a section of memory in your pc, it keeps a copy of information that was previously accessed in the hard disk. So, next time if the same data is requested, the system can refer to cache to get quick access rather than going to the hard disk (which is slower).
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
Solution :
check_palindrome
lower_
_string
string
_lower()
Let stack = new Stack()
Let queue = new Queue();
for each character c in lower_case_string:
stack.push(c);
queue.enqueue(c);
let isPalindrome = true;
while queue is not empty {
if (queue.remove().equals(stack.pop())) {
continue;
} else {
isPalindrome=false;
break while loop;
}
}
return isPalindrome
Input = aabb
output = true
input =abcd
output = false
The decimal value 15 would be A. 00001111
