DSA 101 Beginner
Data Structures & Algorithms Foundations A complete beginner-friendly foundations course: what DSA is, arrays (with sorting & searching), linked lists, stacks, queues, hashing, trees, graphs, how to choose the right structure, and a wrap-up with project ideas. Every module follows the same flow: Kern's intro note, plain-English theory with diagrams, an MCQ quiz (60% passes), and practice problems with worked solutions. Code examples switch between Python and C++.
8 weeks 2,847 students 10 modules · 49 topics ★ 4.9 KERNAL Platform
Syllabus 01 What Is DSA? What data structures and algorithms are, where they hide in the apps you use, and how we'll judge whether a program is fast enough. 5 topics 02 Arrays Storing items in a numbered row: instant reads, costly middle inserts, and the sorting and searching that follow from that rule. 7 topics 03 Linked Lists Trading instant access for easy rewiring: nodes, pointers, and the moves that make front edits fast. 5 topics 04 Stacks One rule — last in, first out — and the undo, bracket checking and recursion it powers. 5 topics 05 Queues Two ends and arrival order: from print jobs and chat messages to the queue that powers breadth-first search. 5 topics 06 Hashing Turning keys into addresses so lookup skips searching entirely — and handling the collisions that come with it. 5 topics 07 Trees Hierarchy with a search built in: nodes, traversals, and the balance that buys speed. 6 topics 08 Graphs The general case: any two things connected. How to store it, and the queue/stack walks that explore it. 5 topics 09 Choosing the Right Structure The skill itself: name the operation, pick the tool, and sanity-check the growth rate. 3 topics 10 Wrap-Up & What's Next The map again, one page — then the shortest honest guide to what to learn and build next. 3 topics