Resources

Books

Here are some books that I have found useful for preparing the course material:


Notes on Different Topics of Discrete Mathematics

Counting Algorithms Automata Graphs Recurrence
Intro: ( [PDF] [PS]) Divide and Conquer: ( [PDF] [PS]) Finite State Automata: ( [PDF] [PS]) Graphs Intro: ( [PDF] [PS]) Recurrences: ( [PDF] [PS])
Counting: ( [PDF] [PS]) Divide and Conquer Algorithms: ( [PDF] [PS]) Regular Expressions: ( [PDF] [PS]) Graphs Traversal: ( [PDF] [PS]) More Recurrence: ( [PDF] [PS])
Combinations: ( [PDF] [PS]) Dynamic Programming: ( [PDF] [PS])   DFS Applications: ( [PDF] [PS]) Fibonacci: ( [PDF] [PS])
More Combinations: ( [PDF] [PS]) Dynamic Programming Optimization: ( [PDF] [PS])   Minimum Spanning Tree: ( [PDF] [PS])  
Multisets: ( [PDF] [PS]) Greedy Algorithm: ( [PDF] [PS])   Planar Graphs: ( [PDF] [PS])  
Pigeonhole Principle: ( [PDF] [PS]) Huffman Codes: ( [PDF] [PS])   Shortest Path: ( [PDF] [PS])  
Probability: ( [PDF] [PS])        
More Probability: ( [PDF] [PS])        
Catalan Numbers: ( [PDF] [PS])        


Homeworks and Exams from Fall 2002


Assignment Due on Solutions Average Median Possible
Homework 0 [TEX] [PS] [PDF] Thursday, September 5 [PS] [PDF]
58.2
62.0
80
Homework 1 [TEX] [PS] [PDF] Thursday, September 19 [PS] [PDF]
71.2
75.0
100
Homework 2 [TEX] [PS] [PDF] Thursday, October 3 [PS] [PDF]
75.0
80.0
100
Homework 3 [TEX] [PS] [PDF] Thursday, October 17 [PS] [PDF]
63.2
66.0
100
Miterm Solution Tuesday, October 22 [PS] [PDF]
28.4
26.0
100
Past Midterm with soluions [PS] [PDF] [PS] [PDF]
.
.
.
Homework 4 [TEX] [PS] [PDF] Tuesday, November 12 [PS] [PDF]
63.5
69.0
80
Homework 5 [TEX] [PS] [PDF] Tuesday, December 3 [PS] [PDF]
.
.
.
Homework 6 [TEX] [PS] [PDF] Friday, December 13 [PS] [PDF]
.
.
.


Other Pages

Fibonacci

General identities

Other links