TCSS 543, Winter 2013

Handouts

1. Course Organization and Lecture Schedule

Extra Resources

• Some mathematics basics: Exponentials, logarithms, summations
• Proof by induction guide: proof-by-induction-guide.doc
• Short guide to big-Oh and algorithm analysis
• Tips on pseudocode
  
  
• Slides on mergesort, quicksort, and quickselect (Jan. 10 lecture)
• Proof of Master Theorem, case 1 (Jan. 10 lecture)
• Average case analysis of binary search (Jan. 15 lecture)
• Slides on shortest path algorithms (Jan. 22 lecture)
• Slides on minimum spanning tree algorithms (Jan. 24 lecture)
• Analysis of nested loops exercises
  
  
• Some additional practice exercises for fundamental algorithm design and analysis techniques:
  Final exam for TCSS 343 from Winter 2012
  Additional exercises

Assignments

• Homework #1 (suggested due date: Tuesday, January 15)
• Homework #2 (suggested due date: Tuesday, January 22)
• Homework #3 (suggested due date: Tuesday, January 29)
• Homework #4 (suggested due date: Thursday, February 7)
• Homework #5 (suggested due date: Thursday, February 21)
  
  
• Empirical Project (due date: Tuesday, March 12)
• Graph code for the empirical project.
• Graph generation code

Exams

Exam & Midterm Information