Course Information
Professor:
Email Address:
Office Location:
Strain 201
CS300
Data Structures
Data structures are fundamental to advanced, efficient programming. Topics including asymptotic analysis, stacks, queues, linked lists, trees, and hash tables will be covered in discussions centering around more sophisticated programming concepts, problem solving techniques, and software reusability. Prerequisite: CS 250 with a minimum grade of C. 4 credits.
Data structures are fundamental to advanced, efficient programming. Topics including asymptotic analysis, stacks, queues, linked lists, trees, and hash tables will be covered in discussions centering around more sophisticated programming concepts, problem solving techniques, and software reusability. Prerequisite: CS 250 with a minimum grade of C. 4 credits.
Schedule:
|
|
|
|
|
|
| Week 1 |
Aug 25 |
Syllabus Linux Intro (In CS Lab) |
Syllabus 01 Linux V - Linux I |
|
| Aug 27 |
Intro to C |
Assign
#1 |
02 C Intro |
|
| Aug 29 |
03 Eclipse V - MakeI V - MakeII |
|||
| Week 2 |
Sept 1 |
Labor Day - No Class |
||
| Sept 3 |
Review Linux /
Assign 1 |
|||
| Sept 5 |
Abstract Datatypes | 04 ADTs | ||
| Week 3 |
Sept 8 |
Stack ADT |
Assign
#2 |
05 Stack |
| Sept 10 | Assign #2
questions Finish Stack ADT |
|||
| Sept 12 | Dynamic Memory | 06 Dynamic | ||
| Week 4 |
Sept 15 |
Finish Dynamic Memory |
||
| Sept 17 |
Subversion (in CS Lab) |
Assign
#3 |
07
Subversion |
|
| Sept 19 |
Midterm 1 |
Review |
||
| Week 5 |
Sept 22 | List ADT,
pointers, handles |
08 List ADT |
|
| Sept 24 | Valgrind Lab |
09
Valgrind |
||
| Sept 26 |
Assign
#4 list.h Error Codes |
|||
| Week 6 |
Sept 29 |
Complexity Analysis |
10
Complexity |
|
| Oct 1 |
Finish Complexity |
|||
| Oct 3 |
Fall Break - No Class |
|||
| Week 7 |
Oct 6 | Queue ADT | 11 Queue | |
| Oct 8 | Quiz1 & Go
over |
|||
| Oct 10 | Singly Linked Queue |
Assign #5 |
||
| Week 8 |
Oct 13 | Singly Linked Circular Queue |
||
| Oct 15 |
Review (In CS Lab) DynamicLinkLab |
|||
| Oct 17 |
Midterm 2 |
Review |
||
| Week 9 |
Oct 20 | Intro to Trees |
12 Trees |
|
| Oct 22 | Assign
#6 |
|||
| Oct 24 | BST Lab #1
check out CS300BinarySearchTree |
|||
| Week 10 | Oct 27 |
BST Lab #2 check out
CS300BinarySearchTreeII |
||
| Oct 30 |
Quiz2 & Go over BST Lab #3 |
Recursive
Problems |
||
| Oct 31 |
Finish BST Lab #4 |
|||
| Week 11 | Nov 3 | Generic
Programming |
13
Generic |
|
| Nov 5 |
Generic
Programming Lab with Arrays |
Assign #7 |
||
| Nov 7 |
AVL Trees | 14 AVL I 14 AVL II |
||
| Week 12 | Nov 10 | Finish AVL |
||
| Nov 12 | Review for Exam Lab added Generic Linked List |
|||
| Nov 14 | Midterm 3 |
Review |
||
| Week 13 | Nov 17 |
Hash Tables |
15 Hash
Tables |
|
| Nov 19 |
||||
| Nov 21 | ||||
| Week 14 | Nov 24 | |||
| Nov 26 |
Thanksgiving - No Class |
|||
| Nov 28 |
Thanksgiving - No Class | |||
| Dec 1 | ||||
| Dec 3 |
Reading Day |
|||
| Dec
9 |
Final
Exam 3-5:30pm |
Review |