CS 14: Introduction to Data Structures and Algorithms

Fall Quarter 2002: September 23, 2002 - December 6, 2002


Downloads

More and more things you can download for the class will be collected here. Note that the most current code is available at the bottom of this page. All solutions we publish come without any warranty. Please report any problems you find!


Homeworks

Assignment 1 | Sample Solution

Assignment 2 | Sample Solution

Assignment 3 | Sample Solution

Assignment 4 | Sample Solution

Assignment 5 | Sample Solution

Labs

Lab 0 Archive

Lab 1 Description | Lab 1 Archive | Sample Solution

Lab 2 Description | Lab 2 Archive | Sample Solution

Lab 3 Description | See Stack and Heap below! | Sample Solution

Lab 4 Description | Lab 4 Archive | Sample Solution

Lab 5 Description | Lab 5 Archive | Sample Solution

Exams

Quiz 0 | Sample Solution

Quiz 1 | Sample Solution

Quiz 2 | Sample Solution

Midterm | Sample Solution

Quiz 3 | Sample Solution

Quiz 4 | Sample Solution

Quiz 5 | Sample Solution

Final (corrected!) | Sample Solution

Handouts

ADT Array | ADT Boolean | ADT List | ADT BinaryTree | ADT Stack | ADT Set

Arrays in Python (Optional)

Sample Code

Please note that all my files have a version number at the top somewhere. Also, sometimes I update files without telling anybody. So if you want to make sure you have the most current version of something, download it again and compare.

Variable Implementation (very complete for my standards)

Array Implementation (including Iterator and recursive arrays)

List Implementation (singly- and doubly-linked lists)

BinaryTree Implementation

Stack Implementation (using List)

Heap Implementation (using BinaryTree)

Sorting Implementation (using Array and Heap)


Copyright © 2002 Peter H. Fröhlich. All rights reserved.
$Id: downloads.html,v 1.20 2002/12/14 07:45:19 phf Exp $
Valid XHTML 1.1!