18 notes in this chapter

Data Structures and Algorithms Terms MOC

Comprehensive guide to foundational data structures, algorithmic paradigms, complexity analysis, and graph theory.

Foundations & Complexity

• Big-O Notation
• Recursion

Linear Data Structures

• Array and Dynamic Array
• Linked List
• Stack and Queue

Hash & Tree Structures

• Hash Table
• Binary Search Tree (BST)
• AVL Tree and Red-Black Tree
• Priority Queue and Heap
• Trie

Graphs & Algorithms

• Graph Representation
• Breadth-First Search (BFS)
• Depth-First Search (DFS)
• Dijkstra Algorithm
• Disjoint Set Union (DSU)

Algorithms & Paradigms

• Sorting Algorithms
• Binary Search
• Dynamic Programming

---

How to use this

Use this MOC as a roadmap for coding interview preparation, performance profiling, and core computer science fundamentals.

Suggested order if starting from zero

1. Big-O Notation → Array and Dynamic Array → Linked List → Stack and Queue
2. Hash Table → Binary Search Tree (BST) → Priority Queue and Heap
3. Recursion → Binary Search → Sorting Algorithms
4. Graph Representation → Breadth-First Search (BFS) → Depth-First Search (DFS) → Dijkstra Algorithm
5. Dynamic Programming → Trie → Disjoint Set Union (DSU)