CISC 320 Agorithms and Advanced Programming

FFT, Read CLR Chapter 32.1, 32.2.
Public Key Encryption, Read CLR Chapter 33.6, 33.7.
Matrix multiplication, Strassen's algorithm. Read CLR Chapter 31.2
The subset sum problem. The problem classes P and NP.
Polynomial time reductions and NP Completeness. Read CLR Chapter 36
Dijkstra's single source shortest path algorithm. Read CLR Chapter 25.2
Depth first search. Read CLR Chapter 23, sections 3 and 5.
Union-Find. Read CLR Chapter 22, sections 1,2,3.
Breadth first search. Read CLR Chapter 23, sections 1,2.
Dynamic Programming. Read CLR Chapter 16, sections 1,2.
Augmenting data structures. Read CLR Chapter 15.1.
B-trees. Read CLR Chapter 19, excluding section 3.
Red-Black Trees, Read Chapter 14, excluding section 4.
Binary search trees, 2-3-4 trees. Scan Chapter 13.
Hash Tables, Read CLR Chapter 12 (proofs not required),
Data structures Chapter 11
Decision trees, Read CLR Section 9.1,
Quick Sort, average case, randomized version. Median finding.
Quick Sort, best and worst case situations. CLR Sections 8.1, 8.2
Heap Sort, Read CLR Chapter 7,
Merge Sort, solving recurrences.
Insertion Sort Read CLR Chapter 1, Scan CLR Chapters 2, 3. 4

Lecture summary:

• Dec 7: Summary
  
  
• Dec 2: FFT, Read CLR Chapter 32.1, 32.2.
  
  
• Nov 30: Public Key Encryption, Read CLR Chapter 33.6, 33.7.
  Project individual writeups due today.
  
  
• Nov 23: Project contest.
  Project code submission due today
  
  
• Nov 18: Matrix multiplication, Strassen's algorithm.
  Read CLR Chapter 31 section 2.
  
  
• Nov 16: Polynomial time reductions and NP Completeness.
  Project part 1 due today.
  
  
• Nov 11: NP problems.
  Read CLR Chapter 36
  
  
• Nov 9: The subset sum problem. The problem classes P and NP
  Project setup discussion. See contents of ~saunders/320/project/ .
  
  
• Nov 4: Dijkstra's single source shortest path algorithm.
  Read CLR Chapter 25, section 2. HW 5 due today
  
  
• Nov 2: Depth first search. Read CLR Chapter 23, sections 3 and 5.
  
  
• Oct 28: Union-Find. Read CLR Chapter 22, sections 1,2,3.
  HW assignment 5 (due Thursday, Nov 4): Exercises 16.2-3, 23.1-2 (in the style of Figure 23.1), 23.2-6.
  
  
• Oct 26: Breadth first search. Read CLR Chapter 23, sections 1,2.
  Group project assigned.
  
  
• Oct 21: Further examples on dynamic programming.
  
  
• Oct 19: Midterm Exam
  
  
• Oct 14: Review discussion for exam.
  HW 4 due today
  
  
• Oct 12: Dynamic Programming. Read CLR Chapter 16, sections 1,2.
  Summary info and sample questions for miterm handout .
  
  
• Oct 7: Finish B-trees,
  Augmenting data structures. Read CLR Chapter 15.1.
  HW assignment 4 (due Thursday Oct 14): Exercises 14.3-1, 15.1-4, 19.2-3,
  Hints: For 14.3-1, see first page of chapter and also think about ex. 14.2-1. for 15.1-4 note that the rank of a key k is defined on page 164 and is the number of keys in the set less than or equal to k. This definition applies even if k is not in the set.
  HW 3 due today
  
  
• Oct 5: B-trees. Read CLR Chapter 19, excluding section 3.
  
  
• Sept 30: Red-Black Trees, Read Chapter 14, excluding section 4.
  
  
• Sept 28: Binary search trees, 2-3-4 trees. Scan Chapter 13.
  HW assignment 3 (due Thursday Oct 7): Exercises 12.2-4, 12.3-4, 12.4-1, (extra credit: problem 8-3, hint: use master theorem).
  
  
• Sept 23: Hash Tables, Read CLR Chapter 12 (proofs not required),
  
  
• Sept 21: Decision trees, Read CLR Section 9.1, Chapter 11 Data structures
  HW 2 due today
  
  
• Sept 16: Hurricane, no class.
  
  
• Sept 14: Quick Sort, average case, randomized version. Median finding.
  Read CLR Sections 10.1, 10.2, Scan 8.3.
  
  
• Sept 9: Quick Sort, best and worst case situations. Read CLR Sections 8.1, 8.2
  HW assignment 2 (due Thursday 9/16): Exercises 7.5-5, 8.1-1, 8.1-2, 8.1-4, 8.2-2
  
  
• Sept 7: Heap Sort, a worst case cost analysis, solving some sums.
  Read CLR Chapter 7, scan chapter 3. HW 1 due today
  
  
• Sept 2: Merge Sort, solving recurrences. Read CLR Chapter 1, scan chapter 4
  
  
• Aug 31: Intro, syllabus handed out,
  Insertion Sort Read CLR Chapter 1, Scan CLR Chapters 2, 3.
  HW assignment 1 (due Tuesday 9/7): Exercises 1.3-4, 1.3-5, Problem 1-1

saunders@cis.udel.edu