|
My UW
|
UW Search
Computer Science Home Page
> cs367-3
CS367-3 Home Page
Contact
Information
Texts, Tutorials,
Java Documentation
Schedule of Topics
& Course Notes
Assignments
Exams
Grading
Course Mechanics
|
 |
|
|
CS 367:
Introduction to Data Structures
Tues. & Thurs. 1:00-2:15pm, 1221 CS
Schedule of Topics & Notes
Class notes, authored by Prof. Susan Horwitz, are linked to each
topic below.
Lecture notes are also posted, together with the dates posted.
| Topic
| Approx Number
of Classes
| | Overview
| 1
| | Introduction:
Abstract Data Types
| 1
| |
(lec 2,
1/20)
| | Lists (1/25)
(array implementation),
Exceptions
| 2
| |
(lec 3,
1/25;
lec 4, 2/16)
| | Program complexity
analysis
| 2
| |
(lec 5,
2/16;
lec 6, 2/16)
| | Lists:
linked-list implementation; Testing
| 3
| |
(lec 7,
2/16;
lec 8,
2/16;
lec 9,
2/16)
| | Stacks and
Queues
| 2
| |
(lec 10,
3/1;
lec 13,
3/1)
| | Recursion
| 2
| |
(lec 14,
3/8;
lec 15,
3/8)
| | Searching
(binary search)
| 1
| |
(lec 16,
3/15)
| | Trees,
binary search trees,
balanced trees
| 4
| |
(lec 17,
5/3;
lec 18,
5/3;
lec 19,
5/3)
| | Heaps and Priority queues
| 1
| |
(lec 24,
5/3)
| | Hashing
| 2
| | Graphs
| 2
| |
(lec 27,
5/3;
(lec 28,
5/3)
| | Sorting
| 2
| |
(lec 29,
5/4)
|
|
|
|
