CPSC220A: Fundamental of Computer Science III
Fall 2005

Dr. Adrienne Bloss
MWF 9:40-10:40 Trexler 375

Syllabus

Useful material Homework Programs
Using PuTTY to connect to CS
Online Java documentation
Homework 1: Review
Homework 2: Review and Bubblesort
Homework 3: More Bubblesort and Quicksort
Homework 4: More Quicksort
Forgotten Homework 5: Quicksort Complexity
Homework 5: Mergesort
Homework 6: Sorting Code
Homework 6: Sorting Data
Homework 7: Sort Detective
Homework 7 Part 2: Tree Traversals
Homework 8: Proving Properties of Binary Trees
Homework 9: More Binary Tree Proofs
Homework 10: BSTs and AVL Trees
Homework 11: More AVL Trees
Homework 12: Computing Height and Balance in Trees
Homework 13: 2-3 Trees
Homework 13 Part 2: 2-3 Trees Now That You Know What You're Doing
Homework 14: Heaps
Homework 15: More Heaps
Homework 16: Graph Exercises #1-5
Homework 17: Shortest Paths
Program 1: Game Scores

Program 2: More Games

Lab: Using a Heap to Implement a Priority Queue

Program 3: Rating the Teams

Program 4: Winning Paths