- C or higher in CS 3358: Data Structures
- Basic concepts of computational complexity.
- Fundamental algorithm design strategies(divide-and-conquer, dynamic programming, back-tracking, and etc.)
- Important algorithms(sorting, dictionary operations, algorithms on trees and graphs,and etc.)
- NP-Hard and NP - Complete concepts, proving NP- Completeness.
Lecture/Lab Hours: 3 hours lecture, 0 hours lab
Offered: Very frequently (typically once a year, Fall or Spring).