Question
Computer Architecture. Each question has multiple correct answers so please list the multiple correct answers under the question ASAP.

23. Given a Memory with 2048 words, and 16 bits per word, how many memory address be to access every word (with no unused addresses d) 11 bits bits must the )? a) 2048 bits e) 4 bits b) 16 bits c) 10 bits
0 0
Add a comment Improve this question Transcribed image text
Answer #1

2048 is equal 2^11 thus taking log base 2 of 2^11

log 2^11= 11 bits (please note log is base 2)

11 bits is the correct answer

Add a comment
Know the answer?
Add Answer to:
Computer Architecture. Each question has multiple correct answers so please list the multiple correct answers under...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • Please help me with this computer architecture problem (a) How many byte offset bits are required...

    Please help me with this computer architecture problem (a) How many byte offset bits are required in the address to reference 1024 words of data when the word size is 128 bits? (b) What is the total capacity of memory that is addressable using 48-bit word addresses (assume each data word is 32 bits).

  • Question 3 The access time of a cache is 80 ns and the access time of...

    Question 3 The access time of a cache is 80 ns and the access time of main memory is 1200 ns. We have 85% of instructions are directed to read while 15% is for writes. Hit ratio is 92%. A write through procedure is used. A. Give the average access time considering only the read requests B. Give average access time for both read and write requests. C. Give the overall hit ratio given the write cycle as well. Question...

  • Suppose a computer using fully-associative cache has 222 words of main memory and a cache of...

    Suppose a computer using fully-associative cache has 222 words of main memory and a cache of 32 blocks, where each cache block contains 16 bytes. How many blocks of main memory are there? Assuming memory addressing starts from zero, what is the highest memory address? How many bits are needed to represent all of the memory addresses? What is the format of a memory address as seen by the cache, that is, what are the sizes of the tag and...

  • Computer architecture rence1 (Choone) D Question 21 Regarding the virtual memory system, check all the statements...

    Computer architecture rence1 (Choone) D Question 21 Regarding the virtual memory system, check all the statements that are true. Each program has its own page table, A program's memory space must be a contiguous physical addresses in the RAM, The user program is responsible for maintaining its own page table, If a computer has 1 GB RAM, the software can be written to use 2 GB of memory. It enables multiple programs to share the computer's memory, each program can...

  • A 2-way set associative cache consists of four sets 0, 1, 2, 3. The main memory...

    A 2-way set associative cache consists of four sets 0, 1, 2, 3. The main memory is word addressable (i.e. treat the memory as an array of words indexed by the address). It contains 2048 blocks 0 through 2047, and each block has eight words. (a) How many bits are needed to address the main memory? (b) Show how a main memory address will be translated into a tag, a set number, and an offset within a block. Illustrate this...

  • pls both ans Question 20 5 pts Suppose a computer has 32-bit instructions. The instruction set...

    pls both ans Question 20 5 pts Suppose a computer has 32-bit instructions. The instruction set consists of 64 different operations. All instructions have an opcode and two address fields (allowing for two addresses). The first of these addresses must be a register direct address, and the second must be a memory address. Expanding opcodes are not used. The machine has 16 registers. How many bits can be used for the memory address? Question 21 5 pts Suppose we have...

  • Cache question computer architecture A cache holds 128 words where each word is 4 bytes. Assuming...

    Cache question computer architecture A cache holds 128 words where each word is 4 bytes. Assuming a 32-bit address, for each of the following organizations, complete the table. a.A direct-mapped cache with block size = 16words b.2-way set-associative cache with block size = 8words c.4-way set-associative cache with block size = 4words d.A fully associative cache with block size = 2words. Cache a Cache b Cache c Cache d total # bits for word & byte displacement # bits in...

  • Please help me out.. A and C Question. 5. (30 points) Consider a computer with byte...

    Please help me out.. A and C Question. 5. (30 points) Consider a computer with byte addressable main memory bytes, and the block size is 8 bytes. Assume that a direct mapping cache consisting 32 lines is used with this machine. (a) (5 points) How many bits are required to hold a memory address? (b) (5 points) How many total bytes of memory can be stored in the cache? 256 bytes (C) (10 points) How is that memory address divided...

  • Computer science organization and architecture! Help! Instructions The answers to questions below must be written in...

    Computer science organization and architecture! Help! Instructions The answers to questions below must be written in the file named you MUST replace which has been provided with this test. Important: login the FSUl of the filename with you actual FSU login ID. That file has lines that begin with Question N. where N corresponds to the question number. Below or beside each Question N. there are placeholder as described must be replaced with the correct answer in the specific formats,...

  • IN JAVA ONLY - Please do not copy answers from similar question; those solutions DON'T work. 1. W...

    IN JAVA ONLY - Please do not copy answers from similar question; those solutions DON'T work. 1. Write a hangman’s program where the user is a computer that has to guess the word “JAVA.” The computer uses a BRUTE FORCE method. a. First write the program that shows (prints) each guess (the letter) and also draws the result (line by line, circle by circle) when the guess is wrong. b. What does the brute force method do exactly? c. The...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT