User Tools

Site Tools


courses:alg2009:home

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

courses:alg2009:home [2009/02/26 14:02]
tsay
courses:alg2009:home [2022/12/09 11:04] (current)
tsay2 [Announcements]
Line 7: Line 7:
  
 =====Announcements===== =====Announcements=====
-  * 2/23: slides for Introduction ​and Mathematical ​Induction available+  * 7/2: grade report available 
 +  * 6/4: slides for NP-Completeness available; Note on Chapter 11 of [Manber] available 
 +  * 6/4: slides for Dynamic Programming available 
 +  * 5/17: {{courses:​alg2009:​mid2009_s.pdf|Suggested Solutions to Midterm Problems}} available 
 +  * 5/7: {{courses:​alg2009:​hw6.pdf|Homework Assignment #6}} due on May 27 (Wednesday) 
 +  * 5/7: {{courses:​alg2009:​hw5.pdf|Homework Assignment #5 (Programming Exercise #2)}} due on June 4 
 +  * 5/7: slides for Graph Algorithms available 
 +  * 4/24: {{courses:​alg2009:​hw4.pdf|Homework Assignment #4}} due on May 7 
 +  * 4/24: {{courses:​alg2009:​hw3.pdf|Homework Assignment #3 (Programming Exercise #1)}} due on May 14 
 +  * 4/14: partial solutions to {{courses:​alg2009:​hw1s.pdf|HW#​1}} ​and {{courses:​alg2009:​hw2s.pdf|HW#​2}} available 
 +  * 4/9: slides for Data Structures and for Sorting, Searching, and String Processing available 
 +  * 3/12: {{courses:​alg2009:​hw2.pdf|Homework Assignment #2}} due on April 1; slides for Design by Induction ​available 
 +  * 3/9: slides for Analysis of Algorithms available; Note on Chapter 3 of [Manber] ​available
   * 2/26: {{courses:​alg2009:​hw1.pdf|Homework Assignment #1}} due on March 5; Note on Chapter 2 of [Manber] available   * 2/26: {{courses:​alg2009:​hw1.pdf|Homework Assignment #1}} due on March 5; Note on Chapter 2 of [Manber] available
 +  * 2/23: slides for Introduction and Mathematical Induction available
 +
  
 =====Instructor===== =====Instructor=====
Line 29: Line 43:
   *Introduction - Chapter 1 (.5 week: 2/19a) [{{courses:​alg2009:​ch1slides.pdf|slides}}]   *Introduction - Chapter 1 (.5 week: 2/19a) [{{courses:​alg2009:​ch1slides.pdf|slides}}]
   *Mathematical Induction - Chapter 2 (1.5 weeks: 2/19b, 2/26) [{{courses:​alg2009:​ch2slides.pdf|slides}};​{{courses:​alg2009:​ch2note1.pdf|note}}]   *Mathematical Induction - Chapter 2 (1.5 weeks: 2/19b, 2/26) [{{courses:​alg2009:​ch2slides.pdf|slides}};​{{courses:​alg2009:​ch2note1.pdf|note}}]
-  *Analysis of Algorithms - Chapter 3 (1 week: 3/5) +  *Analysis of Algorithms - Chapter 3 (1 week: 3/5) [{{courses:​alg2009:​ch3slides.pdf|slides}};​{{courses:​alg2009:​ch3note1.pdf|note}}] 
-  *Design by Induction - Chapter 5 (2 weeks: 3/12, 3/19) +  *Design by Induction - Chapter 5 (2 weeks: 3/12, 3/19) [{{courses:​alg2009:​ch5slides.pdf|slides}}] 
-  *Data Structures: A Supplement - Sections 4.3.2,​4.3.4,​4.4,​4.5 (1 week: 3/26) +  *Data Structures: A Supplement - Sections 4.3.2,​4.3.4,​4.4,​4.5 (1 week: 3/26) [{{courses:​alg2009:​ch4slides.pdf|slides}}] 
-  *Sorting, Searching, and String Processing - Chapter 6 (2 weeks: 4/9, 4/23) +  *Sorting, Searching, and String Processing - Chapter 6 (2 weeks: 4/9, 4/23)  ​[{{courses:​alg2009:​ch6slides.pdf|slides}}] 
-  *Graph Algorithms - Chapter 7 (2 weeks: 4/30, 5/7) +  *Graph Algorithms - Chapter 7 (2 weeks: 4/30, 5/7) [{{courses:​alg2009:​ch7slides.pdf|slides}}] 
-  *Selected Topics: Dynamic Programming,​ Mergeable Heaps, and Linear Programming - Chapters 15, 19, 20, and 29 of Cormen //et al.// (2 weeks: 5/14, 5/21) +  *Selected Topics: Dynamic Programming,​ Mergeable Heaps, and Linear Programming - Chapters 15, 19, 20, and 29 of Cormen //et al.// (2 weeks: 5/14, 5/21) [{{courses:​alg2009:​dynamic_prog.pdf|Dynamic Programming}}] 
-  *NP-Completeness - Chapter 11 (2 weeks: 6/4, 6/11)+  *NP-Completeness - Chapter 11 (2 weeks: 6/4, 6/11) [{{courses:​alg2009:​ch11slides.pdf|slides}};​{{courses:​alg2009:​ch11note1.pdf|note}}]
  
 =====Grading===== =====Grading=====
courses/alg2009/home.1235628150.txt.gz · Last modified: 2009/02/26 14:02 by tsay