Logo
Address:
304 Aarohi Complex,
Near RasRanjan Sweet Mart,
Vijay Char Rasta,
Navrangpura,Ahmedabad
Cell: 09375960898
|--> Home
---> VB
| `--> VB6
---> Oracle
| |--> Sql
| `--> Pl/Sql
---> Tally
| `--> Tally

Looking for Data Structure Training in Ahmedabad?

Course: Data Structure
  1. Introduction
    • Introduction to Data Structure
    • Classification
      • Primitive
      • Non – Primitive
      • Linear
      • Non - Linear
  2. Arrays
    • Array Concept
      • One Dimension
      • Two Dimension
    • Memory Representation of One & Two Dimensional Array
      • Row Major
      • Column Major
    • Operations on Arrays
      • Insertion
      • Deletion
      • Traversal
    • Sparse Matrix
    • Memory Representation of Sparse Matrix (Vector Notation)
    • Representation of Polynomial
  3. Searching & Sorting
    • Sequential Search
    • Binary Search
    • Comparison of Sequential & Binary Search in terms of Efficiency
    • Bubble Sort
    • Selection Sort
    • Insertion Sort
    • Quick Sort
    • Merge Sort
    • Comparison among all sort in terms of their efficiency
  4. Stacks
    • Properties of Stacks
    • Stack representation using Arrays
    • Stack Operations
      • Push
      • Pop
      • Peep
      • Change
    • Application of Stack
      • Recursion
      • Expression : Infix ,Postfix ,Prefix with their conversions
  5. Queues
    • Properties of Queue
    • Circular Queue
    • Priority Queue
    • Double ended Queue
    • Queue representation using Array
    • Queue Operations
      • Insert
      • Delete
    • Application of Queue
  6. Linked Lists
    • Singly Linked Lists
    • Doubly Linked Lists
    • Circular Linked Lists
    • Header Linked Lists
    • Operations of Linked Lists
      • Insertion
      • Deletion
      • Traversal
      • Split
      • Join
    • Application of Linked Lists
    • Representation of Polynomial
    • Implementation of Stack & Queue
  7. Trees
    • Binary Trees & its properties
    • Binary Search Tree
    • Operations on Trees
      • Creation
      • Traversal
      • Preorder
      • Postorder
      • Inorder
      • Search
      • Deletion
    • Representation of Tree using Arrays & Linked List
    • Applications of Binary Trees
    • Threaded Binary Tree
    • Heap Tree
    • B-Trees
    • AVL Tree
    • Expression Tree
    • Introduction to Forest & conversion of Forest into Binary Tree
  8. Graphs
    • Weighted Graphs
    • Representation of Graphs
      • Adjacency Matrix
      • Adjacency List
    • DFS & BFS Algorithms
    • Minimum Spanning Tress
      • Prim’s Algorithm
      • Greedy Method
    • Application:Traveling Salesman Problem
    • PERT & CPM