Google Map Link - https://goo.
gl/maps/gBlrU Contact - 8130799520
Data Structure & Algorithms Course Content
Course Outline:-
1. Time and Space Complexity
a. Order complexity analysis, Theoretical complexity analysis, Time complexity
analysis of searching and recursive algorithms, Theoretical space complexity,
Space complexity analysis of merge sort
2. Arrays
a. Introduction to arrays, How arrays are stored in memory, Passing arrays to
functions
b. 2D arrays, Storage of 2D arrays, Example problems using 2D Arrays
c. Two Pointers
3. Strings
a. Introduction to strings, storage of strings and their inbuilt functions
4. Divide and Conquer
5. Greedy Algorithms
6. Linked List
a. Introduction to linked list, Inserting node in linked list, Deleting node from linked
list, Midpoint of linked list, Merge two sorted linked lists, merge sort of a linked
list, Reversing a linked list
7. Stack & Queue
a. Introduction to stacks, Stack using arrays, Dynamic Stack class, Stack using linked
list, Inbuilt stack, Queue using arrays, Dynamic queue class, Queue using linked
list, Inbuilt queue
2nd floor, above subway food outlet, main market (Near Om Sweets), Sector 31, Gurgaon.
Google Map Link - https://goo.gl/maps/gBlrU Contact - 8130799520
8. Searching
a. Linear Search
b. Binary Search
c. Hash table
d. Interpolation Search
9. Sorting
a. Bubble sort
b. Insertion sort
c. Heap sort
d. Selection sort
e. Merge Sort
f. Quick sort
g. Shell/Radix sort
10. Graphs
a. DFS
b. BFS
11. Trees - Introduction to Trees, Making a tree node class, Taking a tree as input and
printing, Tree traversals, Destructor for tree node class
a. Tree Traversal
b. Spanning Tree
c. AVL Tree
d. Trie
e. Heap
12. Binary Trees
a. Introduction to Binary Trees, Taking a binary tree as input and printing, Binary
Tree traversals, Diameter of binary tree
13. Binary Search Trees
a. Introduction to Binary Search Trees, Searching a node in BST, BST class, Inserting
and Deleting nodes in BST, Types of balanced BSTs
2nd floor, above subway food outlet, main market (Near Om Sweets), Sector 31, Gurgaon.
Google Map Link - https://goo.gl/maps/gBlrU Contact - 8130799520
14. Priority Queues
a. Introduction to Priority Queues, Ways to implement priority queues,
Introduction to heaps, Introduction to Complete Binary Trees and its
implementation, Insert and Delete operations in heaps, Implementing priority
queues, Heap sort, Inbuilt Priority Queue
15. Tries
a. Introduction to Tries, Making a Trie Node class, Insert, Search and Remove
operation implementation in Tries, Types of Tries, Huffman Coding
16. Graphs
a. Introduction to Graphs, Graph Terminology, Graph implementation, Graph
Traversals (DFS and BFS), Weighted and Directed Graphs, Minimum Spanning
Trees, Cycle Detection in Graphs, Kruskal's algorithm, Prim's Algorithm, Dijkstra's
algorithm
17. Recursion
a. Introduction to recursion, Principle of mathematical induction, Fibonacci
numbers, Recursion using arrays, Recursion using strings, Recursion using 2D
arrays
18. Dynamic Programming
a. Introduction to Memoization, Introduction to Dynamic Programming, Fibonacci
numbers using recursion, memoization and dynamic programming
b. Longest Common Subsequence (LCS) using recursion, memoization and dynamic
programming, Edit distance using recursion, memoization and dynamic
programming, Knapsack problem using recursion, memoization and dynamic
programming
19. Backtracking
20. Hashing/ Hashmaps
2nd floor, above subway food outlet, main market (Near Om Sweets), Sector 31, Gurgaon.
