EEE 120 DIGITAL DESIGN
FUNDAMENTALS: FINAL EXAM
QUESTIONS AND ANSWERS 2026
VERIFIED.
Operation of the microprocessor from Lab 4: - ANS fetch execute cycle: 1205
set to 01 for next step so it goes to the right next.
Use_pc = 1
Read = 1
load_ir = 1
How instructions and data are stored in memory: Under Opcodes
How different pieces of the microprocessor share the data bus: using a system of control signals
on the control bus to manage access and timing
How memory addressing works: Memory addresses are used to store and retrieve data, and to
help the computer manage memory.
AND A*B - ANS ~(A AND B) = ~A OR ~B
OR A+B - ANS ~(A OR B) = ~A AND ~B
@2026/2027 ALLRIGHTS RESERVED.
,NOT ~A - ANS ~A
NAND ~(A*B) - ANS ~(A AND B) = ~A OR ~B
NOR ~(A+B) - ANS ~A AND ~B
XOR A ⨁ B - ANS ~(A ⨁ B)
Boolean Functions - ANS A function that returns either true or false
How to represent a Boolean function in a truth table: - ANS Step 1: Label your variables on
the top row, and fill in with binary count going down
Step 2: Identify your equation and simplify it (use DeMorgan's rule if necessary, ie, (ab)' = a' + b'
)
Step 3: Find which terms output 1 or 0 (if 1 combination is 1, then the entire row comes out to 1
if you are using OR's)
How to represent a Boolean function in shorthand/algebraic form, including SOP and POS forms
- ANS Distributive rule: (a+b)(a+c) = a+bc
(x'+z')(x'+y+z) = (x'+z')(y+z)
Special case: (a+b)(a+b') = a+bb' = a
Associative rule: ((x'+z')+y')((x'+z')+y) = (x'+z')
POS: For odd number of terms w/same number of values: replicate
Minimize a Boolean function via Boolean algebra and also using K-maps - ANS a'b'c' + a'b'c +
abc + ab'c
@2026/2027 ALLRIGHTS RESERVED.
, a'b'(c' + c) + ac(b' + b)
a'b' + ac
See where the function becomes a 1 from last equation
K-map (stars represent number of times circled)
c
a b | 01
---------
00 | 1*1*
01 | 00
11 | 01*
10 | 01*
a'b' + ac
How to implement an arbitrary Boolean function using AND/OR/NOT gates, using only NAND
gates, and using only NOR gates - ANS Types of gates you can recreate using NAND:
NOT - One NAND gate
AND - One NAND gate in front of the other
OR - Two NAND gates side by side feeding into one NAND
Types of gates you can recreate using NOR:
NOT - One NOR gate
OR - One NOR gate in front of the other
AND - Two NOR gates side by side feeding into one NOR
Note* You can cancel out two NOTs/NANDs/NORs
@2026/2027 ALLRIGHTS RESERVED.
FUNDAMENTALS: FINAL EXAM
QUESTIONS AND ANSWERS 2026
VERIFIED.
Operation of the microprocessor from Lab 4: - ANS fetch execute cycle: 1205
set to 01 for next step so it goes to the right next.
Use_pc = 1
Read = 1
load_ir = 1
How instructions and data are stored in memory: Under Opcodes
How different pieces of the microprocessor share the data bus: using a system of control signals
on the control bus to manage access and timing
How memory addressing works: Memory addresses are used to store and retrieve data, and to
help the computer manage memory.
AND A*B - ANS ~(A AND B) = ~A OR ~B
OR A+B - ANS ~(A OR B) = ~A AND ~B
@2026/2027 ALLRIGHTS RESERVED.
,NOT ~A - ANS ~A
NAND ~(A*B) - ANS ~(A AND B) = ~A OR ~B
NOR ~(A+B) - ANS ~A AND ~B
XOR A ⨁ B - ANS ~(A ⨁ B)
Boolean Functions - ANS A function that returns either true or false
How to represent a Boolean function in a truth table: - ANS Step 1: Label your variables on
the top row, and fill in with binary count going down
Step 2: Identify your equation and simplify it (use DeMorgan's rule if necessary, ie, (ab)' = a' + b'
)
Step 3: Find which terms output 1 or 0 (if 1 combination is 1, then the entire row comes out to 1
if you are using OR's)
How to represent a Boolean function in shorthand/algebraic form, including SOP and POS forms
- ANS Distributive rule: (a+b)(a+c) = a+bc
(x'+z')(x'+y+z) = (x'+z')(y+z)
Special case: (a+b)(a+b') = a+bb' = a
Associative rule: ((x'+z')+y')((x'+z')+y) = (x'+z')
POS: For odd number of terms w/same number of values: replicate
Minimize a Boolean function via Boolean algebra and also using K-maps - ANS a'b'c' + a'b'c +
abc + ab'c
@2026/2027 ALLRIGHTS RESERVED.
, a'b'(c' + c) + ac(b' + b)
a'b' + ac
See where the function becomes a 1 from last equation
K-map (stars represent number of times circled)
c
a b | 01
---------
00 | 1*1*
01 | 00
11 | 01*
10 | 01*
a'b' + ac
How to implement an arbitrary Boolean function using AND/OR/NOT gates, using only NAND
gates, and using only NOR gates - ANS Types of gates you can recreate using NAND:
NOT - One NAND gate
AND - One NAND gate in front of the other
OR - Two NAND gates side by side feeding into one NAND
Types of gates you can recreate using NOR:
NOT - One NOR gate
OR - One NOR gate in front of the other
AND - Two NOR gates side by side feeding into one NOR
Note* You can cancel out two NOTs/NANDs/NORs
@2026/2027 ALLRIGHTS RESERVED.
