- depth- and breadth-first traversals
- pattern matching
- graph algorithms
- brute-force, greedy
- divide-and-conquer
- backtracking
- branch-and-bound
- dynamic programming
- randomized
- Time complexity
- NP-complete problem
- fundamentals, algorithms, communication.
CS340 focus on studying and analyzing the fundamental algorithms and strategies. Also, learn more dept of algorithm design and complexity theory.