312 Schedule – Fall 2014

This schedule is approximate and subject to change.  Updates will be made here and will be announced in class.

 

 

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.

 

1

Sep 2

Introduction and Algorithms

 

 

 

2

Sep 4

Complexity and Big-O

Ch 0, 1.1

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

 

3

Sep 9

Modular Arithmetic and Primality

Ch 1.2-1.3

HW#1

 

4

Sep 11

GCD and RSA

Ch 1.4-1.5

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

 

5

Sep 16

Divide and Conquer, Master Theorem

Ch 2.1-2.2

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

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

 

6

Sep 18

Convex Hull, Solving Recurrence Relations

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),  Start project #2!!

 

7

Sep 23

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 25

Finish RRs, Median, Matrix Multiplication

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)

 

9

Sep 30

Finish Divide and Conquer

Graph Connectedness

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 2

Graph Connectedness

Ch 3.3-3.4

HW#8: 3.1(4), 3.2(6)

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

 

11

Oct 7

Graph Paths – Dijkstra’s

Ch 4.1-4.5

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

 

12

Oct 9

Graph Paths - Dijkstra’s Algorithm – finished

Ch 4.6-4.7

 

HW#10: 4.1(10)

 

13

Oct 14

Greedy Algorithms

Ch 5.1

HW#11: 4.2(10) For consistency, use distances from the previous column

 

14

Oct 16

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)

Start Group TSP Comparison Project group project - Teams

 

15

Oct 21

** Mid-Term **,  no class

Study Guide

 

Testing center 10/20-10/22, 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 23

Dynamic Programming 1

Ch 6.1-6.3

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

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

 

17

Oct 28

Dynamic Programming 2

Review Midterm

Ch 6.4-6.5

HW#14: 6.1(10)

 

18

Oct 30

Dynamic Programming 3

Ch 6.6-6.7

HW#15: Gene and Knapsack HW

 

19

Nov 4

Finish Dynamic Programming

Start Linear Programming 1

Ch 7.1-7.3

HW#16: Chain Matrix and All Paths HW

 

20

Nov 6

Linear Programming 2

Ch 7.4-7.7

LP Notes (critical for homework)

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

 

 

21

Nov 11

Intelligent Search Branch and Bound

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 13

Intelligent Search: B&B cont.

 

HW#19: B&B TSP 1

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

 

23

Nov 18

Intelligent Search: A*

NP-Complete Problems

Ch 8.1-8.2, (8.3)

Ch 5.4

HW#20: B&B TSP 2

 

 

24

Nov 20

Approximation: Local Search

Ch 9.2-9.3

HW 21: A*

 

 

 

Nov 25

No class (Friday Instruction)

 

 

 

 

Nov 27

No class (Thanksgiving)

 

 

 

25

Dec 2

Approximation: Neural Networks

Why Graduate School

 

HW#22:  Local Search

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

 

26

Dec 4

Genetic Algorithms

Average Case Complexity

 

 

 

27

Dec 9

Randomized Algorithms

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 11

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. 16, 7:00am-10:00am in class) ***

*** Final (Sec 2: Tuesday, Dec. 16, 2:30pm-5:30pm 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