CS 561 |
Data Structures and Algorithms |
Note: CS 561 is, in effect, a combination of the undergraduate classes CS 361 and CS 461. Although we may end up going a bit farther in CS 561 than undergraduates go in CS 461, CS 561 remains an introductory course -- the standard first-year graduate course in algorithms and data structures. It is not an advanced algorithm class. (Advanced algorithms classes offered by the department include 504 Heuristics, 506 Computational Geometry, 509 Parallel Algorithms, 591 Randomized and Online Algorithms, 591 Computational Molecular Biology, and one-time specialized 591 courses, such as 591 Topics in Inexact Algorithms offered this fall semester. All assume a background comparable to that covered in this CS 561.)
Absences: I have a heavy travel schedule, which will cause me to miss a number of lectures and may also delay the grading of tests. Some lectures I will have pre-taped on video; these lectures will proceed at the usual time and place, played on the TV monitors. Some lectures we may be able to reschedule and some will just have to be cancelled. At present, I have the following travel commitments; at least one more (short) trips to San Diego will be added to this list.