CS 367 - Introduction to Data Structures - Section 3

Notes

9/2 Course introduction & overview
- introductory notes on abstract data types (courtesy of Susan Horwitz)
- introductory notes on bags
9/4 Preconditions and postconditions
- postscript slides from Main & Savitch
- a little more on preconditions and postconditions
9/9, 9/11 Bags in C++
- postscript slides from Main & Savitch
- further class notes
9/11 - 9/18 Complexity, big-oh, searching, and sorting
- computational complexity
- O notation
- introduction to searching and sorting (courtesy of Susan Horwitz)
- bag equality
9/18 - 9/25, 10/7 Lists
- introduction to lists
- list cursors
- linked lists
10/9, 10/16 Dynamic memory issues in C++
- Destructors and delete
- Copy constructors and assignment overloading
10/16 Function templates
10/21 Class templates
10/21, 10/23 Stacks
10/28 Queues
10/30
- A quick review of O-notation and what it means
- Priority queues
- Iterators
11/4
- Function pointers
- Recursion review
11/6 Introduction to trees
11/11
- tree traversals
- binary search trees
11/13
- binary search trees, continued
- heaps
11/18, 11/20
- inheritance
- red-black trees
11/25, 12/2
- graphs
- supplemental notes on graphs (courtesy of Susan Horwitz )
12/2, 12/4 Hashing
12/9 Sorting
12/11 Sorting continued
Supplemental notes on stacks and queues (courtesy of Susan Horwitz )
Introductory notes on recursion and recursive functions (courtesy of Susan Horwitz )
Notes on AVL trees (based on notes prepared by Marvin Solomon)