Data Structures classes at Durgapur :
This Online Course of Data structures using C course will introduce you to common data structures and algorithms. we consider the common data structures that are used in various computational problems. You will learn how these data structures are implemented in different programming languages and will practice implementing them in our programming assignments.
Detailed syllabus for a data structure using C course:
Module 1: Introduction and Review of C Programming
Introduction to Data Structures and Algorithms
Basic Concepts in C Programming
Review of Pointers and Memory Management
Module 2: Arrays and Strings
Arrays and their Implementation in C
Two-dimensional Arrays and Matrices
Strings and their Manipulation
Module 3: Linked Lists
Singly Linked Lists and their Implementation
Doubly Linked Lists and their Implementation
Circular Linked Lists and their Implementation
Module 4: Stacks and Queues
Introduction to Stacks and Queues
Implementation of Stacks and Queues using Arrays and Linked Lists
Applications of Stacks and Queues
Module 5: Recursion and Backtracking
Recursion and its Applications
Backtracking and its Applications
Implementing Recursion and Backtracking in C
Module 6: Trees
Introduction to Trees
Binary Trees and their Traversal
Binary Search Trees and their Implementation
Heap Trees and their Implementation
Module 7: Balanced Search Trees
AVL Trees and their Implementation
Red-Black Trees and their Implementation
Comparison of Balanced Search Trees
Module 8: Hash Tables
Introduction to Hashing and Hash Tables
Hash Functions and Collision Handling
Implementation of Hash Tables in C
Module 9: Graphs
Introduction to Graphs
Representation of Graphs
Traversal Algorithms for Graphs
Module 10: Sorting
Bubble sort, selection sort, insertion sort
Merge sort, quicksort
Radix sort, counting sort, bucket sort
Comparison of sorting algorithms
Module 11: Searching
Linear search, binary search
Hash tables and hash functions
Collision resolution strategies
Module 12: Graph Algorithms
Shortest Path Algorithms: Dijkstra's Algorithm and Bellman-Ford Algorithm
Minimum Spanning Tree Algorithms: Prim's Algorithm and Kruskal's Algorithm
Depth First Search and Breadth First Search