1. Huffman coding problem
2. Chromatic numbers – “fish problem”
3. Minterms
4. reflexive, symmetric, transitive, partial ordering, hasse diagram, antisymmetric, irreflexive,
5. Combinational circuits – output depends only on the input
1. Karnaugh maps
6. Sequential circuits – output depends on input and current state
1. Flip-flops
2. Current state
3. Next state
4. Necessary excitations – I’ll give you the tables
7. Grammar consists of four “parts” –
1. terminals, non-terminals, productions (rules), start (goal state)
2. Vocabulary includes (terminals and non-terminals)
3. G = (V, Vt, S, P) where V = {0,1,A,S} Vt = {0,1}
4. P = S -> 0, S ->ASA , A -> 1
5. S is the Start state
8. Math induction proof
1. Show it works for n = 1
2. Assume it works for n = k
3. Prove it works for n = k+1
9. Logic problem – I’ll bring you the inference and induction rules
1. deMorgan’s rule
2. propositional logic
3. predicate logic

i. for all & there exists

ii. universal and existential instantiation

iii. universal and existential generalization

4. show the steps and indicate which rule was used and which steps were used to generate the new step
9. Representation of integers: ones complement, twos complement, sign magnitude
1. Differences between them – advantages, disadvantages
2. Addition in ones and twos complement
3. Two’s complement overflow -

i. occurs when you have a carry into the sign bit and not carry out, when you have no carry into the sign bit and carry out.

11. Floating point representation
12. Trees
13. Paths & Circuits
1. Euler circuits
2. Hamiltonian circuits
14. Graphs
1. Edge
2. Nodes or vertices
3. Handshaking rule – sum of the degrees of all of the vertices is twice the number of edges
4. undirected and directed graphs

i. representation as ordered pairs and as matrices

15. database selection and projection

Go back over all your homeworks

Review the exams

Look at the text

Look at the handouts

Look at the webpages