Course Descriptions

CS U690: Algorithms and Data

View Course Charter

Introduces the basic principles and techniques for the design, analysis, and implementation of efficient algorithms and data representations. Discusses asymptotic analysis and formal methods for establishing the correctness of algorithms. Considers divide-and-conquer algorithms, graph traversal algorithms, and optimization techniques. Introduces information theory and covers the fundamental structures for representing data. Examines flat and hierarchical representations, dynamic data representations, and data compression. Concludes with a discussion of the relationship of the topics in this course to complexity theory and the notion of the hardness of problems.

Prerequisites: CS U370 and CS U390.

Credit hours: 4 SH

Course offerings:
• Fall 2006
• Spring 2006
• Fall 2005