ok. i think what they are trying to say is right. if there is a 32 bit address so it can interface 2^32 rows uniquely and now they are saying every row should also be capable of identifying byte uniquely. size of each row will be 32 bit =4 bytes now to represent 4 bytes uniquely i need 2 bits
so answer should be 2^32*2
for first byte i will use 00, for second 01, 10 and 11 , i can't get how they multiplied it by 4.
secondly for the second pat it should be 2^32 as every row can represent one word. i
can't get how they just did it. what i have read till now i will go with this . this is how we represent page in the page table and map .