Course curriculum

  • 1

    Unit 1 - Hashing

    • Key to address translation techniques

    • Collision resolution techniques

  • 2

    Unit 2 - Graphs

    • Adjecency Matrix and List

    • Breadth First Search (BFS)

    • Depth First Search (DFS)

    • Minimum Spanning Tree (MST) - Prims and Kruskal algorithms

    • Floyd Warshall Algorithm

    • Dijiktras Algorithm

    • Topological Sort
  • 3

    Unit 3 - Trees

    • Tree Traversing Techniques

    • Preorder - recursive

    • Preorder - Non recursive

    • Inorder and Postorder

    • Tree creation using infix,prefix,postfix Expressions

    • Binary Search Tree

    • Expression Tree

    • Threaded binary tree 1

    • Threaded binary tree 2
  • 4

    Unit 4 - Search Trees

    • OBST prerequisites

    • OBST examples

    • AVL tree 1

    • AVL tree 2

    • Heap Data Structure

Features

  • Prerequisite Course Available for FREE

  • Immediate Support is available for doubt clearing on Discussion Section

  • The interactive nature of the tutorials makes it a popular choice among students.

  • The instructors provide tips and tricks to help you adopt best coding practices

Other Courses

  • ₹400.00

    ₹400.00Data Structures and Algorithms - Insem Course

    Buy Now