CSCE 411 Design and Analysis of Algorithms

Fall 2010
Course Information


Instructor: Andreas Klappenecker
Where: ZACH 105 B
When: TR 11:10am-12:25pm
Office: HRBB, Room 509B
Office Hours: TW 2:00-3:00pm or by appointment.
e-mail: klappi at cse.tamu.edu
Course information: Syllabus

Teaching Assistant: Wen Li
Office: Reed McDonald 229A
Office Hours: M 10:30am-12:30pm and R 1:00-3:00pm
e-mail: emmalwen at gmail.com

Announcments

Homework

Schedule

T Aug 31 Introduction
R Sep 2 Asymptotic Notations
T Sep 7 Greedy Algorithms and Matroids
R Sep 9 Greedy Algorithms and Matroids, Quiz 1
T Sep 14 Dynamic Programming
R Sep 16 Dynamic Programming, Solution of Quiz 1, Quiz 2.
T Sep 21 Divide-and-Conquer, Master Theorem, Quiz 3.
R Sep 23 Design of Quantum Algorithms, Longest Common Subsequence
T Sep 28 Amortized Analysis
R Sep 30 Graph Algorithms
T Oct 05 Graph Algorithms
R Oct 07 Graph Algorithms
T Oct 12 Midterm Exam
R Oct 14 Single Source Shortest Path Algorithms
T Oct 19 Bellman-Ford, Randomized Algorithms
R Oct 21 Randomized Algorithms, Quiz 6
T Oct 26 Monte Carlo, Minimum Cut
R Oct 28 Hiring Problem, Random Permutations, Quiz 7
T Nov 02 Quicksort
R Nov 04 P and NP
T Nov 09 NP-Completeness, SAT, 3SAT
R Nov 11 3SAT, Vertex Cover, Clique
T Nov 16 Approximation Algorithms
R Nov 18 Computability
T Nov 23 Computability
R Nov 25 No class. University is closed.
T Nov 30 Multithreaded Algorithms
T Dec 02 Multithreaded Algorithms
T Dec 06 Contest. Review

Lecture Notes and Slides

All classmaterial is copyrighted. Reposting is not permitted.