Lecture 1: Introduction (1/7-1/9)
Lecture 2: C Review (Part 1): Statements (1/14-1/16) ( .pdf )
Lecture 3: C Review (Part 2) : Data types (1/16-1/21) ( .pdf )
Lecture 4: C Review (Part 3):
Libraries, interfaces, file I/O (1/23-1/27) ( .pdf )
More information on File I/O: FileReview.doc, files.ppt (files.pdf)
Lecture 5: Recursion (1/28-2/4) ( .pdf ) ( Example Application: Maze)
Lecture 6: Array Algorithms (2/4) ( .pdf )
Lecture 7: Sorting Algorithms (2/11) ( .pdf )
Lecture 8: Sorting Algorithms (2/13) ( .pdf )
Lecture 9: Exam Review (2/18)
Lecture 10: Linked Lists (2/25-2/27) ( .pdf )
Lecture 11: Linked Lists (Exercises) (3/4-3/6) ( .pdf ) (Solutions to exercises)
Lecture 12: Doubly Linked Lists and more (3/6) ( .pdf )
Lecture 13: Stacks (3/10-3/13) ( .pdf )
Lecture 14: Exam Review (3/24)
Lecture 15: Queues ( .pdf ) (4/1)
Lecture 16: Binary Trees (4/3) ( .pdf )
Lecture 17: Complexity (4/8-4/10) ( .pdf )