Addr Addr (Bin) Contents 10 10 1 10 0 0 1 O 000 0 0 o00 0 0 1 1 1 1 0 0 1 1 1 1 1 1 10 0 0 0 1 0 0 1 10 0 0 0 1 0 0 1 1 1 0 10 10 10 0 0 1 0 0 10 0 1 100 0 1 1 1 0 0 0 00 0000 0000 1 0 0 1 00 0000...

correct answers only pls!

Topic: Binary

Fill in the boxes

Will give you high rating thank you!!

Extracted text: Addr Addr (Bin) Contents 10 10 1 10 0 0 1 O 000 0 0 o00 0 0 1 1 1 1 0 0 1 1 1 1 1 1 10 0 0 0 1 0 0 1 10 0 0 0 1 0 0 1 1 1 0 10 10 10 0 0 1 0 0 10 0 1 100 0 1 1 1 0 0 0 00 0000 0000 1 0 0 1 00 0000 0001 1 1 1 00 0000 0010 0 1 0 0 0 0 0 0 0 2 3 00 0000 0011 1 0 0 0 1 ... 1 1 0 0 1 10 0 1 0 1021 11 1111 1101 1022 1 00 1 1 11 1111 1110 1 1 1023 11 1111 1111 1 1 Address space from 0 to 2"-1 where n is the number of address bits Can store 1024 words. Because each word is 2 bytes, can store 2048 bytes or 2kB The address of the first word is 0, the second word is 1, the third word is 2, and the last word is 1023. Now, try to fill in the blanks for a word-addressable machine with 4 address lines, but the word size is 64 bits instead: • the memory size is words, or bytes • the address of the first word is • the address of the second word is • the address of last word is 1,