Date

Topic

Required Reading – parts in () are optional

Assignment Due – Homework is from the text unless otherwise stated.  Homework is due at the beginning of class on the assigned day.  Points (out of 10) are shown in parenthesis after each problem.  This syllabus contains the official due dates, not learning suite.

1

Sep 1

Introduction: pdf pptx

2

Sep 3

Complexity and Big-O

Ch 0, 1.1

Install Visual Studio (see link) and get started on Project #1

3

Sep 8

Modular Arithmetic and Primality: pdf pptx

Ch 1.2-1.3

HW#1

4

Sep 10

Euclid and RSA: pdf pptx

Ch 1.4-1.5

HW#2:  1.7 (3), 1.25 (3), solve 2²¹ mod 18 using the modexp algorithm of fig 1.4 (4).  Show a table with all variable values at each call level.

5

Sep 15

Divide and Conquer, Master Theorem: pdf pptx

Ch 2.1-2.2

HW#3: 1.18 (3), 1.20 (4) (just the last 3), 1.27 (3)

Project #1 Whiteboard Experience (WB) due 11:59pm Sep 12

6

Sep 17

Convex Hull, Solving Recurrence Relations: pdf  pptx

Recurrent relations notes Part 1-2 and read project #2

HW#4: 2.1 (5) (but just multiply the integers 1001 and 1011, also 0 pad numbers whose lengths are not a power of 2), 2.5(a-e) only find bounds using the master theorem (5)

Project #1 Fermat Primality Tester Due 11:59pm Sep 17

7

Sep 22

More Recurrence Relations, Change of Variables

Recurrent relations notes Part 3-4

HW#5: 2.4(3), 2.17(4),  RR Notes Sec 1.3 problem 1(3)

Keep going on project #2!!

8

Sep 24

Finish RRs, Mergesort, Quicksort, Median

Ch 2.3-2.5, (2.6)

HW#6:  RR Notes Sec 1.3 problem , 2(2), 3(2), 4(3), Sec 2.2:1(3)

You may use any linear equation solver if you wish to find the unknowns

(e.g.  http://www.math.odu.edu/~bogacki/cgi-bin/lat.cgi)

Project #2 WB due 11:59pm Sep 24

9

Sep 29

Matrix Multiplication, Graph Connectedness: pdf pptx

Ch 3.1, 3.2

HW#7:  RR Notes, 3.2:1(5),

Use recurrence relation solution techniques (not master theorem) to give the exact complexity of 3 way mergesort, assume T(1)=1 (5 pts)

10

Oct 1

Graph Connectedness

Ch 3.3-3.4

HW#8: 3.1(4), 3.2(6) – Show DFS forest and all edges in forest

Project #2 Divide & Conquer - Convex Hull Due 11:59pm, Oct 3

11

Oct 6

Graph Paths - Dijkstra’s: pdf  pptx

Ch 4.1-4.5

HW #9: 3.3b,d(4), 3.4(6)

12

Oct 8

Graph Paths - Dijkstra’s Algorithm – finished

Ch 4.6-4.7

HW#10: 4.1(10)

13

Oct 13

Greedy Algorithms: pdf  pptx

Ch 5.1

HW#11: 4.2(10) For consistency, use distances from the previous column, remember to start from node S

14

Oct 15

Greedy Algorithms: Huffman Coding

5.2 (5.3-5.4)

HW#12: 5.2(10) (for b do not use path compression, and if there is a tie in rank when doing union, make the first alphabetical node the root)

Project #3 WB due 11:59pm Oct 15

Start working on Group project - Teams

15

Oct 20

** Mid-Term **,  no class

Study Guide

Testing center 10/19-10/21, Includes all material up to and including chapter 5,  Closed book, 1 page of notes (singled sided and reasonable font) can be brought to the test

16

Oct 22

Dynamic Programming: pdf pptx

Ch 6.1-6.3

HW#13: 5.13(5), 5.14(5)

Project #3 Graph Paths: Network Routing Due 11:59pm, Oct. 24

17

Oct 27

Dynamic Programming 2

Review, Midterm review

Ch 6.4-6.5

HW#14: 6.1(10)

18

Oct 29

Dynamic Programming 3

Ch 6.6-6.7

HW#15: Gene and Knapsack HW 

19

Nov 3

Finish DP, Start Linear Programming pdf pptx

Ch 7.1-7.3

HW#16: Chain Matrix and All Paths HW

20

Nov 5

Linear Programming 2

Ch 7.4-7.7

LP Notes (critical for homework)

HW#17: 7.1(5), 7.3(5)

Project #4 WB due 11:59pm Nov 5

21

Nov 10

Intelligent Search, Backtrack, Branch and Bound pdf  pptx

Ch 9.1

Extra B&B TSP Material

HW#18: Linear Programming and Simplex

Extra notes from Computer Algorithms by E. Horowitz, S. Sahni and S. Rajasekaran

22

Nov 12

Intelligent Search: B&B cont.

HW#19: B&B TSP 1

Project #4 Gene Sequence Alignment Due 11:59pm, Nov. 17

23

Nov 17

A*, NP-Complete pdf  pptx

Ch 8.1-8.2, (8.3)

Ch 5.4

HW#20: B&B TSP 2 

24

Nov 19

Approximation, Local Search:  pdf, pptx

Ch 9.2-9.3

HW 21: A*

Project #5 WB due 11:59pm Nov 19

Nov 24

No class (Friday Instruction)

Nov 26

No class (Thanksgiving)

25

Dec 1

Approximation: Neural Networks

Why Graduate School

HW#22:  Local Search

Project #5 Solving TSP w/ Branch & Bound Due 11:59pm, Nov 30

26

Dec 3

Genetic Algorithms, Average Case Complexity: pdf pptx

27

Dec 8

Randomized Algorithms: pdf

pptx

Which Algorithm to Use

Review

Boxes on pages 29, 53, 56, 140 of text (pp 39, 63, 66, 150 of on-line text)

28

Dec 10

Comparison Project Presentations

Group TSP Comparison Project Hand in a hardcopy at the beginning of class on the last day of class.  By University policy, no work can be accepted after the last day of class.

*** Final (Sec 1: Tuesday, Dec. 15, 11:00am-2:00pm in class) ***

*** Final (Sec 2: Monday, Dec. 14, 7:00am-10:00am in class) ***

Closed book, one page of notes (single sided and reasonable font) can be brought to the test

Comprehensive, but with strong emphasis on second half of the semester, Study Guide