Course Overview
- ›Memory addresses and references
- ›Pointer declaration and initialization
- ›Pointer arithmetic
- ›Pointer to pointer (double pointers)
- ›Array of pointers
- ›Stack memory characteristics
- ›Automatic allocation and deallocation
- ›Scope and lifetime of variables
- ›Limitations of static memory
- ›Heap memory management
- ›Memory allocation functions (malloc, calloc, realloc)
- ›new and delete operators
- ›Memory leak prevention
- ›Memory fragmentation
- ›Base case and recursive case
- ›Call stack understanding
- ›Direct vs indirect recursion
- ›Backtracking
- ›Divide and conquer
- ›Quick sort
- ›Merge sort
- ›Singly Linked list
- ›Doubly Linked list
- ›Circular Linked list
- ›Binary heap properties
- ›Min heap and max heap
- ›Heap operations
- ›Priority queues
- ›Heap sort
- ›K-way merging
- ›Median maintenance
- ›Top K elements problems
- ›Tree terminology
- ›Binary tree properties
- ›Types of binary trees
- ›Depth First Search (DFS)
- ›Breadth First Search (BFS)
- ›Morris traversal
- ›BST properties
- ›Insertion and deletion
- ›Searching and traversal
- ›Balancing techniques
- ›Graph representation
- ›Adjacency matrix
- ›Adjacency list
- ›Directed/Undirected
- ›Weighted/Unweighted
- ›Connected/Disconnected
- ›Depth First Search (DFS)
- ›Breadth First Search (BFS)
- ›Topological sorting
- ›Strongly Connected Components
- ›Concept of Dynamic Programming
- ›Implementaion
- ›Real world Scenario
What we'll cover in this course:
- Pointers Fundamental
- Static Memory Allocation
- Dynamic Memory Allocation
- Recursion
- Advanced Sorting Algorithms
- Linked List
- Heap
- Heap Advance Applications
- Binary Trees
- Tree Traversals
- Binary Search Trees(BST)
- Graphs
- Graph Traversals
- Dynamic Programming
Technologies & Tools
VS Code
C Programming
C++
