Question

In: Computer Science

Consider a memory system with a 14 bit long address. Produce the answer to each of...

Consider a memory system with a 14 bit long address. Produce the answer to each of the following parts using hexadecimal numbers.

a. There is a 1.5k byte RAM device, starting at address $200. What is its last address?

b. There is a 1k byte EPROM device, starting at address $900.What is is last address?

c. There is a 7k byte ROM device, its last address is at the highest system address. What is its first address?

d. Use your answers from the earlier parts to draw one memory map. Be sure to indicate the first and last address of each region where a device appears in the memory map

Solutions

Expert Solution

a)

1.5k bytes

means 1.5*1024 bytes = 1536 bytes.

Now in hexadecimal it will be 600.

Since the start address is $200 and the size of the memory is 600 the last address will be 7FF.

b)

1k byte means size in hexadecimal is 400.

Since the first address is 900 The last address will be 900+400 = CFF

c)

Since the size of the memory is 7k that means that in hexadecimal it will be 1C00.

Since it is 14 bit address line hte last address will be 3FFF. only 14 bits can be accomodated.

So the starting address will be 3FFF-1C00 + 1= 2400

d)

The memory map is simple and we know how the 3 memory are there in the memory map. We can use the above to tell the locations.


Related Solutions

Consider a computer system with a 64-bit logical address and 8-KB page size. The system supports...
Consider a computer system with a 64-bit logical address and 8-KB page size. The system supports up to 1024 MB of physical memory: How many entries are there in each of the following in the page table? Describe how a logical address may be used to obtain the frame number. You may use the virtual address 14533956 to illustrate your answer. make it short and clear , please type in your keyboard.
Write a MIPS program that always checks the bit 0 of a memory data at address...
Write a MIPS program that always checks the bit 0 of a memory data at address 0x0BF81234. If it is equal to one add nth and (n+1)th elements of an array and store it to memory address 0x0BF85678 . Suppose $t0 contains the address of the 0th element of an array of 32-bit data and $t1 = n.
Suppose the memory cells at address 0x00 through 0x0D in the vole contain the following bit...
Suppose the memory cells at address 0x00 through 0x0D in the vole contain the following bit patterns: Address. contents 0x00. 0x20 0x01. 0x04 0x02 0x21 0x03. 0x01 0x04. 0x40 0x05 0x12 0x06. 0x51 0x07. 0x12 0x08 0xB1 0x09. 0x0C 0x0A. 0xB0 0x0B. 0x06 0x0C. 0xC0 0x0D. 0x00 Assume that the machine starts with its program counter contaning 0x00. WHat bit pattern will be in register 0x00 when the machine Halts? WHat bit pattern will be in register 0x01 when the...
Given a system with 4M bytes of address space per process, 64M bytes of physical memory,...
Given a system with 4M bytes of address space per process, 64M bytes of physical memory, pages of size 1K bytes, and page table entries of 8 bytes. How many entries can fit in one page? Select one: a. 128 b. 1K c. 8 d. 64K Given a system with 16G bytes of address space per process, 8G bytes of physical memory, and pages of size 16K bytes. How many entries are there in a linear page table? Select one:...
Given a system with 2T bytes of address space per process, 1T bytes of physical memory,...
Given a system with 2T bytes of address space per process, 1T bytes of physical memory, and pages of size 32M bytes. How many entries are there in a linear page table? Select one: a. 64K b. 32K c. 32M d. 1T Given a system with 8G bytes of address space per process, 2M bytes of physical memory, and pages of size 2K bytes. How bits are needed to specify the virtual page number? Select one: a. 22 b. 10...
Given a system with 512G bytes of address space per process, 2G bytes of physical memory,...
Given a system with 512G bytes of address space per process, 2G bytes of physical memory, and pages of size 2K bytes. How bits are needed to specify the offset? Select one: a. 39 b. 28 c. 11 d. 20 Given a system with 4M bytes of address space per process, 8M bytes of physical memory, pages of size 8K bytes, and page table entries of 4 bytes. How many entries can fit in one page? Select one: a. 8K...
14. Circle the correct answer: In a distributed memory architecture the interconnection network determines the speed...
14. Circle the correct answer: In a distributed memory architecture the interconnection network determines the speed of data accesses, thus this is a UMA (Uniform Memory Access)            NUMA (Non-uniform Memory Access) 15. A transition system consists of A set ? of configurations A binary transition relation ⟶ on ? A set I ⊆ ? of initial configurations. Define what a terminal configuration is. Define what an execution is. 16. Describe what a race condition is. 17. Lamport’s logical...
Consider HDB3 scrambling used with Bipolar AMI. a) For the given bit sequence, produce a corresponding...
Consider HDB3 scrambling used with Bipolar AMI. a) For the given bit sequence, produce a corresponding signal. Assume even number of pulses since last substitution and the previous pulse was positive for the first substitution you will carry out. 0 0 0 0 0 1 0 0 0 0 0 0 0 0 1 b) When do you use HDB3 over B8ZS? How does the receiver know the difference between a replacement from actual data? Use an example. c) What...
11. (12 pts) Consider a system with 32-bit addresses and a 16KB 8-way set-associative cache. Each...
11. (12 pts) Consider a system with 32-bit addresses and a 16KB 8-way set-associative cache. Each cache line contains 64 bytes. (a) How many bits of an address are used for the offset in this cache? (b) How many bits of an address are used for the index in this cache? (c) How many bits of an address are used in the tag for this cache? (d) What is the value of the tag for 0x000d6ae2? (e) What is the...
2. (Solving linear systems) Consider the linear system Ax = b with A =[14 9 14...
2. (Solving linear systems) Consider the linear system Ax = b with A =[14 9 14 6 -10;-11 -11 5 8 6;15 -2 -14 8 -15;14 13 11 -3 -7;0 9 13 5 -14], and . b = [-4;8;6;0;10]. a) Verify that the linear system has a unique solution. Hint: use rref, rank, det, or any other Matlab method. Briefly explain the answer please. You'll now solve Ax = b in three different ways. Store the three different solutions in...
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT