CSCE 629 Analysis of Algorithms

Fall 2017
Course Information for the sections CSCE 629-601


Meeting time and place: Instructor: Andreas Klappenecker
Office: HRBB, Room 509B
Office Hours: MT 1:30-2:30pm or by appointment.
e-mail: klappi at cse.tamu.edu

Teaching Assistant: Huang Qin
Office: HRBB-315A
Office Hours: TR 9:00am-noon
e-mail: huangqin at email.tamu.edu

General Information

Announcements

Homework

Schedule

W Aug 30Introduction, skim [CLRS] Chap 2, read Appendix A
F Sep 01Asymptotic Notations, read lecture notes
M Sep 04Asymptotic Notations, Lower Bounds, read [CLRS] Chapter 8.1
W Sep 06Lower Bounds, read [CLRS] Chapter 9.1, slides
F Sep 08Lower Bounds, Divide and Conquer
M Sep 11Divide and Conquer, Strassen Matrix Multiplication
W Sep 13Divide and Conquer, FFT
F Sep 15Divide and Conquer, FFT
F Sep 15 Optional Review: Fast Fourier Transform, Part I
F Sep 15 Optional Review: Fast Fourier Transform, Part II
M Sep 18Greedy Algorithms
W Sep 20Greedy Algorithms
F Sep 22Greedy Algorithms
M Sep 25Dynamic Programming
W Sep 27Dynamic Programming
F Sep 29Dynamic Programming, Quiz on Greedy Algorithms and Matroids
M Oct 02Amortized Analysis
W Oct 04Amortized Analysis
F Oct 06Amortized Analysis, Quiz on Dynamic Programming
M Oct 09Review
W Oct 11Midterm Exam
F Oct 13Graph Algorithms
M Oct 16Midterm Exam Review, Graph Algorithms
W Oct 18Graph Algorithms
F Oct 20Graph Algorithms, Quiz on Graph Algorithms

Lecture Notes and Slides

All classmaterial is copyrighted. Reposting is not permitted.