|
CSci 270: Data Structures |
|
Summer 2005 |


|
Course Schedule |
|
Tentative schedule, links to lecture slides and quizzes/answers will be added as they are covered. |
|
Wk |
Date |
L |
Topic / Activity |
Reading |
|
1 |
Jun 7,9 |
1 |
1.1-1.5 |
|
|
|
|
2 |
|
|
|
|
|
3 |
4.1,4.2, 4.3,4.4 |
|
|
|
|
4
|
2.4 |
|
|
2 |
Jun 14,16 |
1 |
3.4 |
|
|
|
|
2 |
Copy Constructors, overloaded assignment operators, this pointer |
4.5 |
|
|
|
3 |
Review Quiz |
Study Guide:
|
|
|
|
4
|
|
|
|
3 |
Jun 21,23 |
1 |
6.1. 6.2, 6.3 |
|
|
|
|
2 |
6.4 |
|
|
|
|
3 |
6.5 |
|
|
|
|
4 |
11.1 |
|
|
|
Jun 23 |
|
Program #1 “Linked Lists” Due
|
|
|
4 |
Jun 28,30 |
1 |
11.3 |
|
|
|
|
2 |
11.5 |
|
|
|
|
3 |
Exam 1 |
Study Guide: |
|
|
|
4
|
|
|
|
5 |
Jul 5,7 |
1 |
7.1 |
|
|
|
|
2 |
7.2 |
|
|
|
|
3 |
Linked list implementation of stack & applications of stacks |
7.3, 7.4 |
|
|
|
4 |
|
|
|
|
Jul 7 |
|
Program #2 “Stacks” Due
|
|
|
6 |
Jul 12,14 |
1 |
8.1 |
|
|
|
|
2 |
8.2 |
|
|
|
|
3 |
Linked-list implementation, applications to buffers and scheduling |
8.3, 8.4 |
|
|
|
4 |
|
|
|
|
Jul 14 |
|
Program #3 “Queues” Due
|
|
|
7 |
Jul 19,21 |
1 |
Exam 2 |
|
|
|
|
2 |
|
|
|
|
|
3 |
10.1, 10.2 |
|
|
|
|
4 |
10.3 |
|
|
|
Jul 21 |
|
Program #4 “Recursion” Due
|
|
|
8 |
Jul 26,28 |
1 |
Introduction to analysis of algorithms and algorithm efficiency |
10.4 |
|
|
|
2 |
12.1 |
|
|
|
|
3 |
12.2 |
|
|
|
|
4
|
Binary trees as recursive data structures, binary search trees |
12.3, 12.4 |
|
|
Jul 28 |
|
Program #5 “Binary Trees” Due
|
|
|
9 |
Aug 2,4 |
1 |
Exam 3 |
|
|
|
|
2 |
|
|
|
|
|
3 |
Templates and Containers, Function genericity, overloading templates |
9.1, 9.2 |
|
|
|
4 |
Class genericity – class templates |
9.3 |
|
10 |
Aug 9 |
1 |
STL vector container, other standard containers |
9.4, 9.7 |
|
|
|
2
|
Introduction to Hash Tables |
12.7 |
|
|
Aug 11 |
|
Final Exam Jour 104 11:00 am – 12:50 pm |
|