search
Log In
0 votes
287 views
A byte-addressable memory organized in 32-bit words according to big-endian. A program reads ASCII characters and stores them in successive byte locations, starting at location 1000. Show the contents of memory words at locations 1000,1004 for name “ Johnson ” .

Each word has a unique address and we have 32-bit word. So why cant we take 8-bits for each letter and store 4 letters per word.Thus we need only 2 addresses..

Where am i gng wrong ?
in CO and Architecture 287 views
0
it is addressed by byte not word. And we need only 2 words here.
0
Sir can u pls give me d complete solution here , its still not clear..

Please log in or register to answer this question.

Related questions

0 votes
0 answers
1
83 views
Quoted: What data rate is needed to transmit an uncompressed 4" x 6" photograph every second with a resolution of 1200 dots per inch and 24 bits per dot (pixel)? 1. 691,200 kb/s 2. 28.8 kb/s 3. 8.29 Mb/s 4. 829 Mb/s
asked Aug 21, 2018 in Computer Networks Phantom5 83 views
0 votes
1 answer
2
267 views
Quoted Question: One of the large unlicensed bands used for 802.11b WiFi is 2.4GHz. What is the length of these waves? Answer in feet.
asked Aug 27, 2018 in Computer Networks Phantom5 267 views
1 vote
0 answers
3
605 views
A hash table with ten buckets with one slot per bucket is shown in the following figure. The symbols S1 to S7 initially entered using a hashing function with linear probing.The maximum number of comparisons needed in searching an item that is not present is Difficulty ... maximum number of comparisons needed in searching an item that is not present is ?What does it means respect to this diagram ?
asked Oct 31, 2017 in DS hem chandra joshi 605 views
0 votes
1 answer
4
205 views
Please help me understanding the concepts of Disk Block Address Disk Block SIze and numericals
asked Dec 11, 2015 in Operating System pC 205 views
...