Course Duration in Hours
180
180
Advance Coding, Data Structure, Algorithm design, Problem solving skills
Array 1D/2D
Understanding Pointers
Data structures
Strings
Parameters passing to function
Iteration in Nested Loops
Dynamic allocation of memory
Iteration & Recursion
Stack
Queue
Linked List
Tree
Binary Tree/ BST
B-tree
AVL Tree/Balanced Binary Tree
Suffix Tree/ String Matching DS & Techniques
Priority Queues/ Heap
Hash Tables
Graphs
Understanding complexity(time/space) of an algorithm/program
Big O notation
Brute Force Approach
Backtracking/ Recursion
Sorting Techniques:
Selection Sort
Bubble Sort
Insertion Sort
Heap Sort
Quick Sort
Merge Sort
Counting Sort
Radix Sort/ Bucket Sort
Shell Sort
External Sort
Searching Techniques
Selection Algorithms(like find median)
Analyse amortized cost of algorithms
Augmenting Data Structures
Complexity Classes
BIT Manipulation
Algorithmic Techniques:
Divide & Conquer approach
Branch & Bound
Greedy Algorithms
Dynamic Programming
B.Tech CS/IT/ECE
IT Bodhi, Aghapur (Noida),Noida,IN