{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

CPE129_learning_objectives_Exam1_F06

# CPE129_learning_objectives_Exam1_F06 - CPE 129 Learning...

This preview shows pages 1–2. Sign up to view the full content.

CPE 129 Learning Objectives Midterm Exam #1 Number Systems, Number Representations, and Codes (Ch 1) Binary Number Systems (1.4) Apply conversion techniques to transform number between bases (decimal, binary, octal, hexadecimal) Boolean Algebra, Functions, and Minimization (Ch 2) Memorize and reproduce the function/operation/truth table/symbol for the basic logic functions (AND, OR, NOT, NAND, NOR, XOR, XNOR). Know and be able to produce the various representations of Boolean expressions (truth table, canonical sum, canonical product, compact minterm form, compact maxterm form, Karnaugh map ) Convert between the various representations of Boolean expressions Apply the Principle of Perfect Induction to prove/disprove equivalence relations Apply the Principle of Duality to obtain the dual of a Boolean expression Apply DeMorgan's Theorem to obtain an equivalent Boolean negation Determine function outputs based on proper precedence of Boolean operations.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.
• Fall '07
• Mealy
• Boolean Algebra, Combinational Logic Circuits, Combinational Building Blocks, Analyze combinational circuits, equivalent Boolean negation

{[ snackBarMessage ]}