Courses
CS 170. Introduction to CS Theory
Current Schedule (Spring 2013)
- CS 170: Christos Papadimitriou; Prasad Raghavendra, TT 8:00-9:30A, 245 Li Ka Shing [course homepage]
Description
Catalog Description: (4 units) Concept and basic techniques in the design and analysis of algorithms; models of computation; lower bounds; algorithms for optimum search trees, balanced trees and UNION-FIND algorithms; numerical and algebraic algorithms; combinatorial algorithms. Turing machines, how to count steps, deterministic and nondeterministic Turing machines, NP-completeness. Unsolvable and intractable problems.
Prerequisites: CS 61B, Mathematics 55, CS 70
Course objectives: Provide familiarity with algorithms for recurring basic problems. Learn to design algorithms to solve novel problems. Learn about the concept of the intrinsic difficulty of certain computational problems.
Topics covered:
- Divide and conquer
- Graphs and trees
- Depth-first search
- Topological sort; strongly-connected components
- Breadth-first search
- Shortest paths; Dijkstra and Bellman-Ford
- Minimum spanning trees
- Union/find analysis
- Hufmann codes
- Lempel-Ziv codes
- Randomized min-cut
- Hashing
- Bloom filters
- Dynamic programming
- Linear programming; posing of combinatorial problems as LP problems
- Duality
- Network flows
- NP completeness
- Approximation algorithms
- Fast Fourier transform