Data Structures
About the Course
- MWF 12:00-12:50 in Lecture Center A A002
- Final Exam: Tues December 8, 8:00-10:00 AM
- Syllabus
- Office hours: Wed 3-3:50, Friday 11-11:50, SEO 630
- Useful links:
Projects
Exams
Course Outline
- Day 1 - Aug 24: Introduction and course overview
- Day 2 - Aug 26: Abstract Data Types
- Day 3 - Aug 28: execution time
- Day 4 - Aug 31: amortized cost
- Day 5 - Sep 2: C++ basics
- Day 6 - Sep 4: More C++
- Day 7 - Sep 9: FIFO Queues and Deques
- Day 8 - Sep 11: Deques
- Day 9 - Sep 14: Deques continued
- Day 10 - Sep 16: C++ Memory Management
- Day 11 - Sep 18: More C++ memory management
- Day 12 - Sep 21: rootish array stacks
- Day 13 - Sep 23: rootish array stacks, linked lists
- Day 14 - Sep 25: templates, linked list implementation
- Day 15 - Sep 28: doubly linked lists
- Day 16 - Sep 30: space efficient linked lists
- Day 17 - Oct 2: space efficient linked lists, part 2.
- Day 18 - Oct 7: iterating a list
- Day 19 - Oct 9: deallocating memory in space efficient linked list, weak_ptrs
- Day 20 - Oct 12: skiplists
- Day 21 - Oct 14: Exam 1
- Day 22 - Oct 16: skiplists
- Day 23 - Oct 19: skiplistlists
- Day 24 - Oct 21: treaps
- Day 25 - Oct 23: treaps, continued
- Day 26 - Oct 26: treap add and remove
- Day 27 - Oct 28: treap remove
- Day 28 - Oct 30: treap iteration
- Day 29 - Nov 2: tagged unions and sum types
- Day 30 - Nov 4: treap union
- Day 31 - Nov 6: treap intersection, difference
- Day 32 - Nov 9: start red-black trees
- Day 33 - Nov 11: Exam 2
- Day 34 - Nov 16: red-black insert
- Day 35 - Nov 18: continue red-black insert
- Day 36 - Nov 20: finish red-black insert, start on remove
- Day 37 - Nov 23: red-black remove
- Day 38 - Nov 25: last day of red-black remove
- Day 39 - Nov 30: data structures for disks
- Day 40 - Dec 2: B-trees