Name
GT#_
ECE 2030h, Intro. To Computer Eng., QUIZ 3
Quiz No. 3: Nov. 29, 2001
Prof. John A. Copeland
School of Electrical and Computer Engineering
RULES.
i
This quiz is closed book.
ii.
Non-programmable calculators may be used.
iii
Answer all questions a
HW-1
Due Sept. 6, 2001 - ANSWERS
Name _
Transistor-Level Circuit Understanding
For the following switch level circuit, complete the truth table computed. If a floating or shorted
output is detected, indicate that in the truth table. If no floats or shorts
Name
GT#_
ECE2030b HW-2 Due Wed. Sept.18, 2002 - ANSWERS
Question 1 Truth Table.
Given the Boolean expression: Out = AB + ABC + AB
Hint simplify first _ AB + AB_
Complete the truth table.
A
B
C
Out
0
0
0
1
0
0
1
1
0
1
0
0
0
1
1
0
1
0
0
0
1
0
1
0
1
1
0
1
1
HW-3
Sept. 18, 2001
ECE2030b HW-3
Name _Answers_
Due Wed. Sept.18, 2002 in class.
Simplify the Boolean expression: Out = ABC + AC = A (BC+C) = A (B+C)
Complete the truth table. [ Bonus: Expand to minterms: ABC + ABC + ABC (7,6,4)]
A
B
C
Out
0
0
0
0
0
0
1
ECE-2030b Homework 4
Due Monday Oct. 7 before class
The answers to these problems will be posted after the due date.
While homework problems are not graded on a right or wrong basis, credit will not be
given for homework problems that are left blank or wh
ECE2030b - HW-5 v.2 Due Monday 10/21 during class. - ANSWERS
Problem 1. Using Finite State Machine techniques, design a circuit to:
Detect when sequential input X delivers 3 logic 1's in a row.
Do not detect overlapping sequences.
Example:
Input: 01101111
ECE2030b- HW-7 Due Monday Nov. 11, 2002 CPU Control Lines Microcode
Show how the control lines are set to achieve the operations below. Assume msel = 1;
asl: 0=AU, 1=LU, 2=SU, 3 = invalid;
ST: 0=arithmetic, 1=logical, 2=rotate, 3 = invalid;
LF: 0=AND, 1=O
Name
GT#_
ECE2030b- HW-7 Due Wednesday Dec. 5, 2002 Memory, Assembly
Memory.
A. Complete the table below. A 2M x 16 memory has 2M words of 16 bits.
Memory
Total Bits
# of addresses
# of
address
lines
# of data lines
1M x 8
1K by 4
64K x 16
4M x 32
B. Show
Name
GT#_
ECE 2030h, Intro. To Computer Eng., QUIZ 1
Quiz No. 1: Sept. 13, 2001
Prof. John A. Copeland
School of Electrical and Computer Engineering
RULES.
i
This quiz is closed book.
ii.
Non-programmable calculators may be used.
iii
Answer all questions
Name
GT#_
ECE 2030h, Intro. To Computer Eng., QUIZ 2 - Answers
Quiz No. 2: Oct. 18, 2001
Prof. John A. Copeland
School of Electrical and Computer Engineering
RULES.
i
This quiz is closed book.
ii.
Non-programable calculators may be used.
iii
Answer all qu
Name
GT#_
ECE 2 030b, I ntro. T o C omputer E ng., F inal E xam
Dec. 13, 2002
Prof. J ohn A . C opeland
School o f E lectrical a nd
C omputer
E ngineering
RULES.
i
This quiz is closed book.
ii.
Calculators may not be used.
iii
Answer all questions and sho