Some Ada graduates return to Ada for a 2nd internship. This program is similar to the standard internship students enter as part of the program. As part of their graduate internship, students take a self-directed course of study in data structures & Algorithms. The course material comes from the Massachussets Institute of Technology course Introduction to Algorithms. Students will be expected to complete watch lessons, readings and homework and discuss/review the content with an instructor and other students in the program for 1 hr per week. After completing the curriculum students will begin a program of interview preparation and mentoring.
The goal of the program is to support students who may have struggled entering industry: providing them both strong interview skills to land an initial position, practice learning independently, and a strong foundation in Data Structures and Algorithms which will support their long-term growth as software engineers.
In this program students will:
- Demonstrate confidence and skill in taking interview questions and solve them using advanced data structures.
- Design complicated data structures and use them to solve computer science problems
- Explain how specific data structures work and demonstrate use-cases.
- Select efficient data structure or algorithm to solve programming problems
- Demonstrate an ability to learn material independently and discuss content with others
Week | Content | Assignments Due |
---|---|---|
Week 01 | Introduction | Watch and Review Lectures and Recitation videos 1 & 2. |
Week 02 | Sorting & Trees | Watch and Review Lectures and Recitation videos 3-5. Review Problem set 1 with instructor. |
Week 03 | Sorting & Trees | Watch and Review Lectures and Recitation videos 6-7. Review Problem set 2 with instructor. |
Week 04 | Hashing | Watch and Review Lectures and Recitation videos 8-9. Review Problem set 3 with instructor. |
Week 05 | Hashing | Watch and Review lecture 10. Review problem set 4 with instructor. |
Week 06 | Numerics | Watch and Review Lectures and Recitation videos 11-12. Take and discuss Quiz 1 with instructor. |
Week 07 | Graphs | Watch and Review Lectures and Recitation videos 13-14. Review Problem set 5 with instructor. |
Week 08 | Break Week | |
Week 09 | Shortest Paths | Watch and Review Lectures and Recitation videos 15-16. Discuss lessons with Instructor |
Week 10 | Shortest Paths | Watch and Review Lectures and Recitation videos 17-18. Review problem set 6 with instructor. |
Week 11 | Shortest Paths | Take Quiz 2 with Instructor & Review Difficult topics |
Week 12 | Dynamic Programming | Watch and Review Lectures and Recitation videos 19-20. |
Week 13 | Dynamic Programming | Watch and Review Lectures and Recitation videos 20-21. Review Problem Set 7 Take Final Exam with Instructor |
Week 14 | Interview Preparation | Select 3 Whiteboarding problems and be interviewed with one by the instructor. |
Week 15 | Mock Interviews | Take a mock interview with a hiring manager. |
Week 16 | Interview Support | |
Week 17 | Interview Support | |
Week 18 | Interview Support |
Students will be expected to:
- Obtain Introduction to Algorithms, Third Edition
- Install Python 3 via Homebrew for use on homework
- Optionally Obtain Problem Solving with Algorithms and Data Structures using Python 2nd edition