dsa.jpg (4503 bytes) Notes

Home

Course Description

Contact Info

Schedule

Grading

Grade Posting

Lab Homeworks

Exams

Projects

Notes

  1. Introductory Notes. (postscript) (pdf)
  2. Mathematical Preliminaries. (postscript) (pdf)
  3. Recursion. (postscript) (pdf)
  4. Many students have some difficulties with induction, recursion and the relationship between the two. Here is a list of sample problems on induction and recursion. There is no credit awarded towards your grade, they are solely for the purpose of practice. If you are having some trouble with induction and recursion, you are encouraged to attempt these problems and if you have difficulty, to contact the TA's.

  5. Sample Problems on Induction and Recursion ( (postscript) (pdf) )
  6. Analysis of Algorithms. (postscript) (pdf)
  7. Analysis of Recursive Algorithms - Appendix: Proof of the Master Theorems. (postscript) (pdf)
  8. The material from this point will mostly follow the book. The notes posted will not be as complete, and you should refer to the book, especially for implementation details of various data structures.

  9. Summary of Linear ADT's ( (postscript) (pdf) )
  10. Trees ( (postscript) (pdf) )