Online/Offline Data Structures Programming Course at sector 46 C and sector 22 C in Chandigarh.

Data Structures: level-III

• Introduction to Data Structures.
• How to Write Algorithm.
• Types of Data Structures.
• Operations in Data Structures.
• Insertion
• Deletion
• Traversing
• Searching
• Sorting
• Space and Time complexity.
• Big O Notation.
• Big Omega Notation.
• Big theta Notation.
• Best, Average and Worst Case.
• Arrays
• Two Dimensional Array.
• Array of Pointers.
• Insertion
• Traversing
• Deletion
• Searching
• Linear Search
• Binary Search
• Sorting
• Bubble Sort
• Row-major and column-major order.
• Sparse Matrix.
• Linked List
• Dynamic memory allocation.
• What is Linked List?
• Requirement of Linked List.
• Singly Linked List(With all Operations).
• Doubly Linked List(With all Operations).

• Circular Linked List.
• Singly Circular
• Doubly Circular
• Header Linked List.
• Stack
• What is Stack?
• Push Operation in Stack.
• Pop Operation in Stack.
• Peek Operation in Stack.
• Stack by using Array.
• Stack by using Linked List.
• Stack Applications.
• Notations for Arithmetic Expression.
• Converting Infix to Postfix Expression.
• Reverse a string using stack.

• Queue
• Enqueue(Insertion in Queue).
• Dequeue(Deletion in Queue).
• Queue by using Array.
• Queue by using Linked List.
• Circular Queue.
• Applications of Queue.
• Round Robin Algorithm.
• Priority Queue.
• Recursion
• What is Recursion?
• Factorial of a number by Recursion.
• Tower of Hanoi.
• Trees
• Introduction to trees.
• Binary Tree.
• Properties of Binary Search Tree.           
• Types of Binary Tree.
• BST(Binary Search Tree).
• Heap Tree.
• AVL Tree with all Rotations.
• Heap Sort.
• Threaded Binary Tree Theory.
• M-way Tree.
• B Tree.
• B+ Tree.
• Graphs
• Graph Introduction.
• Representation of Graph by using Array and Linked List.
• Insertion of element in Graph.
• Deletion of element in Graph.
• BFS(Breadth First Search Traversal).
• DFS(Depth First Search Traversal).
• Shortest Path Algorithm.
• Spanning Tree.
• Sorting
• Selection Sort.
• Insertion Sort.
• Quick Sort.
• Merge Sort.
• Radix Sort.

• Hashing
• Hash Function.
• Direct Method.
• Division Method.
• Mid Square Method.

Data Structures: Level-II

• Introduction to Data Structures.
• How to Write Algorithm.
• Types of Data Structures.
• Operations in Data Structures.
• Insertion
• Deletions
• Traversing
• Searching
• Sorting
• Space and Time complexity.
• Big O Notation.
• Arrays
• Two Dimensional Array.
• Array of Pointers.
• Insertion
• Traversing
• Deletion
• Searching
• Linear Search
• Binary Search
• Sorting
• Bubble Sort
• Linked List
• Dynamic memory allocation.
• What is Linked List?
• Requirement of Linked List.
• Singly Linked List(With all Operations).
• Doubly Linked List(With all Operations).
• Circular Linked List.
• Singly Circular
• Doubly Circular
• Header Linked List.
• Stack
• What is Stack?
• Push Operation in Stack.
• Pop Operation in Stack.
• Peek Operation in Stack.
• Stack by using Array.
• Stack by using Linked List.
• Stack Applications.
• Notations for Arithmetic Expression.
• Converting Infix to Postfix Expression.
• Reverse a string using stack.

• Queue
• Enqueue(Insertion in Queue).
• Dequeue(Deletion in Queue).
• Queue by using Array.
• Queue by using Linked List.
• Circular Queue.
• Applications of Queue.
• Recursion
• What is Recursion?
• Factorial of a number by Recursion.
• Tower of Hanoi.
• Trees
• Introduction to trees.
• Binary Tree.
• Properties of Binary Search Tree.           
• Types of Binary Tree.
• BST (Binary Search Tree).
• Heap Tree.
• AVL Tree with all Rotations.
• Heap Sort.
• Threaded Binary Tree Theory.
• Graphs
• Graph Introduction.
• Representation of Graph by using Array and Linked List.
• Sorting
• Selection Sort, Insertion Sort, Quick Sort.

Data Structures: level-I

• Introduction to Data Structures.
• How to Write Algorithm?
• Types of Data Structures.
• Operations in Data Structures
• Insertion
• Deletion
• Traversing
• Searching
• Sorting
• Arrays
• Insertion
• Traversing
• Deletion
• Searching
• Linear Search
• Binary Search
• Sorting
• Bubble Sort
• Linked List
• Dynamic memory allocation.
• What is Linked List?
• Requirement of Linked List.
• Singly Linked List(With all operations).
• Doubly Linked List(With all operations).
• Circular Linked List.
• Singly Circular.
• Doubly Circular.
• Stack
• What is Stack?
• Push Operation in Stack.
• Pop Operation in Stack.
• Peek Operation in Stack.
• Stack by using Array.
• Stack by using Linked List.

• Queue
• Enqueue(Insertion in Queue).
• Dequeue(Deletion in Queue).
• Queue by using Array.
• Queue by using Linked List.
• Recursion
• What is Recursion?
• Trees
• Introduction to trees.
• Binary Tree.
• Properties of Binary Search Tree.           
• Types of Binary Tree.
• BST(Binary Search Tree).
• Heap Tree.
• AVL Tree Theory.
• Sorting
• Selection Sort.
• Insertion Sort.