Detailed Course Information |
Fall 2020
Apr 23, 2024 |
|
 |
||
 | Select the desired Level or Schedule Type to find available classes for the course. |
| CSCI 467 - Analysis of Algorithms |
|
Theory and techniques of algorithm design and analysis. For design, students will study a variety of algorithmic solutions to problems from application areas including searching, selecting, sorting, graph theory, number theory and encryption. Design paradigms, including greedy method, divide and conquer, dynamic programming, backtracking and branch-and-bound. For analysis, students will use formal techniques to classify execution time of an algorithm. Software tools are used to measure resources used by a program during execution. Offered infrequently. Prereq: C- or higher in CSCI 340.
4.000 Credit hours 4.000 Lecture hours Levels: Undergraduate Schedule Types: Laboratory, Individual Instruction, Lecture Science and Mathematics Division Computer Science Department Restrictions: May not be enrolled in one of the following Levels: Continuing Education May not be enrolled as the following Classifications: Continuing Education Prerequisites: Undergraduate level CSCI 340 Minimum Grade of C- |
| Return to Previous | New Search |
|