### Part 0. Introduction (Chapter 1)

• Overall view of digital logic designs
• ### Part 1. Combinational logic (Chapter 2)

#### I. specification

• 1). language, 2) Boolean algebra 3). truth table, 4). switching function and canonical expression, 5). incompletely specified functions, 6). definitions.
• key words or concepts: laws of Boolean algebra, minterms, maxterms, sum of products, and product of sums.
• #### II. implementation

• 1). Karnaugh maps i. 2-variable K-map, ii. 3-variable K-map, iii. 4-variable K-map
• key words or concepts: Gray code, minterms, product terms, adjacency, neighborhood.
• iv. logic minimization (sum of products), v. logic minimization (product of sums).

• key words or concepts: primes and essential primes
• #### III. other types of gates

• 1). block diagram transformation, 2). NAND, NOR gates, 3). Exclusive OR gates, 4). universal set of gates.
• key words or concepts: extension of AND, OR, NOT gates and Boolean algebra.
• ### Part 2. Sequential Networks (Chapter 3)

#### I. flip-flop components

• 1). SR f-f 2). D f-f, 3). JK f-f, 4). T f-f.
• key words or concepts: states, relations between f-fs, logic diagram, state table, state diagram, characteristic equation,
• 5). timing, set up time and hold time.
• #### II. specification

• 1). language, 2). state diagram, 3). state table, 4). net list, 5). derivation from net list to state diagram, 6). derivation from language description to state diagram.
• key words or concepts: concept of states in net list
• #### III. implementation

• 1). Mealy machine, 2). Moore machine, 3). excitation table.
• key words or concepts: derivation of f-f inputs.
• #### IV. state minimization

• equivalent states, minimization process.
• key words or concepts: relation of initial states and input/output sequences.
• ### Part 3. Standard Modules (Chapter 5)

#### I. standard combinational modules

• 1). decoder (description, logic diagram, applications), 2). encoder, 3). multiplexer, 4). ROM, 5). PLA, 6). demultiplexer, 7). barrel shifter.