CSC 70010. Algorithms
Fall 2009

Announcments:

• On Nov. 19 we meet at 10:00 to solve assignment IX.
• On Nov. 19 we will study Graph Traversals.

Information (2009):

• General Information
• Tentative Schedule
• Grading
  
  
• General and Grading and Schedule (slides)

Classes (2009):

• introduction
• some mathematical background
• examples
• order statistics
• sort
• sorting networks
• divide and conquer
• greedy algorithms
• dynamic programming
• graphs
• graph traversals

Classes (2008):

• minimum spanning trees
• NP-Completeness

Assignments (2009):

• Review Assignment
• Assignment I: Mathematical Background and Growth of Functions
  • pdf version
  • LaTeX source
  • Due date: Sept. 17
• Assignment II: Order Statistics
  • pdf version
  • LaTeX source
  • Due date: Oct. 1
• Assignment III: Sorting
  • pdf version
  • LaTeX source
  • Due date: Oct. 8
• Assignment IV: Sorting Networks
  • pdf version
  • LaTeX source
  • Due date: Oct. 15
• Assignment V: Midterm
  • pdf version
  • LaTeX source
  • Due date: Oct. 22
• Assignment VI: Divide and Conquer
  • pdf version
  • LaTeX source
  • Due date: Oct. 29
• Assignment VII: Greedy Algorithms
  • pdf version
  • LaTeX source
  • Due date: Nov. 5
• Assignment VIII: Dynamic Programming
  • pdf version
  • LaTeX source
  • Due date: Nov. 12
• Assignment IX: Graphs
  • pdf version
  • LaTeX source
  • Due date: Nov. 19
• Assignment X: Graph Traversals
  • pdf version
  • LaTeX source
  • Due date: Dec. 3

Assignments (2008):

• Assignment Minimum Spanning Trees