Daily Schedule -- Data Structures
Spring 2001
-
January 11
-
Understand syllabus
-
assign Assignment 1, Pentagon Parking
-
Read chapter 4 in the text
-
Start on assignment 2
-
January 16
-
Finish lecture on assignment 2
-
Assignment 2 code is included in documentation example.
-
January 18
-
Assignment 1, Pentagon Parking, due. Worth 5 points
-
Bubble sort covered in lecture.
-
Quiz -- writing a simple program
-
January 23
-
Review of course to this point.
-
January 25
-
Assignment 2, Writing Random Numbers, due
-
Insert sort covered in lecture
-
January 30
-
February 1
-
Assignment 3, Sorting Random Numbers using the bubble sort, due
-
Text file input covered in lecture.
-
February 6
-
Review for first major examination
-
February 8
-
First Major Examination. On review of CSC305, arrays, text files,
bubble sort, insert sort.
-
Assignment 4, Sorting Random Numbers using the insert sort, due
-
February 13
-
C++ header files and implementation files
-
February 15
-
C++ header files continued
-
February 20
-
February 22
-
February 27
-
Implementing a stack class
-
Assignment 5,
-
March 1
-
Review for final examination
-
March 6
-
March 8
-
Assignment 6, A Stack Class, due
-
Mid-Term grades due
-
Review of Mit-Term examination
-
March 20
-
Stack class implementation
-
March 22
-
March 27
-
Stack class continued
-
Post-Fix notation
-
Assignment 7 given
-
March 29
-
Introduction to binary tree
-
April 3
-
Assignment 7 due.
-
Binary tree continued
-
April 5
-
April 10
-
Assignment 8 given
-
Review for Major Examination III
-
April 12
-
Recursion introduced.
-
Major Examination III
-
April 17
-
Introduction to Partitition
-
April 19
-
Quick sort assigned
-
Introduction to Heap
-
April 24
-
April 26
-
May 1
-
Review for final examination
-
May 3
-
Final examination for all students during regular class time.
-
Heap sort due