TCSS 343, Spring 2008
Handouts
- Course
Organization
- Lecture
schedule
- Peer
assessment guidelines
- Assumptions
that guide this course
Extra Resources
- 321, 342 review sheet: review
- Some mathematics basics: Exponentials, logarithms, summations
- Guide to proof by induction
- Short guide to
big-Oh and algorithm analysis
-
Motivating examples for the
course
-
Code analysis exercise
(from 4/8)
- Algorithm analysis
preliminaries
(from 4/8)
- Suggested problems for Chapters 3 and 4:
- 3.1.3, 3.1.4, 3.1.5, 3.1.6.
- 3.4.6, 3.4.8.
- 4.1.1, 4.1.2, 4.1.4, 4.1.5, 4.1.8.
- 4.2.1, 4.2.2, 4.2.11.
- 4.3.1,
4.3.7, 4.3.8, 4.3.9.
- Handout on
binary
search (from 4/10 lecture)
-
Lecture slides for mergesort,
quicksort, and quickselect (from 4/15, 4/17
lectures)
- Handout on
large integer multiplication (from 4/22,
4/24
lectures)
- Tips on
pseudocode
- Proof of correctness for the
binary exponentiation algorithm
(from 5/1 lecture)
-
Lecture slides for optimal binary
search tree (from 5/13 lecture)
-
Lecture slides
for shortest paths (from 5/20 lecture)
-
Lecture slides for minimum spanning trees (from
5/22 lecture)
-
Proof of correctness of Prim's
algorithm
-
Lecture slides
for sorting lower bounds (from 5/29
lecture)
Assignments
Peer Assessment (All peer assessment materials need to be turned in both
hard copy and by e-mail.)
Exams
Exam & Midterm Information