| |
Mar 10, 2026
|
|
|
|
|
COSC 240 - Data Structures and Algorithms
This class covers fundamental algorithms and data structures and the basic techniques used to analyze algorithms. Emphasis will be given to searching, sorting, string processing, and graph algorithms. Specific topics may include linked data structures, stacks, queues, priority queues, binary heaps, binary search trees, hash tables, graphs, trees, divide-and-conquer algorithms, greedy algorithms, dynamic programming, complexity theory, amortized analysis, asymptotic analysis, P vs. NP, and NP-completeness.
Pre-req: Minimum grade of C- in COSC 220
3 credits
Add to Portfolio (opens a new window)
|
|
