This page contains the course material for the CS305/CS503-50 class taught in Spring 2009.
Reminder: if you have not already bookmarked it, the Java SE API is an incredibly helpful reference.
- Syllabus
- January 20, 2009: Introduction, Asymptotic Analysis.
- January 22, 2009: Asymptotic Analysis Review, Basic OOP in Java, Arrays.
- January 27, 2009: Searching and Basic Sorting.
- January 29, 2009: No class.
- February 3, 2009: University closed.
- February 5, 2009: Advanced OOP, Assignment 1 Review.
- February 10, 2009: Sorting Lab.
-
February 12, 2009: Recursion and Linked Lists.
-
February 17, 2009: Linked Lists, Stacks, and Queues.
- February 19, 2009: Priority Queues and Coding Practice.
-
February 23, 2009: Advanced Sorting Algorithms and Recurrences.
- February 25, 2009: Quicksort, Midterm Review, Coding Practice.
- March 3, 2009: Midterm Exam.
- March 5, 2009: Lab 2.
- March 10, 2009: Spring Break.
- March 12, 2009: Spring Break.
- March 17, 2009: Binary Trees.
- March 19, 2009: Tree Balance, Linear-Time Sorting.
- March 24, 2009: Heaps and Greedy Algorithms.
- March 26, 2009: Lab 3: Huffman Coding.
- March 31, 2009: Hashing.
- April 2, 2009: Amortized Analysis.
- April 7, 2009: Graphs.
- April 9, 2009: Graph Algorithms.
- April 14, 2009: Self-balancing binary search trees.
- April 16, 2009: Lab 4.
- April 21, 2009: Review of OOP and data structure implementations in Java.
- April 23, 2009: Review.
- April 28, 2009: Lab 5.
- April 30, 2009: Final Review.
- May 7, 2009: Final Exam (5:30 - 7:30 PM).