Quartz 4

Data Structures

3 min read

Unit 1 – Foundations of Data Structures (9 hrs)

  1. “Abstract Data Types Are Job Descriptions – The Role Without the Employee” (Abstract Data Type)

  2. “Data Organization Like a Supermarket Layout – Finding Items Fast” (Elementary Data Organization)

  3. “Algorithm Efficiency: The Cheetah vs Tortoise Race for Speed and Stamina” (Time & Space Complexity)

  4. “Asymptotic Notations Explained as Speed Limits – Big-O, Omega, and Theta” (Asymptotic Notations)

  5. “Arrays Are Apartment Buildings – Single & Multidimensional Data Storage” (Single & Multidimensional Arrays)

  6. “Row-Major vs Column-Major Order: Reading a Book Left-to-Right vs Top-to-Bottom” (Representation of Arrays)

  7. “How Arrays Solve Real Problems – Parking Lots, Chessboards, and Calendars” (Applications of Arrays)

Unit 2 – Linear Data Structures (11 hrs)

  1. “Linked Lists Are Treasure Maps – Finding the Next Clue Step by Step” (Singly Linked List)

  2. “Two-Way Streets of Data – Doubly Linked Lists Made Simple” (Doubly Linked List)

  3. “Circular Linked Lists Are Ferris Wheels – Never-Ending Data Cycles” (Circularly Linked List)

  4. “Linked List Surgery – Adding, Removing, and Modifying Nodes” (Operations on Linked List)

  5. “Stacks Are Pancake Stacks – Push, Pop, and No Cheating!” (Stack Basics)

  6. “Stacking Data in Two Kitchens – Array vs Linked List Implementation” (Stack Implementations)

  7. “Stack Magic: Reverse Polish Notation and the Secret Language of Prefix & Postfix” (Prefix/Postfix Expressions)

  8. “Queue Like an Airport Check-in – First Come, First Served” (Queue Basics)

  9. “Array vs Linked Queue – Straight Lines vs Conveyor Belts” (Queue Implementations)

  10. “Circular Queues Are Carousels – Reusing Space Without Moving” (Circular Queue)

Unit 3 – Searching and Sorting (10 hrs)

  1. “Sequential Search: Flipping Through Every Page to Find the Word” (Sequential Search)

  2. “Binary Search: Guess the Number in Minimum Questions” (Binary Search)

  3. “Insertion Sort: Placing New Cards in a Sorted Poker Hand” (Insertion Sort)

  4. “Selection Sort: Finding the Smallest Marble Again and Again” (Selection Sort)

  5. “Bubble Sort: Sinking the Heaviest Balls to the Bottom” (Bubble Sort)

  6. “Quick Sort: Divide and Conquer Like a Master Chef Prepping Ingredients” (Quick Sort)

  7. “Merge Sort: The Wedding Planner – Merging Two Perfectly Sorted Guest Lists” (Merge Sort)

  8. “Hashing: Hotel Room Keys for Instant Access” (Hash Function)

  9. “Hash Tables as Storage Lockers – Assigning a Place for Everything” (Hash Table)

  10. “Avoiding Key Collisions: How Restaurants Handle Double Bookings” (Collision Resolution Strategies)

Unit 4 – Trees and Graph Algorithms (10 hrs)

  1. “Trees Are Family Trees – Roots, Branches, and Leaves of Data” (Basic Terminology)

  2. “Binary Trees: Decision-Making Like a Tournament Bracket” (Binary Trees)

  3. “Planting Trees in Memory – Array vs Linked List Implementations” (Array & Linked Implementations)

  4. “Binary Tree Types Explained as Different Garden Layouts” (Types of Binary Trees)

  5. “Tree Traversals: Touring a Mansion Room-by-Room” (Inorder, Preorder, Postorder)

  6. “Graphs Are City Maps – Understanding Connections and Routes” (Graph Basics)

  7. “Graph Representation: Roadmaps vs Adjacency Lists” (Matrix vs Linked)

  8. “Graph Traversals: BFS as Street Sweepers, DFS as Explorers” (Traversals)

  9. “Shortest Path: GPS Navigation and Finding the Quickest Route” (Shortest Path)

  10. “Minimum Spanning Tree: Building the Cheapest Road Network” (MST Algorithms)

Graph View