CSCE 411 Design and Analysis of Algorithms

• CSCE 411: TR 11:10am-12:25, HRBB 113

General Information

• You can find the syllabus on howdy.
• You can check your grades on ecampus
• The final exam is on Friday, 12/8/2017, 3:00pm-5:00pm in our classroom

Announcements

• All flipped material is homework. Watch the videos before the next class period.
• Quizzes will be usually unannounced. They will often cover flipped material,concepts discussed in class, and reading assignments.
• Check e-campus for announcements, discussions, questions and answers.
• Sample Midterm
• Brief Introduction to LaTeX
• The Not So Short Introduction to LaTeX
• The final exam is on Friday, December 9, 3:00-5:00pm in our classroom

Homework

• hw1.tex hw1.pdf
• hw2.tex hw2.pdf
• hw3.tex hw3.pdf
• hw4.tex hw4.pdf
• hw5.tex hw5.pdf
• hw6.tex hw6.pdf
• hw7.tex hw7.pdf
• hw8.tex hw8.pdf
• hw9.tex hw9.pdf
• hw10.tex hw10.pdf

Schedule

R Sep 01	Introduction, skim [CLRS] Chap 2, read Appendix A
T Sep 05	Asymptotic Notations, Lower Bounds; read lectures notes, CLRS 8.1
R Sep 07	Lower Bounds; CLRS 9.1
T Sep 12	Divide and Conquer
R Sep 14	Divide and Conquer, FFT
R Sep 14	Optional Review: Fast Fourier Transform, Part I
R Sep 14	Optional Review: Fast Fourier Transform, Part II
T Sep 19	Greedy Algorithms
R Sep 21	Greedy Algorithms, Matroids
T Sep 26	Dynamic Programming
R Sep 28	Dynamic Programming, Quiz on Greedy Algorithms and Matroids
T Oct 03	Amortized Analysis
R Oct 05	Amortized Analysis, Quiz on Dynamic Programming
T Oct 10	Review
R Oct 12	Midterm Exam
T Oct 17	Graph Algorithms
R Oct 19	Graph Algorithms
T Oct 24	Graph Algorithms, Quiz on Graph Algorithms, Randomized Algorithms
R Oct 26	Randomized Algorithms
T Oct 31	Randomized Algorithms
R Nov 02	Randomized Algorithms
T Oct 07	Computational Complexity, Quiz on Randomized Algorithms
R Nov 09	Computational Complexity
T Nov 14	Computational Complexity
R Nov 16	Computational Complexity
T Nov 21	Approximation Algorithms
R Nov 23	No class - University closed
T Nov 28	Undecidability, Quiz on Computational Complexity
R Nov 30	Algorithmic Problems
R Dec 05	Review

Lecture Notes and Slides

• Introduction
• Asymptotic 1, Asymptotic 2, Asymptotic 3, Asymptotic 4
• Lower Bounds 1, Lower Bounds 2, Lower Bounds 3
• Divide and Conquer 1, Divide and Conquer 2, Divide and Conquer 3, Divide and Conquer 4
• Greedy Algorithms 1, Greedy Algorithms 2, Greedy Algorithms 3
• Dynamic Programming 1, Dynamic Programming 2, Dynamic Programming 3
• Amortized Analysis 1, Amortized Analysis 2, Amortized Analysis 3, Amortized Analysis 4
• Graph Algorithms 1, Graph Algorithms 2, Graph Algorithms 3, Graph Algorithms 4, Graph Algorithms 5, Graph Algorithms 6
• Randomized Algorithms 1, Randomized Algorithms 2, Randomized Algorithms 3, Randomized Algorithms 4, Randomized Algorithms 5,
  Probabilistic Biquorums, 2SAT.
• Complexity 1, Complexity 2, Complexity 3, Complexity 4, Complexity 5, Complexity 6, Complexity 7
• Undecidability 1, Undecidability 2,