CERTIFICATE IN DATA STRUCTURE AND ALGORITHM WITH C ( S-DSA WITH C )

DSA with C Programming – Unit-wise Syllabus

Course Duration: 2 Months (8 Weeks)
Mode: Theory + Lab Practical
Level: Beginner to Intermediate
Prerequisites: Basic Knowledge of C Programming

Unit 1: Problem Solving & Stack Concepts

• Introduction to Problem-Solving Techniques
• Abstract Data Types (ADT)
• Stack: Definition, Uses, Implementation
• Operations on Stack: Push, Pop, Peek
• Expression Conversion: Infix to Prefix/Postfix
• Expression Evaluation using Stack

Unit 2: Queue and Array Representations

• Queue: Introduction and Applications
• Types of Queues: Linear, Circular, Deque
• Array Representation of Queue
• Queue Operations using C
• Comparison of Stack and Queue

Unit 3: Introduction to Linked Lists

• What is a Linked List?
• Components & Node Structure
• Representation in Memory
• Insertion and Deletion Operations
• Advantages and Disadvantages of Linked Lists

Unit 4: Types of Linked Lists

• Singly Linked List: Operations and Implementation
• Doubly Linked List: Concept and Code
• Circular Linked List: Introduction and Use Cases
• Operations on Singly Linked List
• Comparative Analysis of All Linked List Types

Unit 5: Trees and Hashing

• Binary Tree: Concepts and Terminology
• Binary Search Tree (BST): Creation and Operations
• AVL Tree (Balanced BST): Rotations and Balance Factors
• Tree Traversals: Inorder, Preorder, Postorder
• Hashing Techniques and Collision Resolution

Unit 6: Searching Techniques

• Sequential Search
• Linear Search: Iterative and Recursive Methods
• Binary Search: Logic and Implementation
• Comparison of Searching Methods
• Time and Space Complexity

Unit 7: Sorting Algorithms

• Insertion Sort and Shell Sort
• Heap Sort: Max-Heap, Min-Heap
• Merge Sort and Quick Sort
• External Sorting Methods
• Topological Sort (using DFS/Queue)

Unit 8: Graph Theory & Advanced Algorithms

• Graph Representation: Adjacency Matrix/List
• Graph Connectivity & Traversals (BFS/DFS)
• Random Walks on Graphs
• Online Paging Algorithms
• Adversary Models in Algorithms

Unit 9: Randomized Algorithms

• What is Randomization in DSA?
• Randomized Algorithm Concepts
• Min-Cut Algorithm
• Random Treaps and Their Applications

Unit 10: Lab Manual

• C Program Implementations for All Data Structures
• Stack, Queue, Linked List Programs
• Tree Traversals and BST in C
• Sorting & Searching Practicals
• Final Lab Assignment + Viva

 Course Highlights

• Practical + Conceptual Learning
• C Programming Focused
• Certificate on Completion
• Mini Projects and Final Lab Evaluation

Eligibility :- 12 PASS