|Select the Course Number to get further detail on the course. Select the desired Schedule Type to find available classes for the course.|
|CS 3000 - Algorithms and Data|
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.
4.000 Credit hours
4.000 Lecture hours
Schedule Types: Lecture
Computer Science Department
NU Core Math/Anly Think Lvl 2, Computer&Info Sci