Data Structures Training Program

Introduction:

1. Concept Data Structure
2. Example
3. Need of Data structure
4. Advantages of using DS

Algorithm & Pseudocode:

1. Algorithm Definition
2. Characteristics of algorithm
3. Elements of algorithm
4. Pseudocode example
5. Difference of Algorithm & Pseudocode

Function:

1. What is function
2. Types of function
3. How function works
4. Function recursion and how it works.

Array:

1. Concept of Array
2. Types of array
3. Basic Programs
4. Array with Functions
5. Single & 2-dimensional array in function
   argument.

Pointer:

1. Pointer Basics
2. Pointer with functions
3. Call by reference
4. Array of pointers & pointer to array &
   Programs

Structure:

1. Understanding about Structure
2. Pointer structure variable
3. Structure as function argument
4. using call by member value
5. hole structure and call by
6. passing reference of structure.

Stack:

1. Operations on Stack
2. Array & Linked Representation
3. Programs on stack
4. Push & Pop operations
5. Traversing.

Applications of Stack :

1. Arithmetic Expression Evaluation
2. Notations, Infix
3. Postfix, Prefix
4. Conversion infix to post fix
5. Conversion postfix to infix
6. Evaluation of Postfix and Pre fix using
   stack.

Queue:

1. Operations on Queue
2. Array & Linked Representation
3. Programs on stack
4. Insert & Delete operations
5. Circular queue
6. Rrepresentation
7. Deque
8. Priority Queue
9. Application of queue.

LinkedList:

1. Concept of linked list
2. Difference of linklist & array
3. Single linked list
4. Representation
5. Operations
6. Traversing
7. Insertion(first node, last node, at a
   position, after a node value)
8. Deletion(first node, last node, at a position,
   after a node value)
9. Double linked list
10. Representation
11. Operations, traversing
12. Insertion (first node, last node, at a
    position, after a node value)
13. Deletion (first node, last node, at a
    position, after a node value)
14. Circular link list & header link list example

Tree:

1. Tree terminology
2. Binary tree
3. Complete Binary Tree
4. Binary search tree
5. Tree Traversals
6. Creation of Binary Tree from traversal
   methods
7. Expression Tree & expression
   Manipulation
8. Binary Search Tree
9. Insertion & deletion in BST(Program)
10. AVL Tree, M-way Search Tree
11. B+ tree, Insertion & deletion.

Graph:

1. Graph terminology
2. Representation of graphs
3. Path matrix
4. Graph Traversal
5. BFS (breadth first search)
6. DFS (depth first search)
7. Minimum spanning Tree
8. Kruskal’s Algorithm & Prim’s Algorithm
9. Warshall’s algorithm (shortest path
   algorithm).

Hashing & Searching:

1. Linear and binary search methods
2. Hash functions
3. Hashing techniques & Chaining.

Sorting:

1. Bubble sort
2. Selection sort
3. Insertion sort
4. Quick sort
5. Merge sort
6. Heap sort
7. Radix sort