Exam Solutions for ECE 2030 H Computer Engineering - Spring 2004 - Problem 1 to 4, Exams of Computer Science

The solutions to problems 1 to 4 from the spring 2004 exam of the ece 2030 h computer engineering course. The problems cover various topics such as memory systems, datapath elements, instruction formats, and microcode.

Typology: Exams

2012/2013

Uploaded on 04/08/2013

seema_852
seema_852 🇮🇳

3.6

(7)

87 documents

1 / 3

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
ECE 2030 H Computer Engineering Spring 2004
4 problems, 5 pages Exam Three Solutions 15 April 2004
1
Problem 1 (3 parts, 35 points) Memory Systems
The following three parts consider memory systems built using a 1MByte DRAM organized as 2 million
addresses of 4-bit words.
Part A (8 points) Consider a memory system organized as 16 million addresses of 64-bit words.
number of chips needed in one bank 64/4 = 16 chips/bank
number of banks for memory system 16/2 = 8 banks
number of memory system address bits log(16M) = log(224) = 24 bits
memory decoder required (n to m) 3-to-8
number of DRAM chips required 16chips/bank x 8 banks = 128 chips
memory system capacity (in MBytes) 128 chips x 1MB/chip = 128 MBytes
Part B (8 points) Consider a memory system with 32 DRAM chips total and a 2-to-4 memory decoder.
number of banks 4 banks
number of chips used in one bank 32chips/4 banks = 8 chips/bank
number of addresses 4 x 2M = 8M addresses
word size (in bits) 8 x 4 = 32 bits
memory system capacity (in MBytes) 32 chips x 1MB/chip = 32 MBytes
Part C (19 points) Design a 4 million address by 8 bit memory system with four 2M x 4 memory chips.
Label all busses and indicate bit width. Assume R/W is connected and not shown here. Use a decoder if
necessary.
2M x 4
D0
D1
D2
D3
ADDR
CS
2M x 4
D0
D1
D2
D3
ADDR
CS
2M x 4
D0
D1
D2
D3
ADDR
CS
ADDR
22
MSEL
D0
D1
D2
D3
2M x 4
D0
D1
D2
D3
ADDR
CS
D4
D5
D6
D7
1 to 2
decoder
S
EN
O0
O1
21
A21
A20:0
21
21
21
21
pf3

Partial preview of the text

Download Exam Solutions for ECE 2030 H Computer Engineering - Spring 2004 - Problem 1 to 4 and more Exams Computer Science in PDF only on Docsity!

4 problems, 5 pages Exam Three Solutions 15 April 2004

Problem 1 (3 parts, 35 points) Memory Systems

The following three parts consider memory systems built using a 1MByte DRAM organized as 2 million

addresses of 4-bit words.

Part A (8 points) Consider a memory system organized as 16 million addresses of 64-bit words.

number of chips needed in one bank 64/4 = 16 chips/bank

number of banks for memory system 16/2 = 8 banks

number of memory system address bits log(16M) = log(2^24 ) = 24 bits

memory decoder required ( n to m ) 3-to-

number of DRAM chips required 16chips/bank x 8 banks = 128 chips

memory system capacity (in MBytes ) 128 chips x 1MB/chip = 128 MBytes

Part B (8 points) Consider a memory system with 32 DRAM chips total and a 2-to-4 memory decoder.

number of banks 4 banks

number of chips used in one bank 32chips/4 banks = 8 chips/bank

number of addresses 4 x 2M = 8M addresses

word size (in bits ) 8 x 4 = 32 bits

memory system capacity (in MBytes ) 32 chips x 1MB/chip = 32 MBytes

Part C (19 points) Design a 4 million address by 8 bit memory system with four 2M x 4 memory chips.

Label all busses and indicate bit width. Assume R/W is connected and not shown here. Use a decoder if

necessary.

2M x 4

D D D D

ADDR

CS

2M x 4

D D D D

ADDR

CS

2M x 4

D D D D

ADDR

CS

ADDR

22

MSEL

D D D D

2M x 4

D D D D

ADDR

CS

D D D D

1 to 2 decoder

S

EN

O

O

21

A

A20:

21

21

21

21

4 problems, 5 pages Exam Three Solutions 15 April 2004

Problem 2 (3 parts, 35 points) Datapath Elements

Part A (10 points) Give the LF input (in hexadecimal) that would produce the logical function below.

Assume the following convention:

X Y out

0 0 LF 0

1 0 LF 1

0 1 LF 2

1 1 LF 3

Logical Function LF (in hex)

XOR 0x

NOR 0x

0 0x

X + Y 0xD

Part B (18 points) Suppose the following inputs (in hexadecimal) are applied to the 32-bit barrel

shifter used in the datapath. Determine the output (in hexadecimal). Assume the shift amount is

drawn from the 16-bit immediate value.

Shift Type Shift Amount Input Value Output Value

rotate 0xFFE8^ F826B917^ 0x17F826B

arithmetic 0x0010^ CB10598A^ 0xFFFFCB

logical 0x0008^ AC369719^ 0x00AC

Part C (7 points) Below is an incomplete design of a 1-bit shifter. In particular, the 3-to-1 muxes that

determine the most significant bit and least significant bit of the output, based on the shift type (ST), do

not have their inputs specified. Complete the design by filling in the six dashed boxes with the

appropriate inputs to the 3-to-1 muxes (e.g., “1”, “X 2 ”, etc.).

R 3-to-1 Mux

C L R 3-to-1 Mux

C L R 3-to-1 Mux

R C L 3-to-1 Mux

C L

2 Rot

3-to-1 Mux

1 Arith

0 Log

2 Rot

3-to-1 Mux

1 Arith

0 Log

Shift?

2 2