Sale!

Data Structure using C Programming

 2,499.00

  • USD: 33.36$

Learn C programming, considered as the base for other programming languages. C is extremely popular, simple and flexible. It is machine-independent, structured programming language which is used extensively in various applications. 

Data Structure using C Programming Language: This course covers Data Structure Programming techniques 

Learning mode: Instruct led online training

Duration:  4 Month

Fee: INR 3999/- Per Month

Offer Price: INR 2499/- Per Month

Who will conduct the training?

  • Well Experienced trainer having more than 20 years of Experience.
  • Conducted trainings for major corporate giants 

Course Content:

  • Installing IDE
    DS Basics
     DS Introduction
     DS Algorithm
     Ds Asymptotic Analysis
     DS Pointer
     DS Structure
    DS Array
     Array
     2D Array
    —————————–
    DS Linked List
     Linked List
     Insertion at beginning
     Insertion at end
     Insertion after specified node
     Deletion at beginning
     Deletion at end
     Deletion after specified node
     Traversing
     Searching
     Doubly Linked List
     Insertion at beginning
     Insertion at end
     Insertion after specified node
     Deletion at beginning
     Deletion at end
     Deletion of node having given data
     Traversing
     Searching
     Circular Linked List
     Insertion at beginning
     Insertion at end
     Deletion at beginning
     Deletion at the end
     Traversing
     Searching
     Circular Doubly List
     Insertion at beginning
     Insertion at end
     Deletion at beginning
     Deletion at the end
    ———————————
    DS Stack
     DS Stack
     Array Implementation
     Linked List Implementation
    DS Queue
     DS Queue
     Array Implementation
     Linked List Implementation
     Circular Queue
    ———————————–
    DS Tree
     Tree
     Binary Tree
     Pre-order Traversal
     In-order Traversal
     Post-order Traversal
     Binary Search Tree
     Searching in BST
     Insertion in BST
     Deletion in BST
     AVL Tree
     Insertion in AVL Tree
     LL Rotation
     LR Rotation
     RL Rotation
     RR Rotation
     Deletion in AVL Tree
     B Tree
     B+ Tree
    ———————————
    DS Graph
     DS Graph
     Graph Implementation
     BFS Algorithm
     DFS Algorithm
     Spanning Tree
     Prim’s Algorithm
     Kruskal’s Algorithm
    ——————————–
    DS Searching
     Linear Search
     Binary Search
  • ———————————
    DS Sorting
     Bubble Sort
     Heap Sort
     Insertion Sort
     Merge Sort
     Quick Sort
     Selection Sort

Description

 

 

You may also like…