Syllabus for CS 305-503,
Data Structures & Algorithms

Fall 2008


The syllabus is broken up into three two-week sections.

  1. Sorting and Searching

  2. Linked Lists, Stacks, and Queues

  3. Trees
Notes:

Section 1 - Sorting and Searching, Tuesday, 28 October to Thursday, 6 November.

Readings
Nyhoff, Chapter 13, section 13.2 omitted

Class notes
Sorting Basics
Faster Sorting

Assignment
Assignment 1a (last modified on 2 November 2008) available on Tuesday, 28 October; due on Tuesday, 4 November at 6:00 p.m.
Assignment 1b (last modified on 9 November 2008) available on Tuesday, 4 November; due on Tuesday, 11 November at 6:00 p.m.

An example solution for part 1.
A code review for part 1.

An example solution for part 2.
A code review for part 2.

Quiz - Tuesday, 11 November
The answers.
The grades.

Section 2 - Linked Lists, Stacks, and Queues, Tuesday, 11 November to Thursday, 20 November.

Readings
Nyhoff, Chapters 6 through 8

Class notes
Linked Lists
Stacks
Queues

Assignment
Assignment 2 (last modified on 13 November 2008) available on Tuesday, 11 November; due on Tuesday, 25 November at 6:00 p.m.
An example solution.

Quiz - Tuesday, 25 November
The answers.
The grades.

Section 3 - Trees, Tuesday, 25 November to Thursday, 4 December.

Thanksgiving Break - No class on Thursday, 27 November.

Readings
Nyhoff, Sections 12.1 through 12.5, Section 13.2

Class notes
Tree Basics
Binary Search Trees
Heaps and Priority Queues

Assignment
Assignment 3 (last modified on 10 December 2008) available on Tuesday, 25 November; due on Thursday, 11 December at 6:00 p.m.

Quiz - Tuesday, 9 December
The answers.
The grades.

Open Lecture about a topic to be determined at a time to be determined on a date to be determined in a location to be determined.


This page last modified on 28 October 2008.

Creative
    Commons License