| # | Topic | Lesson |
|---|---|---|
| 1 | Big-O Notation | Web / iOS / Android |
| 2 | Recursion | Web / iOS / Android |
| 3 | Binary Search | Web / iOS / Android |
| 4 | Bubble Sort: Intro to Sorting* | Web / iOS / Android |
| 5 | Merge Sort: Divide & Conquer* | Web / iOS / Android |
| 6 | Quick Sort* | Web / iOS / Android |
| 7 | Abstract Data Structures | Web / iOS / Android |
| 8 | Linked List | Web / iOS / Android |
| 9 | Stacks | Web / iOS / Android |
| 10 | Queues | Web / iOS / Android |
| 11 | Hash Tables | Web / iOS / Android |
| 12 | Trees* | Web / iOS / Android |
| 13 | Graphs* | Web / iOS / Android |
(* needs to be revisited or unfinished)
Data Structures & Algorithms (DSA) are the building blocks that allow programmers to code and think at a higher level. Data structures are unique ways of organising and collecting data so that we can perform operations in an effective way. Algorithms are a set of instructions that solve hard problems in an efficient manner. Understanding DSA is critical for entry level interviews. DSA is usually technology agnostic so it instills a strong computer science mindset.
- Students should be able to build and apply important Data Structures used in the real world.
- Students should be able to design and apply correct Algorithms for programming problems.
- Students should get a basic sense of "abstract data structures" and how the flow of data occurs in applications.
- Students should begin to understand efficiency of code and learn to code beyond the "brute force" route.
- Students should be able to problem solve at a high level during whiteboarding interviews.