Data Structures And Algorithms

Data Structures and Algorithms course is offered by IIP Academy. Most essential part of our training is that our student works on live project so that they get professional environment of learning.

Content:

• Session 1 : Data Structure And Algorithms
• Data V/S Information
• Characteristics Of Algorithms
• Algorithm V/S Pseudo Code
• Time V/S Space Complexity
• Asymptotic Notations
• Session 2 : Array
• Sparse Matrices
• Multidimensional Array
• Row Major & Column Major Form Of Arrays
• Compute Address Of Elements Of N Dimensional Array
• Session 3 : Linked List
• Singly Linked List
• Doubly Linked Lists
• Circular Linked List
• Traversing , Insertion And Deletion Operation
• Polynomial Representation Using Linked Lists
• Session 4 : Stack
• Array Implementation
• Linked List Implementation
• Infix To Postfix Transformation
• Evaluating Arithmetic Expressions
• Tower Of Hanoi
• Session 5 : Queue
• Array Representation
• Linked List Representation
• Linear Queue V/S Circular Queue
• DeQueue
• Priority Queue
• Session 6 : Tree
• Non-Linear Structures
• Tree Terminology
• Binary Tree V/S Binary Search Tree
• Types Of Binary Tree
• AVL Tree
• B Tree
• B+ Tree
• Session 7 : Graph
• Difference Between Tree And Graph
• Sequential And Linked List Representation Of Graph
• BFS And DFS Algorithm
• Spanning Tree
• Dijkstra's Shortest Path Algorithm
• Session 8 : Searching
• Linear Search
• Binary Search
• Session 9 : Sorting
• Bubble Sort
• Heap Sort
• Insertion Sort
• Merge Sort
• Quick Sort
• Radix Sort
• Selection Sort
• Shell Sort
• Session 10 : Hashing
• What Is Hash Function?
• Types Of Hash Function
• Collision Resolution Technique
• Linear Probing
• Quadratic Probing
• Double Hashing