Topics for Test 1, Spring 2001

1. Evaluation of a truth table given a Boolean Algebra function

2. Analysis of a digital logic circuit: Write a Boolean Algebra AND/OR function from a circuit diagram
2a. Use mixed logic and electrically equivalent symbols to perform a graphical analysis
2b. Use positive logic and the rules of Boolean Algebra

3. Synthesis of a logic circuit from a Boolean Algebra function
3a. Use electrically equivalent symbols to generate an All-NAND circuit
3b. Use electrically equivalent symbols to generate an All-NOR circuit

4. Synthesis of a logic circuit from a truth table
4a. canonical minterm form
4b. minterm list
4c. canonical Maxterm form
4d. Maxterm list

5. Design
5a. From a word problem, identify the digital inputs, deduce the number and function of the digital outputs, and complete a truth table that solves the problem
5b. From 5a, identify the logic convention of the signals and draw a logic circuit diagram that solves the problem

6. Electrical Operation of gates
6a. From a logic symbol, give the electrical truth table of the gate
6b. From a logic symbol, give the logical operation of the gate when logic conventions are assigned to the input and output signals.

7. Fundamental rules of boolean algebra
7a. rules for 1, 0
7b. rules for complement
7c. distributivity
7d. DeMorgan's theorems

Secondary Topics: Number Systems, Binary Math

1.Conversion from base n to decimal
1a. positional notation of powers of n

2. Conversion from decimal to base n
2a. conversion using the "Heuristic" method
2b. conversion using the structured method
2b1. For integers, divide and save remainders. The first remainder is the least significant.
2b2. For fractions, multiply and save integers. The first integer is the most significant.

4. Addition of binary numbers

5. Two’s complement representation of negative numbers (Step 1: Write the n-bit representation of the positive number , Step 2: Complement each bit and add 1)

6. Overflow
6a. For unsigned integers (positive integers), overflow occurs when the addition of the leftmost (most
significant) bits results in a carry of "1"
6b. For signed integers, overflow occurs when either
The addition of two negative numbers gives a positive result, or
The addition of two positive numbers gives a negative result