Data Structure Training

  1. Introduction
  2. Structured Representation
  3. Statements and Control Structures
  4. Abstract Data Types
  5. Static Data Types
  6. Dynamic Data Types
  7. Arrays
  8. Pointers
  9. Linked List
  10. Advanced Data Structures
  11. Data Structure Representation

Stacks

  1. Defining stack
  2. Application of stack
  3. Operations of stack
  4. Stack implemented as an array
  5. Stack implemented with pointers
  6. Using Stacks to solve problems

Queues

  1. Defining Queue
  2. Application of Queue
  3. Operation of Queue
  4. Circular Queue
  5. Priority Queue
  6. Double Ended Queue
  7. Queue implemented with Pointers
  8. Differences between Stacks and Queues

Linked List

  1. Introduction
  2. Advantages of Linked List over an Array
  3. Application of Linked List
  4. Types of Linked Lists
  5. Singly Linked Lists
  6. Operation of Singly Linked Lists
  7. Doubly Linked Lists
  8. Operations on Doubly Linked Lists
  9. Circular Linked Lists
  10. Circular Double Linked Lists
  11. Uses of Linked Lists

Trees

  1. Introduction
  2. Binary Trees
  3. Implementation of Binary Trees
  4. Insertion into a Binary Tree
  5. Binary Tree Deletion
  6. Traversing a Binary Tree
  7. Binary Height Balanced Trees

Graphs

  1. Introduction
  2. Types of Graphs
  3. Various Representation of Graphs
  4. Application of Graphs
  5. Graph Traversals

Sorting Techniques

  1. Introduction
  2. Bubble Sort
  3. Selection Sort
  4. Quick Sort
  5. Merge Sort
  6. Iterative Merge Sort
  7. Introduction to Heap
  8. Heap Operations
  9. Heap Sort

Searching Techniques

  1. Introduction
  2. Linear Search
  3. Binary Search