01

Aug 23

Ch 1: Textbook terms and notation; Motivation

Questions comparing fibonacci implementations/algorithms

02

Aug 25

Ch 1: Asymptotic complexity definitions and usage

Questions on big-oh, omega, and theta definitions

03

Aug 30

Ch 2: Divide-and-Conquer

Appendix B: Solving Recurrences

Questions on divide-and-conquer

04

Sep 01

Appendix B: Solving Recurrences using the characteristic equation

Questions on solving recurrences using the characteristic equation

05

Sep 06

Ch 2: Divide-and-Conquer Application: Multiplication of Large Integers

Questions on application of divide-and-conquer

06

Sep 08

Ch 3: Dynamic Programming Applications: Coin-Change Problem and Binomial Coefficient

Questions on application of dynamic programming on Coin-Change Problem

07

Sep 13

Ch 3: Dynamic Programming Application: Memoization Technique and TSP

Questions on Memoization and TSP

08

Sep 15

Complete TSP

09

Sep 20

Ch 4: Greedy Algorithms – Prim's Algorithm

Questions on Prim's Algorithm

10

Sep 22

Ch 5: Greedy Knapsack and Dynamic 0-1 Knapsack Algorithms

Questions on Knapsack Algorithms

11

Sep 27

Review for Test1

Test 1 Review Topics

12

Sep 29

Test 1:

13

Oct 04

Intro. To Backtracking

Questions on Backtracking

14

Oct 06

Backtracking: Sum-of-subsets and 0-1 Knapsack

Sum-of-Subsets Backtracking Code

Questions on Sum-of-Subsets and 0-1 Knapsack with Backtracking

15

Oct 11

More 0-1 Knapsack

0-1 Knapsack Backtracking Code

Questions on 0-1 Knapsack with Backtracking

16

Oct 13

Best-First search with Branch-and-Bound (Ch 6): 0-1 Knapsack and TSP

Questions on 0-1 Knapsack and TSP with Best-first search

17

Oct 18

Computational Complexity of Sorting and Searching

Questions on computational complexity of sorting and searching

18

Oct 20

Introduction to the “Theory of NP”

Questions on the theory of NP

19

Oct 25

Reduction of CNF-SAT to clique problem

20

Oct 27

Overview of Cook's Theorem

Overview of Cook's Theorem

21

Nov 01

Definition of NP-Hard and Reduction Activity

Questions on reducing Clique to Independent Set

22

Nov 03

Review for Test 2

Test 2 Review Topics

23

Nov 08

Test 2:

24

Nov 10

A simple TSP approximation algorithm for graph satisfying the triangle inequality

Questions on TSP approximation algorithms

25

Nov 15

Limitations of TSP approximation for general graphs

Approximation algorithm for Bin-Packing Problem using nonincreasing first-fit algorithm

Questions on limitations of TSP approximation algorithms on general graph and Bin-Packing Approximation algorithm

26

Nov 17

Finish bound of Bin-Packing approximation algorithm and Introduction to parallel architecures

Thanksgiving Break

Nov 29

Parallel architectures and the PRAM model

Questions on PRAM algorithms

Dec 01

Parallel architectures and the PRAM model

Questions on CRCW PRAM algorithms

Dec 06

Intro. To Parallel Programming

Intro. to Parallel Programming

Questions on parallel programs and architectures

Dec 08

Review for Final Exam

Final Exam Review Topics

Final Exam, Wednesday (December 14) 1-2:50 PM in ITT 322