CS 2604 Notes

CS 2604 Notes – Summer 2002

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

Notes by Mr McQuain:

Chapter	Topic	4-up format	Last Revised
C00	Course Administration	here	May 14, 2002
C01	Linear Structures	here	May 15, 2002
C02	Algorithm Analysis	here	May 15, 2002
C03	Asymptotics	here	May 15, 2002
C04	General Binary Trees	here	May 15, 2002
C05	Binary Search Trees	here	May 17, 2002
C06	AVL Trees	here	May 28, 2002
C07	Heaps	here	June 3, 2002
C08	General Trees	here	June 3, 2002
C09	Secondary Storage	here	June 3, 2002
C10	Hashing	here	June 1, 2002
C11	Binary Files	here	Feb 17, 2002
C12	Table Lookup	here	Nov 8
C13	Tree Indexing	here	Nov 13
C14	Sorting	here	June 28
C15	Graphs	here	Aug 3
C16	Self-organizing Lists	here	Dec 4
C17	External Sorting	here	Dec 6

Additional notes:

Topic	4-up format	Last Revised
Skip Lists	here	Jan 30, 2002
Iterators	here	May 28, 2002

Appendices:

Chapter	Topic	1-up format	4-up format	Last Revised
App00	Background Review	here	here	July 3
App01	Math Review	here	here	July 2
App03	Parsing Tutorial	here	here	Aug 25
	...more to come...

Supplemental Notes:

Pointers and Memory by Nick Parlante
Linked-List Basics by Nick Parlante
UNIX Quick Start by Parlante and others
CS 1044 Notes on String Objects
CS 1044 Notes on Stream I/O
Fall 2001 CS 2704 Notes
CS 1704 HomePage (open in a new window unless you have a BIG monitor)

Last updated on: Tuesday, June 04, 2002