| No. |
Topics (if there is sufficient time) |
Related text book chapters from "Data Structures and Algorithms in Java" by
Adam Drozdek |
| 1 |
Introduction: [Acrobat]
[PowerPoint]
- Course administration
- Introduction to data structures and algorithms
- Asymptotic notation
- Algorithm analysis
|
Chapter 2 (algorithm
analysis), Chapter 5 (recursion) |
| 2 |
Searching and Sorting: [Acrobat]
[PowerPoint]
- Linear search
- Binary search
- Interpolation search
- Bubble sort
- Insertion sort
- Selection sort
- Merge sort
- Quick sort
|
Section 9.1 - 9.3.1,
9.3.3 - 9.3.4 |
| 3 |
Arrays and linked lists: [Acrobat]
[PowerPoint]
- Singly and doubly linked lists
- Circular lists
- Sparse tables
|
Chapter 3 |
| 5 |
Stacks and queues: [Acrobat]
[PowerPoint]
- Array and linked list implementations
|
Chapter 4 |
| 6 |
Binary trees:
[Acrobat] [PowerPoint]
- Building a tree
- Tree traversals
- Additions and deletions
- Degeneration
|
Section 6.1 - 6.6 |
| 7 |
Balanced trees: [Acrobat]
[PowerPoint]
- AVL trees
- B-trees
- Degeneration
|
Section 6.7 (AVL Trees),
Chapter 7 (B-Trees) |
| 8 |
Heaps: [Acrobat]
[PowerPoint]
- Heaps as priority queues
- The heap sort
|
Section 6.9 (Heaps), 9.3.2
(Heap sort) |
| 9 |
Graphs:
|
Chapter 8 |
| 10 |
Hashing: [Acrobat]
[PowerPoint]
- Hash functions
- Collision resolution techniques
|
Chapter 10 |