Mastering C with Data Structures and
Algorithms – 120 Hrs
Level 1 – 60 Hrs
Level 2 – 60 Hrs
Eligibility – BE, CSE/AI, MCA/M.Tech CSE
Program Objective :
To enable developers to write code that runs on any device with a Java Virtual Machine (JVM), promoting reusability and portability
Program Outcomes:
- Preparing the candidates to crack Interviews’
- Providing Code Optimization Technique
- Choosing the Best Data Structures to Solve the problems
- Solving the problems with less time and applying the best
Mastering in C :60 Hours
- Operators, Strings, Arrays
- Pointers
- Stacks, Queue, Linked List, Trees, Graphs
Experiential Project Based Learning:
End-to-End AI Project Experience
Project Stream:
Data Structures
Tools / Platform:
- Code Blocks
- Online GDB
| Module 1: Mastering in C Programming (60 Hours) | ||
|---|---|---|
| C Syntax, Variables, Data Types | Operators, Control Statements (if, switch, loops) | Arrays and Strings: 1D and 2D Arrays |
| Array Operations (Insert, Delete, Search) | Strings and String Manipulation (strlen, strcpy, strcat) | Applications (e.g., Palindrome, Anagram check) |
| Structures and Pointers | Structures and Nested Structures, Pointers to Structures | Array of Structures, Dynamic Memory for Structures |
| Sorting Algorithms: Bubble Sort, Selection Sort | Insertion Sort, Complexity Analysis (Best/Worst/Average Case) | Merge Sort (Divide and Conquer), Quick Sort |
| Comparison & Performance | Searching Techniques: Linear & Binary Search | Recursive Binary Search, Time Complexity Analysis |
| Applications in Real-World Scenarios | Recursion Deep Dive | |
| Concept of Stack in Recursion | Problems: Factorial, Fibonacci, N-Queens (intro) | Tower of Hanoi, Backtracking Basics |
| Module 2: Data Structures and Algorithms (60 Hours) | ||
|---|---|---|
| Linked List Concepts – SLL, DLL (creation, traversal, insertion, deletion | Reverse a Linked List, | Stack – Concepts, Applications (balanced parentheses, postfix eval) |
| Queue – Concepts, Applications | Queue Using Array and Linked List | Circular Queue, Deque, Priority Queue |
| Trees – Binary Tree, Binary Search Tree (BST) | Tree Operations – Insert, Delete, Traverse (Inorder, Preorder, Postorder) | Advanced Trees (Day 14) AVL Tree – Rotations and Balancing B-Trees/B+ Trees – Intro Heap – Min Heap, Max Heap |
| Graph – Adjacency Matrix/List, BFS, DFS | Shortest Path – Dijkstra's Algorithm MST – Prim's, Kruskal's Applications in Networking & Routing |
Problem Solving using Hacker Rank and Leet Code. |
