The real-valued function whose value is to be either minimized or maximized subject to the constraints defined on the given LPP over the set of feasible solutions. The objective function of a LPP is a linear function of the form z = ax + by.
Answer:
A) Number of bits for byte = 6 bits
B) number of bits for index = 17 bits
C) number of bits for tag = 15 bits
Explanation:
Given data :
cache size = 64 kB
block size = 32 -byte
block address = 32 -bit
number of blocks in cache memory
cache size / block size = 64 kb / 32 b = 2^11 hence the number of blocks in cache memory = 11 bits = block offset
A) Number of bits for byte
= 6 bits
B) number of bits for index
block offset + byte number
= 11 + 6 = 17 bits
c ) number of bits for tag
= 32 - number of bits for index
= 32 - 17 = 15 bits
Answer:
Binary is made up of only 2 digits: a one and a zero. 1011 is eleven in our counting system.
So 10 in binary = 2 in our counting system.
Read the joke as follows. There are 2 types of people in the world: those who understand binary and those who do not.
I guess it's not really that funny, but computer programmers like it.
Am not sure about no.2 and no.4
But am going to answer
1.true
3.true
5.true