the cycle of algorithms

Course Materials

CS 3530

Design and Analysis
of Algorithms

Spring Semester 2014

Basic Design and Analysis

# Date Session Code Hmwk
01 01/14 A Gentle Introduction to the Study of Algorithms . .
02 01/16 Beginning to Design Algorithms zip .
03 01/21 Introductory Design and Analysis . .
04 01/23 Beginning to Analyzing Algorithms zip HW 1
05 01/28 Fundamental Problems and Data Structures . .
06 01/30 Describing Complexity . .
07 02/04 Iterative and Recursive Algorithms zip HW 2
08 02/06 More on Algorithm Analysis . .
09 02/11 The Role of Knowledge in Algorithms . Exam 1

Transition

# Date Session Code Hmwk
10 02/13 Implementing Algorithms . .
11 02/18 Brute Force and Classic Problems zip .

Top-Down Algorithms

# Date Session Code Hmwk
12 02/25 Divide and Conquer zip HW 3
13 02/27 Divide and Conquer for Sorting zip .
14 03/04 From Divide and Conquer to Decrease and Conquer . .
15 03/06 Decrease and Conquer for Permutations . HW 4
16 --/-- Decrease and Conquer for Subsets . .
17 03/11 Variable Decrease and Conquer zip .

Transition

# Date Session Code Hmwk
18 03/13 A Set Membership Problem . Exam 2
19 03/25 Constructing a Bloom Filter . HW 5
20 03/27 A Pancake Interlude zip .
21 04/02 Colored Dots and Onions . .
22 04/04 Green Crocodiles, Green Onions . .

Transformation Strategies

# Date Session Code Hmwk
23 04/08 Turning One Problem Into Another . .
24 04/10 More Problem Transformations zip .
25 04/15 Heaps and Problem Transformation . .
26 04/17 Sorting in Better Than O(n log n) Time . Exam 3

Miscellaneous Strategies

# Date Session Code Hmwk
27 04/22 Remembering and Using Other Solutions zip .
28 04/24 Dynamic Programming for a Classic Problem . HW 6
29 04/29 Greedy Algorithms and Dynamic Programming . .
30 05/01 The End of Algorithms . .

Eugene Wallingford ..... wallingf@cs.uni.edu