Data Structures and Algorithms

“Data Structures and Algorithms”

45 Hours Training and Learning on “Data Structures &Algorithms”

For: -1st, 2nd, 3rd, 4th year B. E. / B. Tech. (ECE, EE, EEE, EIC, CS, IT, ME, Automobile), M. E./ M. Tech., MCA, BCA, B. Sc. – I. T., M. Sc.,B. Arch., M. Tech. & Professionals.

Topics Cover: -

During this training we cover following topics with practical hands-on:

Introduction of Programming Strategies

    • Objects and ADTs
    • Constructors and Destructors
    • Data Structure
    • Methods
    • Pre- and post-conditions
    • C conventions
    • Error Handling
    • Some Programming Language Notes

Data Structures

    • Arrays
    • Lists
    • Stacks
    • Queue
    • Priority Queues
    • Dequeue


    • Linear Search
    • Binary Search


    • Time Complexity
    • Space Complexity



    • Binary Tree
    • Binary Search Tree


    • Bubble
    • Heap
    • Quick
    • Merge
    • Radix
    • Insertion
    • Selection

Advanced Trees

    • Red-Black trees
    • AVL trees
    • General n-array trees
    • Hash Tables


    • Minimum Spanning Tree
    • Dijkstra’s Algorithm
    • Prim’s Algorithm
    • Walshall’s Algorithm

Huffman Encoding

    • Hard or Intractable Problems
    • Eulerian or Hamiltonian Paths
    • Travelling Salesman’s Problem.
    Project Cover: -

During this training each and every student is going to design own following projects with their own hand:
1. Array Storage & Data Operation Program
2. Stack & Queue Operation
3. Matrix Operation
4. Linked Lists Illustrating Operations On Various Link Lists.
5. Implementation Of Binary Tree With Operations Like Addition, Deletion, Traversal
6. Binary Search In Arrays And On Linked Binary Search Tree
7. Implementation Of Insertion, Quick, Heap, Topological And Bubble Sorting Algorithms
8. And Many More.

For Students: -

Participation Kit to every participant.

Full Study Material containing:

    • Data Sheets
    • Report Matter
    • Course Layout
    • Project Coverage