Course Duration in Hours
72
72
structure & language concepts
Array 1D/2D
Strings
Structure in C
Pointers in C
Parameters passing to function
Iteration in Nested Loops
Dynamic allocation of memory
Iteration & Recursion
Stack
Queue
Linked List
Tree
Introduction to Binary Tree/ BST
Introduction to Hash Tables
Introduction to 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)
Complexity Classes
BIT Manipulation
Algorithmic Techniques:
Divide & Conquer approach
Branch & Bound
Introduction to Greedy Algorithms
Introduction to Dynamic Programming
Permutation & Combination
Probability
Logical Puzzles
Understanding execution of recursive functions
OOOPs concepts
Improving time & space complexity
How to effectively handle:
Corner Cases
Invalid Inputs
Recursion Termination Conditions
Logical Errors
Test Cases
B.Tech CS/IT/ECE
MCA/BCA
IT Bodhi, Aghapur (Noida),Noida,IN