Datastructure through C

Data structure is the science of storing data in a computer so that it can be used efficiently. Often a carefully chosen data structure will allow a more efficient algorithm to be used. The choice of the data structure often begins from the choice of an abstract data structure. A well-designed data structure allows a variety of critical operations to be performed on using as little resources, both execution time and memory space, as possible.

Different kinds of data structures are suited to different kinds of applications, and some are highly specialized to certain tasks. For example, B-trees are particularly well-suited for implementation of databases, while routing tables rely on networks of machines to function.

In the design of many types of programs, the choice of data structures is a primary design consideration, as experience in building large systems has shown that the difficulty of implementation and the quality and performance of the final result depends heavily on choosing the best data structure. After the data structures are chosen, the algorithms to be used often become relatively obvious. Sometimes things work in the opposite direction – data structures are chosen because certain key tasks have algorithms that work best with particular data structures. In either case, the choice of appropriate data structures is crucial.

This insight has given rise to many formalized design methods and programming languages in which data structures, rather than algorithms, are the key organizing factor. Most languages feature some sort of module system, allowing data structures to be safely reused in different applications by hiding their verified implementation details behind controlled interfaces. Object-oriented programming languages such as C++ and Java in particular use objects for this purpose.

Since data structures are so crucial to professional programs, many of them enjoy extensive support in standard libraries of modern programming languages and environments, such as C++’s Standard Template Library, the Java API, and the Microsoft .NET framework.

The above discussion aims at only making you understand how critical the proper understanding of data structures is. The implementation and demonstration of various data structures has been done by either C or C++.

Data Structure Through C

Module – 1: Built-in Data Structure

Abstract Data Type

  • Data structure and abstract data types
  • Classification of data structures
  • Arrays
  • Implementation of structures in C
  • Character strings and usage
  • Pointers
  • Memory management in C
Module – 2: Linear Data Structure

Linked Lists

  • Singly Linked List
  • Operation on Linked Lists
  • Avail List
  • Implementation of Linked List
  • Circular Linked List
  • Doubly Linked List
  • Application of Linked List


  • Stack as a linear Data structure
  • Definition and concepts
  • Advantages and disadvantages of a stack
  • Implementation of a Stack as an array
  • Implementation of a Stack as a linked list
  • Applications of Stacks
  • Multiple Stacks


  • Definition and concepts
  • How recursion works
  • Writing recursive algorithms
  • Implementation of recursion


  • Queue as a linear Data structure
  • Definition and concepts
  • Advantages and disadvantages of a queue
  • Implementation of a queue as an array
  • Implementation of a queue as a linked list
  • Dqueue
  • Circular queue
  • Priority queue
  • Applications of queues
Module – 3: Non-Linear Data Structure


  • Terminology
  • Binary Trees
  • Operation on binary trees
  • Binary Tree traversal
  • Threaded Binary Tree
  • AVL Tree
  • Searching
  • Insertion
  • Deletion
  • B-Tree
  • Application of tree with set representation


  • Graph – definition and terminology
  • Graph representation
  • Traversal of Graph
  • Shortest Path Algorithm
Module – 4: Sorting and Searching


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


  • Linear Search
  • Binary Search
  • Fibonacci Search
  • Hashing – hash table
  • Hash Function
  • Collision – Resolution strategy

File Structure And Storage Management

  • Sequence
  • Random
  • Linked Organization

Comments are closed.