2-6 Other Logic Operations•For two variables one can achieve sixteen operations

•Only eight are useful for computers

•Boolean algebra built on AND, OR and NOT

•NAND and NOR are easier for engineers to construct

•Exclusive OR and Exclusive NOR are useful

2-7: Digital Logic Gates

•Get familiar with symbols and truth tables of Fig. 2.5

•Can have multiple inputs; must redefine NOR and NAND because they are not associative; see Fig. 2-6

•An expression in SOP can be implemented with NAND gates

2-8: Integrated Circuits•DIP: 14pins; CCW; 20x8x3 mm

•SSI (<10); MSI (<100); LSI (<1000); VLSI (Wow!

•Families: DTL(TTL); ECL (fast); MOS (dense); CMOS (power)

•Characteristics: fan-out; power dissipation; propagation delay;

noise margin

•ID numbers: 74xx (TTL); 10xxx (ECL); 40xx (CMOS); etc.

•Positive and Negative logic

You should know: Chapter 1

•Convert any base number to base 10

•Convert base 10 number (including decimals) to other bases

•Convert binary to octal or hex; and vice versa

•Radix complements and Diminished Radix complements

•Subtraction with complements

•Signed number convention

•Difference between binary and binary coded decimal

•What parity is

Chapter 1: cont’d

•Truth tables for AND, OR, NOT

•Symbols for AND, OR, NOT

•Electrical circuits showing switching logic

•Timing diagrams

You should know: Chapter 2(through 2-6)

•Meaning of closure, associative,commutative, identity element, inverse, distributive

•Six Huntington postulates

•Duality

•Postulates and Theorems from Fig. 2-1

•Be able to prove a theorem

•Operator precedence

•Venn diagrams

Chapter 2 (cont’d)

•Boolean functions and truth tables

•Go from a Boolean function to a logic diagram

•Meaning of literal and term

•How to complement a function

•min and Max terms

•Canonical and Standard forms

•Converting between the two canonical forms

•POS and SOP forms