01

Jan 11

Ch. 1: Textbook syntax and Motivation (Fibonacci)

Questions on Fibonacci performance

02

Jan 13

Big-oh definition and usage

Questions on Big-oh notation

03

Jan 18

Practice on worst, best, and average-case complexity

Questions on worst, best, and average-case complexity

04

Jan 20

Ch 2: Divide-and-Conquer

Questions on Divide-and-Conquer

05

Jan 25

Quick Sort

Questions on Quick sort

06

Jan 27

Ch 3: Intro. To Dynamic Programming: coin-change problem

Questions on Coin-change problem

07

Feb 01

Dynamic Programming: binomial coefficient example; Memoization

Questions on binomial coefficient

08

Feb 03

Dynamic Programming: Floyd's Algorithm (All-pairs Shortest Path) and Optimal BST algorithm

Questions on Floyd's Algorithm and Optimal BST Algorithm

09

Feb 08

Dynamic Programming: Optimal BST algorithm and Traveling Salesperson Algorithm

Questions on Optimal BST Algorithm

10

Feb 10

Dynamic Programming: TSP algorithm

Questions on TSP Algorithm

11

Feb 15

Continue TSP example

12

Feb 17

Review for Test 1

Test 1 Review Topics

13

Feb 22

Test 1:

Test 1 Solution

14

Feb 24

Ch 4: Return Test and Greedy Algorithms: Prim's algorithm

Questions on Greedy Algorithms

15

Mar 01

Greedy Algorithms: Prim's algorithm and Dijkstra's algorithm

Questions on Prim's and Dijkstra's Algorithms

16

Mar 03

Greedy Algorithms: 0-1 Knapsack Problem

Questions on 0-1 Knapsack Problem

17

Mar 08

Ch 5: Backtracking with Coin-change Problem

Questions on Backtracking

18

Mar 10

Backtracking with sum-of-subsets Problem

Subset Sum C++ Backtracking Solution

Questions on sum-of-subsets Backtracking

Spring Break

19

Mar 22

Backtracking 0-1 Knapsack Problem

0-1 Knapsack C++ Backtracking Solution

Questions on 0-1 Knapsack problem using Backtracking

20

Mar 24

Backtracking 0-1 Knapsack Problem

Questions on tracing and debugging 0-1 Knapsack problem

21

Mar 29

Ch 6: Best-first search with Branach-and-Bound on the 0-1 Knapsack Problem

Questions on Branch-and-Bound with 0-1 Knapsack problem

22

Mar 31

Best-first search with Branach-and-Bound on TSP

Questions on Branch-and-Bound with TSP

23

Apr 05

Review for Test 2

Test 2 Review Topics

24

Apr 07

Test 2:

Test 2 Solution

25

Apr 12

Ch 7: Computational complexity of sorting using comparisons; Radix sort

Questions on computational complexity of sorting

26

Apr 14

Ch 8: Computational complexity of searching using comparisons

Questions on computational complexity of searching

Apr 19

Ch 9: Intro. To the theory of P and NP

Questions on theory of P and NP

Apr 21

Ch 9: NP-complete, NP-hard, Approximation algorithms

Questions on NP-complete problems

Apr 26

Ch 9: Approximation algorithms

Questions on Approximation algors

Apr 28

Review for Final Exam

Final Exam Review Topics

Final Exam, Thursday (May 5) 3-4:50 PM in ITT 322