Huffman
coding problem

Chromatic
numbers – “fish problem”

Minterms

Combinational
circuits – output depends only on the input

Karnaugh maps

Sequential
circuits – output depends on input and current state

Flip-flops

Current
state

Next
state

Necessary
excitations – I’ll give you the tables

Grammar
consists of four “parts” –

terminals,
non-terminals, productions (rules), start (goal state)

Vocabulary
includes (terminals and non-terminals)

G =
(V, Vt, S, P)  where V = {0,1,A,S}   Vt
= {0,1}

P
=  S -> 0,  S ->ASA ,  A -> 1

S is
the Start state

Math
induction proof

Show
it works for n = 1

Assume
it works for n = k

Prove
it works for n = k+1

Logic
problem – I’ll bring you the inference and induction rules

deMorgan’s rule

propositional
logic

predicate
logic

i.
for all
& there exists

ii.
universal and existential instantiation

iii.
universal and existential generalization

show
the steps and indicate which rule was used and which steps were used to
generate the new step

Representation
of  integers:  ones complement, twos complement,
sign magnitude

Differences
between them – advantages, disadvantages

Addition
in ones and twos complement

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.

Floating
point representation

Trees

Paths
& Circuits

Euler
circuits

Hamiltonian
circuits

Graphs

Edge

Nodes
or vertices

Handshaking
rule – sum of the degrees of all of the vertices is twice the
number of edges

undirected
and directed graphs

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