| 1 |
Written Resources |
Introduction to the stack data structure |
Face-to-Face Instruction |
| 2 |
Written Resources |
Coding the stack data structure in Python |
Face-to-Face Instruction |
| 3 |
Written Resources |
Coding the stack data structure in Python |
Face-to-Face Instruction |
| 4 |
Written Resources |
Coding the stack data structure in Python |
Face-to-Face Instruction |
| 5 |
Written Resources |
Queue, deque, and priority queue data structures |
Face-to-Face Instruction |
| 6 |
Written Resources |
Coding queue, deque, and priority queue data structures in Python |
Face-to-Face Instruction |
| 7 |
Written Resources |
Introduction to the tree data structure |
Face-to-Face Instruction |
| 8 |
Written Resources |
Coding the tree data structure in Python |
Face-to-Face Instruction |
| 9 |
Written Resources |
Binary search trees and coding them in Python |
Face-to-Face Instruction |
| 10 |
- |
MID-TERM EXAM |
- |
| 11 |
Written Resources |
Heap data structure and coding it in Python |
Face-to-Face Instruction |
| 12 |
Written Resources |
Heap structures |
Face-to-Face Instruction |
| 13 |
Written Resources |
Balanced search trees |
Face-to-Face Instruction |
| 14 |
Written Resources |
Introduction to the graph data structure |
Face-to-Face Instruction |
| 15 |
Written Resources |
Coding the graph data structure in Python |
Face-to-Face Instruction |
| 16 |
- |
FINAL EXAM |
- |
| 17 |
- |
FINAL EXAM |
- |