CPSC 327 Schedule

Reading is to be done for the class period where it is listed.

Dates for things in light gray are for planning purposes and may be adjusted slightly.

		Assignments
Week 1: 1/21-1/24 Topics: introduction; analysis of algorithms

Wed	Slides: course introduction	homework 1 due Fri 1/24
		homework 1 due Fri 1/24
Fri	Reading: Eck, Introduction to Programming Using Java (8th ed), section 8.5 Slides: analysis of algorithms	homework 2 due Mon 1/27
Week 2: 1/27-1/31 Topics: analysis of algorithms; basic ADTs and their implementation

Mon	Reference: big-Oh for sums exponent and log rules (typo fixed) Slides and Handouts: analysis of algorithms running time problems handout	homework 3 due Wed 1/29
		homework 3 due Wed 1/29
Wed	Reading: Eck, Introduction to Programming Using Java (8th ed), sections 3.8.4, 7.2.4, 9.2-9.4, 10.2-10.3 The reading is lengthy, but it should be largely review. Focus on what ADTs are, what the fundamental ADTs are and their operations, working with arrays, linked lists, and binary trees, and using arrays, linked lists, and binary trees to implement the fundamental ADTs. Slides: analysis of algorithms (including solution for HW 2 #3) fundamental ADTs and data structures	homework 4 due Mon 2/3
		homework 4 due Mon 2/3
Fri	Slides: analysis of algorithms (solution for HW 2 #2) fundamental ADTs and data structures (can we do better? with respect to basic implementations of fundamental ADTs, binary search trees)	homework 5 due Mon 2/3
Week 3: 2/3-2/7 Topics: balanced binary trees; hashtables

Mon	Reading: AVL trees Slides: AVL trees (with a special bonus: splay trees)	homework 6 due Wed 2/5
		homework 6 due Wed 2/5
Wed	Reading: 2-4 trees Slides: 2-4 trees (with a mention of red-black trees)	homework 7 due Fri 2/7
		homework 7 due Fri 2/7
Fri	Reading: hashtables Slides: hashtables	homework 8 due Mon 2/10
Week 4: 2/10-2/14 Topics: heaps; specialized data structures and rolling your own; fundamental algorithms (searching and sorting); the interplay of algorithms and data structures

Mon	Reading: heaps Slides: priority queues (and heaps!) figuring out and writing up algorithms	homework 9 due Wed 2/12
		homework 9 due Wed 2/12
Wed	Slides: building heaps; ADT/data structures roundup; some algorithmic applications of data structures		project 1 Codebreaker

Fri	Slides: some algorithmic applications of data structures; developing data structures	homework 10 due Mon 2/17
Week 5: 2/17-2/21 Topics: iterative algorithms

Mon	Reading: developing iterative algorithms Slides and Examples: sorting as a tool developing iterative algorithms writeup for the group assignment problem (homework 10, #2)	homework 11 due Wed 2/19
		homework 11 due Wed 2/19
Wed	Reference: iterative algorithm rubric Slides and Examples: comments on developing iterative algorithms developing iterative algorithms writeup for the tournament problem	homework 12 due Fri 2/21
		homework 12 due Fri 2/21
Fri	Slides and Examples: developing iterative algorithms writeup for the snowplow problem	homework 13 due Mon 2/24
Week 6: 2/24-2/28 Topics: greedy algorithms

Mon	Reading: developing greedy algorithms Reference: greedy algorithm rubric Slides and Examples: developing greedy algorithms writeup for the captioning problem	homework 14 due Wed 2/26
		homework 14 due Wed 2/26
Wed	Slides and Examples: comments on hw 8 developing greedy algorithms writeup for the Boston-to-Seattle problem	homework 15 due Fri 2/28
		homework 15 due Fri 2/28
Fri	Slides and Examples: comments on hw 9 developing greedy algorithms (also counterexamples) writeup for the Boston-to-Seattle problem	homework 16 due Mon 3/2
Week 7: 3/2-3/6 Topics: greedy algorithms; divide-and-conquer algorithms

Mon	Slides: comments on hw 15 developing counterexamples	homework 17 due Wed 3/4
		homework 17 due Wed 3/4
Wed	Reading: developing recursive and divide-and-conquer algorithms (note: section 4.3 corrected!) Slides and Examples: developing recursive and divide-and-conquer algorithms writeup for the find min problem		exam 1 (review information)

Fri	Examples: writeup for the majority problem
Week 8: 3/9-3/13 Topics: divide-and-conquer algorithms; improving running times

Mon	Examples: writeup for the majority problem (including discussion of how to improve the O(n log n) algorithm) writeup for the stocks problem	homework 18 due Wed 3/11	project 2 Algorithmic Paradigms
		homework 18 due Wed 3/11
Wed	Slides: divide-and-conquer sorting, unwinding recurrence relations	homework 19 due Fri 3/13
		homework 19 due Fri 3/13
Fri	Slides and Other Materials: improvement strategies (with applications to sorting) sorting algorithms previously discussed: insertion sort, selection sort, merge sort, quicksort sorting algorithms discussed in class: heapsort, bucket sort, shuffle sort, counting sort and pigeonhole sort, radix sort comparison of sorting algorithms
Spring Break: 3/14-3/22
Week 10: 3/23-3/27 Topics: graphs, graph ADT, graph traversal (breadth-first search) and applications			project 2 Algorithmic Paradigms (continued)

Mon	Reading: graphs, graph terminology, and modeling with graphs	homework 20 due Wed 3/25 (on Canvas)
		homework 20 due Wed 3/25 (on Canvas)
Wed	Reading: Graph ADT From Class: graph modeling problems and solutions	homework 21 due Fri 3/25 (on Canvas)
		homework 21 due Fri 3/25 (on Canvas)
Fri	Reading: breadth-first search From Class: some applications of BFS and related algorithms	homework 22 due Mon 3/30 (on Canvas)
Week 11: 3/30-4/3 Topics: shortest paths, graph traversal (depth-first search) and applications, minimum spanning trees and other important graph algorithms

Mon	Reading: shortest paths (updated to the "notes" version rather than "handouts" version) From Class: tracing Dijkstra's algorithm	homework 23 due Wed 4/1 (on Canvas)
		homework 23 due Wed 4/1 (on Canvas)
Wed	Reading: depth-first search From Class: tracing DFS and topological sort, key points from the reading	homework 24 due Fri 4/3 (on Canvas)
		homework 24 due Fri 4/3 (on Canvas)
Fri	Reading: minimum spanning trees From Class: tracing Kruskal's and Prim's algorithms, key points from the reading	homework 25 due Mon 4/6 (on Canvas)
Week 12: 4/6-4/10 Topics: solving problems with graphs; flow

Mon	Reading: solving problems with graphs From Class: homework problems solutions for some of the homework problems Other Materials: comments on exam 1 solutions for homework problems: 11-1, 14-1, 15-1, 18-2, 19-1

Wed	Reading: flow From Class: max flow examples		exam 2 (on Canvas) review information

Fri	From Class: more modeling-with-graphs examples
Week 13: 4/13-4/17 Topics: recursive backtracking, pruning, branch and bound

Mon	Reading: recursive backtracking From Class: developing recursive backtracking algorithms	homework 26 due Wed 4/15 (on Canvas)	project 3 Finding Your Way
		homework 26 due Wed 4/15 (on Canvas)
Wed	Reading: pruning, branch and bound From Class: pruning, branch and bound (key points, knapsack example)	homework 27 due Mon 4/20 (on Canvas)

Fri	Reading: more branch and bound examples, efficient implementations linear programming (optional - linear programming is useful to know about as a modeling strategy, and binary integer linear programs are an application for branch and bound techniques) From Class: bound functions, initial solution estimates, implementation efficiency (key points)
Week 14: 4/20-4/24 Topics: dynamic programming

Mon	Reading: dynamic programming From Class: dynamic programming longest subsequence problem template	homework 28 due Wed 4/22 (on Canvas)
		homework 28 due Wed 4/22 (on Canvas)
Wed	Reading: dynamic programming examples From Class: dynamic programming examples (longest increasing subsequence, championship problem)	homework 29 due Fri 4/24 (on Canvas)
		homework 29 due Fri 4/24 (on Canvas)
Fri	From Class: dynamic programming examples (challenges problem)	homework 30 due Mon 4/27 (on Canvas)
Week 15: 4/27-5/1 Topics: reductions, complexity, dealing with NP-complete problems

Mon	Reading: reductions From Class: reductions	homework 31 due Wed 4/29 (on Canvas)
		homework 31 due Wed 4/29 (on Canvas)
Wed	Reading: complexity From Class: complexity classes and reductions	homework 32 due Fri 5/1 (on Canvas)
		homework 32 due Fri 5/1 (on Canvas)
Fri	Reading: dealing with NP-complete problems From Class: dealing with NP-complete problems Other Materials: comments on homeworks 26-27 and 30-32 (recursive backtracking, dynamic programming, reductions and complexity)
Week 16: 5/4 Topics: wrapup

Mon	Reading: how to design data structures and algorithms The Stony Brook Algorithm Repository - look through the listing of problems, then choose several things (that you aren't already familiar with!) from the Data Structures or Graph sections (polynomial-time problems and hard problems) to read about From Class: how to design data structures and algorithms
Reading Period: 5/5-5/7

Tue	office hours 12-2pm

Wed	office hours 12-2pm

Thu	office hours 12-2pm
Exams: 5/8-5/11

Fri	office hours 12-2pm

Sat

Sun	final exam due 5/10 4:30pm review information	end-of-semester deadline no work accepted after 5/10 4:30pm

Mon

CPSC 327 Schedule

Week 1: 1/21-1/24

Week 2: 1/27-1/31

Week 3: 2/3-2/7

Week 4: 2/10-2/14

Week 5: 2/17-2/21

Week 6: 2/24-2/28

Week 7: 3/2-3/6

Week 8: 3/9-3/13

Spring Break: 3/14-3/22

Week 10: 3/23-3/27

Week 11: 3/30-4/3

Week 12: 4/6-4/10

Week 13: 4/13-4/17

Week 14: 4/20-4/24

Week 15: 4/27-5/1

Week 16: 5/4

Reading Period: 5/5-5/7

Exams: 5/8-5/11