Duration : 2-3 Month*
Eligibility : 10 + 2

Course Objective: To make our trainee expert in the following topics theoretically & practically.

  • Algorithms
  • Asymptotic Analysis
  • Greedy Algorithms
  • Divide & Conquer
  • Dynamic Programming
  • Data Structure
  • Array Data Structure
  • Linked List
  • Doubly Linked List
  • Circular Linked List
  • Stack
  • Expression Parsing
  • Queue
  • Linear Search
  • Binary Search
  • Interpolation Search
  • Hash Table
  • Sorting Algorithms
  • Bubble Sort
  • Insertion Sort
  • Selection Sort
  • Merge Sort
  • Shell Sort
  • Quick Sort
  • Graph Data Structure
  • Depth First Traversal
  • Breadth First Traversal
  • Tree Data Structure
  • Tree Traversal
  • Binary Search Tree
  • AVL Tree
  • Spanning Tree
  • Heap
  • Recursion
  • Tower of Hanoi

Note- We train our trainee until they are satisfied.