Data Structure Using C
Section outline
-
Data Structure is a way of organizing and storing data in a computer so that it can be accessed and modified efficiently. Using the C programming language, data structures can be implemented effectively because C provides: -
Topic-
Basic Terminology, Classification of Data Structures, Operations on Data structure.
-
Opened: Monday, 23 February 2026, 6:03 PMClosed: Friday, 20 March 2026, 6:03 PM
This section covers all topic.
-
Topic:
Stacks- Introduction to Stacks, Array Representation of Stacks, Operations on a Stack, Application of Stacks-Infix-to-Postfix Transformation, evaluating Postfix Expressions.
Queues- Introduction to Queues, Array Representation of Queues, Operation on a Queue, Types of queues-DeQueue, Circular Queue, Applications of Queue.
-
Topic:
Singly Linked List, Representation in Memory, Operation on a Single Linked List, Circular Linked Lists, Doubly Linked Lists.
-
Topic:
Introduction to different sorting techniques-Bubble sort, Insertion sort, Quick sort and Merge sort, symbol Table, Linear Search, Binary Search, Hash Table
-
Topic:
Tree: Basic Terminology definition and Concept of Binary Trees, Representation of a Binary Tree using Array and Linked Lists, Operations on a binary Tree-Insertion, Deletion, Traversals, Types of Binary Trees, binary tree traversals: in-order, pre-order, post-order, Various operation of Binary Search Tree, B Tree and AVL Tree.
Graph: Graph Terminology, Representation of Graphs, Adjacency List, Adjacency Matric, Graph Traversal.