CMSC 351 - Sections 0301 and 0401 - Spring 2018
Topic Outlines
Note: Firefox users might find the following
PDF information
useful for websites that have embedded PDF files (like this one).
Set #1 (Course Intro, Example Problems):
(#1) 1-up
(#1) 2-up [01/24, 01/26]
Set #2 (Fibonacci, Transitive Closure, Bubblish Sort):
(#2) 1-up
(#2) 2-up [01/26, 01/29, 01/31]
Bubblish Sort runtime proof
Set #3 (Asymptotic Bounds and Big-O):
(#3) 1-up
(#3) 2-up [01/31, 02/02]
integral bounds overview
Set #4 (Graphs Part 1):
(#4) 1-up
(#4) 2-up [02/02, 02/05, 02/07]
DFS with Timing Information
Set #5 (The Five Asymptotics):
(#5) 1-up
(#5) 2-up [02/07, 02/09, 02/12, 02/14, 02/19]
Set #6 (Sorting and 351):
(#6) 1-up
(#6) 2-up [02/12]
Set #7 (More Recurrences):
(#7) 1-up
(#7) 2-up [02/21, 02/23]
Set #8 (Selection Part I):
(#8) 1-up
(#8) 2-up [02/26]
Set #9 (Selection Part II: Linear-Time Median):
(#9) 1-up
(#9) 2-up [02/28]
Windy Day #1: Median of Median 5
Windy Day #2: Summary of Asymmetry
Windy Day #3: Intro to Randomized Algorithms
Set #10 (Randomized Algorithms):
(#10) 1-up
(#10) 2-up [03/05]
Set #11 (Expected Runtimes):
(#11) 1-up
(#11) 2-up [03/05, 03/07, 03/09]
Set #12 (b-bit Problems):
(#12) 1-up
(#12) 2-up [03/12, 03/16]
Set #13 (Binary [Search] Trees):
(#13) 1-up
(#13) 2-up [03/26] [03/28]
Set #14 (Heaps):
(#14) 1-up
(#14) 2-up [03/28] [04/02]
Set #15 (Lower Bounds of Problems):
(#15) 1-up
(#15) 2-up [04/02] [04/04]
Set #16 (Linear Time Sorting):
(#16) 1-up
(#16) 2-up [04/06] [04/09] [04/11]
"real" runtime of Optimal Radix Sort worked out
Set #17 (Other Linear Time Algorithms):
(#17) 1-up
(#17) 2-up [04/11] [04/13] [04/16]
Set #18 (Intro to Optimization Problems):
(#18) 1-up
(#18) 2-up [04/23] [04/25]
Set #19 (Graph Coloring):
(#19) 1-up
(#19) 2-up [04/27] [04/30]
Set #20 (NPC and SAT):
(#20) 1-up
(#20) 2-up [04/30] [05/02] [05/04]
Set #21 (NPC problems):
(#21) 1-up
(#21) 2-up [05/07] [05/09]
Web Accessibility