Description
A course specializing in Data Structures & Algorithms with a mix of theory and practice. This course offers you a wealth of programming challenges that you may face at your next job interview. The course focuses mainly on Data Structure & Algorithms.
Course Curriculum
Array
- Programming Fundamentals
- Introduction
- Classification of Data Structures
- Arrays
- Array Access Elements
- Problems
Recursion
- Introduction
- Recursion Types
- Problems
Linked Data
- Introduction
- Pointers
- Linked List
- Doubly Linked List
- Circular Linked List
- Problems
Linked List
- Representation Of Linked List
- Types Of Linked List
- Traversal Operations
- Insertion Operations
- Deletion Operations
- Searching Operations
- Update Operations
- Implementations of Linked List Using Array,Stack
Stack and Queue
- Introduction
- Stack
- Expressions
- Queue
- Circular Queue
- Problems
Trees
- Introduction
- Complete Binary Tree
- Types of Trees
- Binary Tree Traversal
- Expression Tree
- Heap
- Binary Search Tree (BST)
- Problems
Sorting and Searching
- Introduction
- Sorting Algorithms
- Bubble Sort
- Insertion Sort
- Tree Sort
- Selection Sort
- Heap Sort
- Quick Sort
- Merge Sort
- Shell Sort
- Searching Algorithms
- Sequential Searching
- The Indexed Sequential Search
- The Binary Search
- Hashing
- Resolving Collisions
- Hashing Function
- Problems
Graphs
- Introduction
- Graph
- Directed Graph
- Representation of Graphs
- Graph Traversal
- Minimal spanning Tree (MST)
- Problems
Algorthims
- Introduction
- Greedy Algorithms
- Ford-Fulkerson Algorithm
- Dijkstra's Algorithm
- Kruskal's Algorithm
- Prim's Algorithm
- Huffman Code
- Floyd Warshall Algorithm
- Longest Common Subsequence
- Backtracking Algorithm
- Rabin-Karp Algorithm
Advanced Data Structure
- Introduction
- Queue based DSA
- Priority Queue
- Deque
- Linked List based DSA
- Hash Table
- Heap Data Structure
- Fibonacci Heap
- Decrease Key and Delete node from Fibonacci Heap
- Tree based DSA
- B Tree
- Insertion into B-tree
- Deletion from B-tree
- B+ Tree
- Insertion on a B+ Tree
- Deletion from a B+ Tree
- Red Black Tree
- Insertion in Red Black Tree
- Deletion from Red Black Tree
- Graph Data Structure
- Spanning Tree
- Strongly Connected Components
- Adjacency Matrix
- Adjacency List
- DFS Algorithm
- Breadth-first Search
- Bellman Ford's Algorithm
Liked The Curriculum? Join Now.
Structure your learning and get a certificate to prove it.