Data Structure Using C Training

  • Overview
  • Course Content
  • Drop us a Query

Data Structure Using C training focuses on the significance of data structures and algorithms in computer programming and software development. Hands-on exposure on data structures lays a strong foundation in developing programs. According to the real life scenario, a well versed candidate can distinguish which data structure to be used to drive optimized results.

Participants in this training will learn how to organize and store data in a computer. Data structures such as arrays, stacks, queues, linked list, and trees are covered in detail. Different algorithms for searching, hashing, and sorting are explained with examples and programming. Candidates learn about the applications of binary search trees and graphs.

Upon the completion of training, you will be able to:

  • Understand the terminology used in data structures
  • Find algorithm complexity
  • Define and perform operations on different data structures say arrays, stacks, queues, linked list, and trees
  • Perform recursion operation
  • Execute data operations such as searching, sorting, and hashing
  • Use binary trees for insertion, deletion, and searching of elements
  • Use graphs and multi-graphs
Target audience
  • Students
  • Academicians
  • Software developers

While there is no formal pre prerequisite for this training, however candidates with a strong interest in software development are the ideal participants for this course.

1. Introduction

  • Basic Terminology
  • Elementary Data Organization
  • Data Structure Operations
  • Algorithm Complexity
  • Time Space trade off

2. Arrays

  • Array Definition
  • Representation and Analysis
  • Single and Multi-dimensional Arrays
  • Address Calculation
  • Application of Arrays
  • Character String in C
  • Character String Operation
  • Array as Parameters

3. Stacks

  • Array Representation
  • Implementation of Stack
  • Operations on Stack
  • Push and Pop
  • Array Representation of Stack
  • Linked Representation of Stack
  • Operations Associated with Stacks

4. Recursion

  • Recursive definitions and processes
  • Recursion in C
  • Example of Recursion
  • Tower of Hanoi Problem
  • Simulating Recursion
  • Backtracking
  • Recursive Algorithms

5. Queues

  • Array and Linked Representation
  • Implementation of Queues
  • Operations on Queue
    • Create
    • Add
    • Delete
    • Full
    • Empty
  • Circular Queue
  • Deque
  • Priority Queue

6. Linked List

  • Representation of Singly Linked Lists
  • Implementation of Singly Linked Lists
  • Two way Header List
  • Traversing and Searching of Linked List
  • Overflow and Underflow
  • Insertion and Deletion to/from Linked List
  • Insertion and Deletion Algorithms
  • Doubly Linked List
  • Linked List in Array

7. Trees

  • Basic Terminology
  • Binary Trees
  • Binary Tree Representation
  • Algebraic Expressions
  • Complete Binary Tree
  • Extended Binary Trees
  • Array and Linked Representation of Binary Trees
  • Traversing Binary Trees

8. Searching and Hashing

  • Sequential Search
  • Binary Search
  • Comparison and Analysis
  • Hash Table
  • Hash Functions
  • Collision Resolution Strategies
  • Hash Table Implementation

9. Sorting

  • Insertion Sort
  • Bubble Sorting
  • Quick Sort
  • Two Way Merge Sort
  • Heap Sort
  • Sorting on Different Keys
  • Practical Consideration for Internal Sorting

10. Binary search Trees

  • Binary Search Trees
  • Insertion and Deletion in BST
  • Complexity of search Algorithm
  • Path Length
  • AVL Trees
  • B-trees

11. Graphs 

  • Terminology and Representations
  • Graphs and Multi-Graphs
  • Directed Graphs
  • Sequential Representations of Graphs
  • Adjency Matrices
  • Traversal
  • Connected Component and Spanning Trees
  • Minimum Cost Spanning Trees

A Few Things You'll Love!

What our Students Speak