Tutorial Exercises, CPSC 331, Fall 2008

Tutorial Exercises

The following are the lab exercises that will be covered during the labs this semester. Note that only answers to selected representative problems from these will be posted; you are expected to attend the tutorials to get answers to the remaining problems.

• Tutorial 1 - review of Java programming fundamental
• Tutorial 2 - testing of programs (Solutions to selected problems)
• Tutorial 3 - proofs of correctness of algorithms (Solutions to selected problems)
• Tutorial 4 - analysis of running time of algorithms (Solutions to selected problems)
• Tutorial 5 - asymptotic notations and standard functions (Solutions to selected problems)
• Tutorial 6 - stacks and queues
• Tutorial 7 - ordered sets, mappings, and binary search trees
• Tutorial 8 - red-black trees
• Tutorial 9 - hash tables
• Tutorial 10 - algorithms for searching
• Tutorial 11 - algorithms for sorting
• Tutorial 12 - heaps and heap sort
• Tutorial 13 - quicksort
• Tutorial 14 - graphs and their representations
• Tutorial 15 - graph traversals and minimum cost paths

---

This page last modified: http://www.cpsc.ucalgary.ca/~jacobs/cpsc331/F08/tutorials.html