This course covers the design, analysis and proofs of correctness of algorithms. Examples are drawn from algorithms for advanced data structures, set manipulation and searching, graphs and geometric problems. Analysis techniques include asymptotic worst case and average case, as well as amortized analysis. Average case analysis includes the development of a probability model. Techniques for proving lower bounds on complexity are discussed, along with NP-completeness. Prerequisites: an undergraduate knowledge of data structures, discrete structures and algorithms.

Note: Students with a strong CS background in design and analysis of computer systems (at the level equal to a solid BS in computer science) should not take CS 524 and should consider taking CS 504.

Course Meetings: