ClassS04CS141 | recent changes | Preferences

Difference (from prior major revision) (no other diffs)

Changed: 7c7,10
Final is being graded...

* /GradeInfo
: Grades are up on blackboard.

Removed: 22d24
* /GradeInfo

Spring 2004, CS 141: Intermediate Data Structures and Algorithms

Basic algorithm analysis using asymptotic notations, summation and recurrence relations, algorithms, and data structures including trees, strings, and graphs. Algorithm design techniques including divide-and-conquer, the greedy method, and dynamic programming. Assignments integrate knowledge of data structures, algorithms, and programming.

Grades are up on blackboard.




Old Stuff

ClassS04CS141 | recent changes | Preferences
This page is read-only | View other revisions
Last edited June 17, 2004 1:45 pm by Neal Young (diff)