1)  Given an example of a reflexive, symmetric and transitive relation on
the integers
 
2)  Show the sum from 1 to N of 4i is equal to 2N*(N+1)

3) Define big O, big Omega, big Theta of function F, 

4) Explain the relationship between a recursive function and a
recurrence relationship.

5) Explain the use of pre and post conditions on the analysis of
an algorithm and how the concept relates to software testing.

6) Explain these three types of recursion
a)	Chip and Conquer
b)	Chip and be conquered
c)	Divide and conquer


7)  Explain why probabilities play a part in determining average
case performance calculations