Homeworks will use IPython
- Asymptotics, searching, fast integer and matrix multiplication
- Graph algorithms (BFS, DFS, shortest paths)
- Data compression
- Hashing, Bloom filters, count-min sketch
- Dynamic programming
- Network flows
- Linear programming
- NP-completeness
- Approximation algorithms
- The Web graph, Hubs & Authorities, Page Rank
- SVD for PCA
- Clustering
- Streaming
- transforms one set of values into a new set of values
- efficiency in terms of time and space
Definition: number of primitive computational steps performed For example,
- arithmetic
- add
- subtract
- multiply
- divide
- data movement
- load
- store
- copy
- control
- branching
- subroutine call
- return