Detailed Course Information |
Fall 2024 Semester
Dec 03, 2024 |
|
 |
||
 | Select the desired Level or 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 Levels: Undergraduate Schedule Types: Lecture Computer Science Department Course Attributes: NUpath Formal/Quant Reasoning, NU Core Math/Anly Think Lvl 2, Computer&Info Sci Restrictions: May not be enrolled in one of the following Programs: BSCmpE Comp Engineer/Physics BSEE Electrical Engineering BSEE Electrical Engr/Music BSEE Electrical Engr/Physics BSEE Elect and Comp Engr BSCmpE Computer Engineering BSCmpE Elect and Comp Engr Must be enrolled in one of the following Levels: Undergraduate Corequisites: CS 3001 Prerequisites: ( (Undergraduate level CS 2510 Minimum Grade of D- or Undergraduate level DS 2500 Minimum Grade of D-) and Undergraduate level CS 1800 Minimum Grade of D-) or Undergraduate level EECE 2160 Minimum Grade of D- |
| Return to Previous | New Search |
|