Data structure using C
Data structure, the way in which data are stored for efficient search and retrieval. Different data structures are suited for different problems. It represents the knowledge of data to be organized in memory. It should be designed and implemented in such a way that it reduces the complexity and increases the efficiency.
The C Programming language has many data structures like an array, stack, queue, linked list, tree, etc
Introduction of Data Structure and Problem Solving
Need of Data structure
Advantages of using DS
Overview of Function
Concept of Array
Array with Functions
Array in function argument
Pointer with functions
Call by reference
Array of pointers & pointer to array & Programs
Understanding about Structure
Pointer structure variable
Passing reference of structure
Stack & Queue:
Array & Linked Representation of Stack
Push & Pop operations on Stack
Application of stack
Queue and its representations
Basic operations on Queue (Enqueue and Dequeue)
Difference between stack and queue
Introduction & Representation of Linked lists
Types of Linked List
Basics operations (insert, deletion, display, search, delete)
Doubly Linked List and Its representation.
Basic operations on Doubly Linked List (insertion, deletion, Insert Last, Delete Last, Insert After, delete, display forward, display backward)
Circular Linked List and its representation
Basic operations (insert, delete and display)
Tree Concepts, representation & Tree structure.
Binary Search Tree and its operation.
Tree Traversal (In-Order, Pre-Order and Post-Order Traversal).
AVL Tree and Spanning tree.
Sorting & Searching:
Bubble sort, Selection sort
Quick sort, Merge sort
Linear and binary search
Graph in Data Structure
Graph terminology & Representation of graphs
Basic operations (add vertex, Add Edge, Display vertex)
Depth first and Breadth first traversal
Minimum spanning Tree