Data Structures & Algorithms Bootcamp
Beginner-friendly, project-driven roadmap that takes you from "Hello World" to writing performant graph algorithms.
Beginner Level
Introduction to Programming & Computers
- What is Programming?
- How Computers Work
- Programming Languages
- Setting-up an IDE
- Compilers vs Interpreters
Mini-Project: "Hello World" program
Basic Programming Concepts
- Variables & Data Types
- Operators
- Input / Output
- Control-Flow
- Loops
Mini-Project: Simple Calculator
Introduction to Algorithms
- What is an Algorithm?
- Algorithm Steps
- Pseudocode & Flowcharts
- Time-Complexity (Big-O)
Mini-Project: "Guess the Number" game
Arrays & Lists
- 1-D & 2-D Arrays
- Searching / Sorting
- Insertion & Deletion
- Intro to Linked-Lists
Mini-Project: Array manipulation utility
Intermediate Level
Searching & Sorting Algorithms
- Linear vs Binary Search
- Bubble / Selection / Insertion Sort
- MergeSort & QuickSort
Mini-Project: Sorting visualiser
Stacks & Queues
- LIFO vs FIFO
- Array & Linked-List impl
- Real-world use-cases
Mini-Project: Stack-based expression evaluator
Recursion
- Base / Recursive case
- Factorial & Fibonacci
- Recursion vs Iteration
Mini-Project: Recursive number printer
Linked Lists
- Singly / Doubly / Circular
- Insertion, Deletion, Traversal
- Reverse a Linked-List
Mini-Project: Student-list manager
Advanced Level
Trees & Graphs
- Binary Trees & Traversals
- Binary Search Trees
- Graphs & Types
- BFS / DFS
Mini-Project: BST CRUD app
Dynamic Programming
- DP philosophy
- Memoisation vs Tabulation
- Fibonacci / Knapsack
Mini-Project: DP Fibonacci series
Greedy Algorithms
- Greedy paradigm
- Coin-Change
- Fractional Knapsack
Mini-Project: Coin-change solver
Graph Algorithms
- Dijkstra & Bellman-Ford
- Minimum Spanning Tree
- Topological Sort
Mini-Project: Dijkstra path-finder
Start Your DSA Journey Today
Fill out the form below to enquire about our Data Structures & Algorithms course or chat directly with a course advisor