C.S.300
Data Structures
Fall 2009

Assignment
 Date assigned
 Date due
 Points
 Datafiles
IOwithFunctions
 Tues, 9/1/09
 Tues, 9/8/09
 15
 None
3n+1 (w/Note 2 modified)
 Tues, 9/8/09
 Tues, 9/15/09
 15
 Not provided
Static List ADT Implementation
 Tues, 9/22/09
 Tues, 10/6/09
 50
 list.h in CS300Public on zeus
New Version SAT 10/3/09
Infix to Postfix
 Thurs, 10/8/09
 Tues, 10/20/09
 50
 list.h version 3 10/9/09
staticlistdriver.c
Dynamic List ADT Implementation
 Tues, 10/27/09
 Tues, 11/10/09
 50 (75)
 list.h version 4.0 10/27/09
Binary Tree ADT Design
 Tues, 11/10/09
 Thurs, 11/12/09
 10
Morse Code (Part I)
Morse Code (Part II
 Thurs, 11/12/09
Thurs, 11/19/09
 Thurs, 11/19/09
Tues, 11/24/09
 75
 binarytree.h in CS300
morsecode.txt in CS300
Word Count
 Tues, 11/24/09
 Tues, 12/8/09
 75
 gettysburg.txt and constitution.txt
in CS300Public on zeus 11/4/09
 
Week #1 (8/31 - 9/4 )
--- Course Syllabus
--- Official Time
--- Web References: Linux Commands, UNIX Basics, Makefiles
--- Lecture Notes: Introduction to Eclipse
--- Import Eclipse Preferences: CS300PrefsF09
--- Lecture Notes: Rational Example w/makefiles
--- Lecture Notes: Coding Standards (coding.C.v6.pdf)
Week #2 (9/7 - 9/11 )
--- September 7, 2009 Labor Day (No Classes)
--- Lecture Notes: Submit Script
--- Lecture Notes: Subversion
--- Web References: Eclipse , Subversion, Valgrind
--- Lecture Notes: Abstract Data Types
Week #3 (9/14 - 9/18 )
--- Lecture Notes: Basic Complexity Concepts I
--- Lecture Notes: Basic Complexity Concepts II
Week #4 (9/21 - 9/25 )
--- Web References: Array Mapping Functions
--- Lecture Notes: Array ADTs
--- Lecture Notes: List ADT
Week #5 (9/28 - 10/2)
--- Lecture Notes: Reviewed for Exam
--- Exam#1 Thursday, October 1, 2009
Week #6 (10/5 - 10/9 )
--- Lecture Notes: Stack ADT
--- Lecture Notes: Go over assignment, union, expressions (infix, prefix, postfix)
--- Web References: Stacks
--- October 9, 2009 (No A&S classes)
Week #7 (10/12 - 10/16 )
--- Lecture Notes: Dynamic Memory
--- In Class: Implement Dynamic Stack
--- Lecture Notes: Queue ADT
Week #8 (10/19 - 10/23 )
--- In Class: Implement Dynamic Queue
--- In Class: Implement Circular Stack & Queue
Week #9 (10/26 - 10/30 )
--- In Class: Discuss Dynamic List ADT & Implementation
Week #10 (11/2 - 11/6 )
--- In Class: Discuss Dynamic List ADT & Implementation
--- Web References:Binary Trees
 --- Lecture Notes: Tree Intro
--- Exam#2 Thursday, November 5, 2009
Week #11 (11/9 - 11/13 )
--- Web References: Binary Search Trees
--- Lecture Notes:  Binary Search Tree
--- In Class: Discuss Binary Tree ADT & Assignment Implementation
Week #12 (11/16 - 11/20 )
--- In Class: Finish BST including delete
--- Web References: Hash Tables
--- Lecture Notes: Hash TablesI
--- Lecture Notes: Hash TablesII
--- Lecture Notes: Generic Programming in C
Week #13 (11/23 - 11/27 )
--- November 25-29, 2009 (Thanksgiving Break - No A&S classes)
Week #14 (11/30 - 12/4 )
 --- Web References: AVL Trees
Week #15 (12/7 - 12/11 )
 --- Lecture Notes: Threaded Binary Trees