Data Structure Training

At Magento Guru, we believe in providing a full-fledged Data Structure Training in delhi of your desire where our industry experts have designed a top-notch curriculum just for you.

This Course main objective for the student to understand Analysis and Designing of the Algorithms and how the different data structures are used for efficient accessing of the data and Manipulation of the data at the end of the session we can able to Know different Kinds of data structures and we can able to provide different algorithms for time and space complexity.

 

Performance Analysis

  • Time complexity
  • Space complexity

Asymptotic Notations-

  • Big O
  • Omega
  • Theta notations

 

Structures

Pointers

Dynamic Memory allocation

  • Malloc()
  • calloc()
  • realloc()
  • free()
    • Stack Operations
    • push()
    • pop()
    • peex()
    • distzay()
    • isEmpty()
    • isFull()
    • Stack implementation using arrays
    • Applications
      • Decimal to Binary
      • String reverse
      • Number reverse
      • Recursion – Towers of Hanoi
      • Balanced Parentheses
      • Expressions
    • Introduction to Notations
    • Importance of Notations in expression evaluation
    • Conversion Algorithms
    • Infix to prefix
    • Infix to postfix
    • Prefix to infix
    • Prefix to postfix
    • Postfix to infix
    • Postfix to prefix
    • Implementation of all the conversions
  • Operations on Queue – enqueue(), dequeue()
  • Queue implementation using static arrays
  • Applications
  • Queues Implementations using pointer (dynamic)
  • Single linked list

    • Introduction
    • Construction
    • Length
    • Insertion
    • Deletion
    • Sort
    • Reverse list
    • Swap node data
    • Swap nodes
    • Applications

    Stack implementation using linked list

    Queue implementation using linked list

    Doubly linked list

    Circular linked list

    Circular Doubly Linked List

    • Terminology
    • Differences between Tree and Binary Tree
    • Binary Tree Representations
    • Expression Trees
    • Traversals
    • In-order
    • pre-order
    • post-orde
  • Introduction to BST
  • Insertion
  • Deletion
  • Search
  • Implementation
    • Introduction & Terminology
    • Graph Representations
    • Traversal
    • BFS (Breadth First Search)
    • DFS (Depth First Search)
  • Linear search
  • Binary search
  • Bubble sort
  • Selection sort
  • Insertion sort
  • Heap sort
  • Merge sort
  • Quick sort
    • Introduction
    • BST v/s AVL
    • Rotations
    • L-L-Rotation
    • R-R-Rotation
    • L-R-Rotation
    • R-L-Rotation
    • Insertion
    • Deletion
    • Traversal

           Introduction

    • BST v/s AVL v/s RBT
    • Rotations
  • M-way Search Tree
  • Search
  • Insertion
  • Deletion
  • Hash Table representation
  • Hash function-Division Method
  • Collision
  • Collision Resolution Techniques
  • Separate Chaining
  • open addressing
  • linear probing
  • quadratic probing
  • double hashing
  • Rehashing
  • Operations-Insertion, Deletion,
  • Definition
  • Max Heap
  • Min Heap
  • Insertion and deletion
  • Brute force
  • Boyer –Moore algorithm
  • Knuth-Morris-Pratt algorithm
  • Standard Tries
  • Compressed Tries
  • Suffix tries