Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
Computer Organization
Midterm 1
Fall 2009
October 22
Solution
Name _____________________________________________________
REFERENCES:
n
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
30
2**n
1
2
4
8
16
32
64
128
256
512
1024
2048
4096
8192
16384
32768
65536
131072
262288
544288
1048576
1073741824
Abbreviation
1K
2K
4K
8K
16K
32K
64K
128K
256K
512K
1M
1G
i&j) Show the IEEE Floating point representation of 3.25. Show your work!
{seeeeeeeefffffffffffffffffffffff}
3.25 = 11.01 = 1.101 x 21 exponent -127 = 1 exponent = 128 = 10000000
3.25 = 0 10000000 101000000000000000000000 in floating point (1. is understood)
Show how the string A1a2 is stored in a 32 bit word memory location.
41316132 (Hex)
^
+
NOT B
NOT B
= NOT ( A + B ) or
= NOT ( A ^ B )
B | NOT A
0 |
1
1 |
1
0 |
0
1 |
0
NOT B
1
0
1
0
NOT A ^ NOT B
1
0
0
0
Columns
*
A + B
0
1
1
1
and
NOT ( A + B )
1
0
0
0
* are identical , QED
c) What are a minimum set of logic elements that can be used to realize any combinational logic
circuit?
One - Either a Nand gate or a Nor gate
f) What is the logic function of the following circuit? Show the condition of the MOS
devices when A = 1 and B = 0 , and show the values of C and D.
OR Gate
3 a) Define an Algorithm
1) Definiteness - precise
2) Effective Computability each step can be done on a computer
3) Finiteness can be done in a finite number of steps
b) What is the von Neumann Model ?
1) Program made up of Instructions (the smallest unit)
2) Computer is composed of CPU, Memory, Input/Output, & Control
3) Program and data share memory and they are indistinguishable
e) Given addresses A[0:1], data D[0:3], and control line WE, show the decoders and MUXs to
construct the following memory (make certain your diagram is clearly readable):
R
0
1
G
1
0