Course Description:
|
Comp Sci 380 . Design and Analysis of Algorithms. Advanced design and analysis of algorithms used in modern computing systems. Topics include analysis of algorithms, basic structures, advanced abstract data types, recursion, computability and complexity. Problem solving and analytical skills are improved by examining the application of abstract data types to several problem domains with an emphasis on the impact of design decisions on algorithm performance. Concepts are reinforced by several programming exercises. Final exam. |
Prerequisites:
|
Comp Sci 220
|
Offered:
|
Fall Semester |
Semester Hours:
|
3
|
Course Objectives: |
Upon completion of the course, students shall be able to:
- Understand the fundamentals of recursion and mathematical induction and the relationship between them.
- Analyze worst case and average case asymptotic running times of iterative and recursive algorithms.
- Analyze the performance of common algorithms and data structures and recognize when to use them based on their performance characteristics.
- Understand the relationships between complexity classes P, NP, and NP-Complete and how to determine an algorithms membership in these classes.
- Understand the definition of computing that there exist undecidable problems, which cannot be solved by computers.
- Understand and apply various algorithm design strategies including divide-and-conquer and the greedy method.
|
|
The DFCS Home Page is maintained by:
DFCS WebMaster, 333-4118,
Webmaster.dfcs@usafa.af.mil.
|
|
|
