| |
Sep 15, 2025
|
|
|
|
|
CMSC 285 - Algorithms
3 Credit(s)
In this course, students study the methods and strategies for the analysis and design of efficient algorithms. Topics include asymptotic analysis, sorting, searching, string processing, algorithm design strategies, heaps, hash tables, binary search trees, self-balancing trees, greedy algorithms, graph algorithms, numerical algorithms, dynamic programming, and NP-completeness.
Prerequisite(s): CMSC 182 .
Course Frequency: S
Grading Method: Student option.
Learning Outcomes:
- Appraise the operational costs of various algorithms.
- Classify problems into suitable algorithmic solution-spaces.
- Implement algorithms to meet stated objectives.
Add to Portfolio (opens a new window)
|
|