exams
algorithms
out Wed the 10,
due Wed the 17th, end of the day (midnight)
- O() notation :
- what it is,
- showing that an algorithm has that behavior "experimentally"
- average vs worst case behavior
- P vs NP
- what that means
- "hard" (NP, exponential, ...)
- "easy" (P)
- practical vs theoretical
- methods of designing algorithms
- brute force
- divide & conquer
- greedy
- which sorts of problems
- searching (types of search, breadth vs depth, parallel, randomness)
- sorting
- graph problems
- data structures
- heaps
- hash tables (associative array, dictionaries, ...)
- implementation
- what they're for
- performance, API
programming languages
linux
