Course Schedule and Catalog
Course Catalog - 2024-2025
COMP 382 - REASONING ABOUT ALGORITHMS
Long Title: REASONING ABOUT ALGORITHMS
Department: Computer Science
Grade Mode: Standard Letter
Language of Instruction: Taught in English
Course Type: Lecture/Laboratory
Credit Hours: 4
Restrictions:
Must be enrolled in one of the following Level(s):
Undergraduate Professional
Visiting Undergraduate
Undergraduate
Prerequisite(s): COMP 182 AND COMP 215 AND (ELEC 303 OR STAT 310 OR ECON 307 OR STAT 311 OR STAT 312 OR STAT 315 OR DSCI 301)
Description: Writing algorithms is fun, but how are you sure that the algorithm you wrote is flawless? Are there computing tasks for which it is impossible to produce an efficient algorithm, or, for that matter, any algorithm? To answer these questions, you have to learn to perform mathematical reasoning about algorithmic problems and solutions COMP 382 is an introduction to such reasoning techniques. Topics covered would include elementary logic, analysis of the correctness and efficiency of algorithms, and formal computational models like finite automata and Turning machines. On the way, you are also going to learn some new algorithm design techniques.