Page |1
EEE 120 Digital Design Fundamentals:
Final Exam Prep - ASU 2025 Spring
Session A Questions and Correct Answers/
Latest Update / Already Graded
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
All rights reserved © 2025/ 2026 |
, Page |2
OR A+B
Ans: ~(A OR B) = ~A AND ~B
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:
All rights reserved © 2025/ 2026 |
, Page |3
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
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)
All rights reserved © 2025/ 2026 |
EEE 120 Digital Design Fundamentals:
Final Exam Prep - ASU 2025 Spring
Session A Questions and Correct Answers/
Latest Update / Already Graded
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
All rights reserved © 2025/ 2026 |
, Page |2
OR A+B
Ans: ~(A OR B) = ~A AND ~B
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:
All rights reserved © 2025/ 2026 |
, Page |3
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
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)
All rights reserved © 2025/ 2026 |
