1- Number systems and Conversion

1.1 Digital Systems and Switching Circuits

1.2 Number Systems and Conversion

1.3 Binary Arithmetic

1.4 Representation of Negative Numbers using

a- sign and Magnitude Numbers

b- 2's Complement Numbers

c- 1's Compliment Numbers

and all the above addition

1.5 Binary Codes

2- Boolean Algebra

2.1 Introduction

2.2 Basic Operations

2.3 Boolean Expressions and Truth Tables

2.4 Basic Theorems

2.5 Commutative, Associative, Distributive, and DeMorgan's Laws

2.6 Simplification Theorems

2.7 Multiplying Out and Factoring

2.8 Complementing Boolean Expression

3-Boolean Algebra Theorems

3.1 Multiplying Out and Factoring Expression

3.2 Exclusive-OR and Equivalence Operations

3.3 The Consensus Theorem

3.4 Algebraic Simplification of Switching Expressions

3.5 Proving Validity and Equation

4- Applications of Boolean Algebra Minterm and Maxterm Expansions

4.1 Conversion of English Sentences to Boolean Equations

4.2 Combinational Logic Design Using a Truth Table

4.3 Minterm and Maxterm Expansions

4.4 General Minterm and Maxterm Functions

4.5 Incompletely Specified Functions

4.6 Examples of Truth Table Construction

4.7 Design of Binary Adders and Subtracters

5- Karnaugh Maps

5.1 Minimum Forms of Switching Functions

5.2 Two- and Three- Variable Karnaugh Maps

5.3 Four-Variable Karnaugh Maps

5.4 Determination of Minimum Expressions Using Essential Prime Implicant

5.5 five-Variable Karnaugh Maps

5.6 Other Uses of Karnaugh Maps

5.7 Other Forms of Karnaugh Maps

7-Multi-Level Gate Circuits NAND and NOR Gates.

7.1 Multi-Level Gate Circuits.

7.2 NAND and NOR Gates.

7.3 Design of Two-Level NAND- and NOR-Gate Circuits

7.4 Design of Multi-Level NAND- and NOR-Gate Circuits

7.5 Circuit Conversion Using Alternative Gate Symbols

7.6 Design of Two-Level, Multiple-Output Circuits