q-1

 

1. Suppose that a 256M * 128 Memory built using 1024 K *32 RAM Chips and memory is word

addressable. [10 marks]

a.  How many RAM Chips are necessary?

b.  How many RAM Chips are there per memory word?

c.  How many address bits are needed for each RAM Chip?

 

d.  How many banks will this memory have?

e.  How many address bits are needed for all memory?

 

 

q2

 

2. A digital computer has a memory unit with 48 bits per word. The instruction set consists of 240 different operations. All instructions have an operation code part (opcode) and an address part (allowing for only one address). Each instruction is stored in one word of memory. [2+2+2 = 6 marks].

a. How many bits are needed for the opcode?

b. How many bits are needed to specify the register? How many bits are left for the address part of the instruction?

c. What is the largest unsigned binary number that can be accommodated in one word of memory?

 

 

q4

 

4. Write code to implement the expression: A= (B + C) * (D - E) on 2-, 1- and 0-address machines. In accordance with programming language practice, computing the expression should not change the values of its operands. [6 marks]

SophiaPretty

(5)

Status NEW Posted 14 Oct 2017 06:10 AM My Price 7.00

-----------  ----------- H-----------ell-----------o S-----------ir/-----------Mad-----------am ----------- Th-----------ank----------- yo-----------u f-----------or -----------you-----------r i-----------nte-----------res-----------t a-----------nd -----------buy-----------ing----------- my----------- po-----------ste-----------d s-----------olu-----------tio-----------n. -----------Ple-----------ase----------- pi-----------ng -----------me -----------on -----------cha-----------t I----------- am----------- on-----------lin-----------e o-----------r i-----------nbo-----------x m-----------e a----------- me-----------ssa-----------ge -----------I w-----------ill----------- be----------- qu-----------ick-----------ly

Not Rated(0)

• Buy Answer