In this course students will implement and test advanced data structures and algorithms, benchmark performance, analyze algorithmic complexity, explore trade offs in performance and memory usage, and draw out elegant problem-solving techniques.
Key concepts include sorting algorithms, divide-and-conquer recursion, heaps, tries, self-balancing trees, and execution trees. Students will build an original project that applies these data structures to real-world problems such as autocomplete, family trees, and board games.
Students will also write technical articles about these topics to deepen their understanding and create their online presence as knowledgeable and proficient software engineers.
Course Delivery: online | 7 weeks | 14 sessions
Course Credits: 3 units | 37.5 Seat Hours | 75 Total Hours
By the end of this course, students will be able to...
- implement and compare several sorting algorithms and know when to use which ones
- apply divide-and-conquer recursion techniques to elegantly solve complex problems
- analyze complexity of recursive algorithms with recurrence relations and master theorem
- implement abstract data types including priority queues, binary heaps, and tries
- implement self-balancing tree structures including AVL trees, splay trees, and 2-3 trees
- implement tree traversal algorithms: depth-first and breadth-first ordering
- utilize bit manipulation algorithms to store and access information in individual bits
Course Dates: Monday, January 20 – Wednesday, May 12, 2021
Class Times: Monday, Wednesday, Friday at 4:30pm – 6:20pm
| Class | Topics |
|---|---|
| 1 | Iterative Sorting Algorithms |
| 2 | Divide-and-Conquer Recursion |
| 3 | Divide-and-Conquer Recursion |
| 4 | Recursive Sorting Algorithms |
| 5 | Integer Sorting Algorithms |
| 6 | Lab Day |
| 7 | Prefix Trees (aka Tries) |
| 8 | Prefix Trees (aka Tries) II |
| 9 | Rotating Binary Search Trees |
| 10 | Multiple Key Search Trees |
| 11 | Priority Queues & Heaps |
| 12 | Lab Day |
| 13 | Trees Project Presentations |
We will be using Gradescope, which allows us to provide fast and accurate feedback on your work. All assigned work will be submitted through Gradescope, and assignment and exam grades will be returned through Gradescope.
As soon as grades are posted, you will be notified immediately so that you can log in and see your feedback. You may also submit regrade requests if you feel we have made a mistake.
Your Gradescope login is your Make School email, and your password can be changed at https://gradescope.com/reset_password. The same link can be used if you need to set your password for the first time.
To pass this course, students must meet the following requirements:
-
Actively participate in class and abide by the attendance policy
-
No more than two unexcused absences ("no-call-no-shows")
-
No more than four excused absences (communicated in advance)
-
Make up all classwork from all absences
-
Complete the required coding challenges (rubrics provided on assignment pages). You will need to pass with an average score of 2 or higher
- Iterative Sort
- Recursive Sort
- Integer Sort
- Prefix Trees
- Binary Heaps
-
Pass all three conceptual quizzes with a 70% or higher
-
Complete the technical article OR advanced trees project with a 70% or higher
-
If you are not passing any assignment you have a week to fix any errors and resubmit
-
You are allowed to submit assignments after the due date with instructor permission
-
You are allowed to drop one coding challenge or quiz