CSCE 411 Design and Analysis of Algorithms

• CSCE 411-501, 12:45pm-2:00pm, HRBB 113

General Information

• You can find the syllabus on howdy.
• You can check your grades on ecampus

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
• Sample Final

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

Schedule

T Jan 15	Introduction, review Chapter 3 and Appendix A
R Jan 17	Lower Bounds, Chapter 8.1 and slides
T Jan 22	Lower Bounds, Chapter 8.1 and slides
R Jan 24	Divide and Conquer, Chapter 4
T Jan 29	Divide and Conquer, Chapter 30
R Jan 31	Divide and Conquer, Quiz
T Feb 05	Greedy Algorithms, Chapter 16
R Feb 07	Greedy Algorithms, Chapter 16
T Feb 12	Dynamic Programming, Review, Chapter 15
R Feb 14	Midterm 1
T Feb 19	Midterm 1 solution, Dynamic Programming
R Feb 21	Amortized Analysis
T Feb 26	Amortized Analysis
R Feb 28	Graph Algorithms, BFS
T Mar 05	Graph Algorithms, DFS, Topological Sorting
R Mar 07	Strongly Connected Components
T Mar 12	Spring Break
R Mar 14	Spring Break
T Mar 19	Graph Algorithms, Randomized Algorithms
R Mar 21	Randomized Algorithms, Quiz on Graph Algorithms
T Mar 26	Randomized Algorithms, Review
R Mar 28	Midterm exam 2
T Apr 02	Randomized Algorithms
R Apr 04	Randomized Algorithms
T Apr 09	Complexity Theory, Quiz on Randomized Algorithms
R Apr 11	Complexity Theory
T Apr 16	Complexity Theory
R Apr 18	Complexity Theory, Quiz
T Apr 23	Computability
R Apr 25	Review

Lecture Notes and Slides

• Introduction
• 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, Repetitions,
  Randomized Algorithms 3, Randomized Algorithms 4, Randomized Algorithms 5,
  Background: Probability Theory, Random Variables (the background slides are optional, but recommended)
• Complexity 1, Complexity 2, Complexity 3, Complexity 4, Complexity 5, Complexity 6
• Computability
• Tempted to skip class? Don't! Reading slides is not the same as attending class.