This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: 2171/T1Rev/MS 7 Objectives for Sections 2.12.4 On completing through section 2.4 you should be able to 1. Use the operators NOT, AND and OR. 2. State the axioms and theorems of Boolean algebra. 3. Prove Boolean theorems by perfect induction (truth table). 4. Design 3variable circuits with SOP and POS . 2171/T1Rev/MS 8 Likely Problems • 35 questions – 1 problem dealing with Boolean algebra manipulation – 1 or 2 problems designing 3variable SOP or POS circuit – 1 or 2 number conversion problems – 1 two’s complement addition problem with overflow 2171/T1Rev/MS 9 Possible Problems • Conversion among binary, octal, hex and decimal • Two’s complement addition (overflow) • Simple Boolean algebra • Proof by induction (truth table) • 3variable SOP or POS design – including minimization • Any homework problems 2171/T1Rev/MS 10 Advice • Take your time. • Check your work. • Know your ID number....
View
Full Document
 Spring '09
 Gibbons
 Electrical Engineering, Logic, Binary numeral system, Propositional calculus

Click to edit the document details