correct answers only pls! Topic: Binary Fill in the boxes Will give you high rating thank you!!

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

correct answers only pls!

Topic: Binary

Fill in the boxes

Will give you high rating thank you!!

 

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,
Transcribed Image 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,
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Keywords
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education