CS 2604 Notes  – Summer 2003

Updated course notes will be posted here in PDF format as they become available.

Notes by Mr McQuain:

Chapter Topic 2-up format Last Revised

C00

Course Administration

here

May 16, 2003

C01

Linear Structures

here

May 16, 2003

C02

General Binary Trees

here

May 16, 2002

C03

Binary Search Trees

here

May 30, 2003

C04

Algorithm Analysis

here

May 16, 2002

C05

Asymptotics

here

May 16, 2002
C06 AVL Trees here June 2, 2003
C10 Hashing here June 5, 2003
C07 Heaps here June 12, 2003
C08 General Trees here June 12, 2003
C09 Secondary Storage here June 12, 2003
C11 Binary File I/O here June 18, 2003
C14 Sorting here June 18, 2003
C13 Tree Indexing here June 23, 2003
C15 Graphs here June 24, 2003
C16 Self-organizing Lists here June 24, 2003

 

Additional notes:

 

Topic 4-up format Last Revised

Skip Lists

here

Jan 30, 2002

 

Appendices:

Chapter Topic 2-up Last Revised
App01 Math Review here July 2, 2000
  ...more to come...    

 

Supplemental Notes:

Last updated on:    Tuesday, June 24, 2003