CS 483
Midterm Review
Some useful topics
- Time analysis
- choosing and counting representative operations
- computing for example algorithms
- O, Ω and Θ
- definitions and intuition
- proving functions in O, Ω and Θ classes from defintions
- basic theorems
- the limit theorem
- proving basic facts
- Sorting
- analysis of simple sorting algorithms (selection sort)
- analysis of sophisticated sorting algorithms (quicksort, mergesort)
- Graphs
- definitions
- traversals and spanning trees
- greedy algorithms
- minimal spanning trees
- Kruskal's algorithm and UNION-FIND
- Prim's algorithm
- shortest distances/shortest paths
- Warshall and Floyd-Warshall
- Dijkstra's algorithm
- A* algorithm
- Dynamic programming
- weighted interval scheduling
- integer subset-sum problem