Data Structure(Using C)

Course Content

1. Introduction To Data structure
   • Introduction and Defination
   • Classification of DataStructure
   • Memory Allocation in C
   • Recursion


2. Stacks
   • Introduction
   • Stack Implementation
   • Operations on stack(push,pop)
   • Stack Terminology
   • Algorithms for push and pop(Using Array)
   • Implementation of stack using pointer(Linked List)


3. Queue
   • Introduction
   • Queue Implementation
   • Operation on Queue
   • Algorithms for Insertion and Deletion of Queue(Using Array)
   • Limitation off simple queue
   • A circular Queue
   • Double ended Queue
   • Priority Queues


4. Linked List
   • Introduction
   • Linked List And key Terms
   • Representation of Linked List
   • Types od Linked List(singly,circular,Doubly)


5. Searching And Sorting
   • Introduction
   • Linear Search
   • Binary search
   • Bubble sort,Insertion sort,selection sort,merge sort,Quick sort,radix sort,heap sort


6. Trees
   • Introduction
   • Basic terminology
   • Binary tree
   • Trauersal methods
   • Binary search tree
   • B tree, B+tree


7. Graphs
   • Introduction
   • Basic Terminology
   • Graph representation and implementation
   • Shortest path problem
   • Minimum spanning tree


8. Hashing
   • Introduction
   • Hash function
   • Overflow
   • collision,open hashing & closed hashing
   • Rehashing techniques