Master Data Structures & Algorithms: Build, Optimize, and Solve

Course Description

This final module is all about bringing everything together. It’s where your understanding of Data Structures and Algorithms (DSA) meets the real world. You’ll take on advanced problems and work on hands-on projects that challenge you to apply what you’ve learned, whether it’s recursion, dynamic programming, trees, graphs, or hashing. The focus isn’t just on getting the right answer, but on writing clean, efficient, and fast code that can hold up under pressure - just like in interviews or real-world software projects. Think of this as your DSA capstone, where you level up from learning to building, solving, and creating. By the end of this course, you’ll be confident in solving complex DSA problems using techniques like backtracking, graph traversal, and dynamic programming. You’ll know how to choose and apply the right data structures, like heaps, stacks, queues, or hash maps - to tackle real challenges. Your code will be not only correct but clean, optimized, and ready for time-bound situations. Most importantly, you’ll build complete projects that bring together all these skills - showing that you can think critically, solve problems creatively, and turn your DSA knowledge into real, working solutions.

Course Fee Seats Limited

₹2500.00

Course Details

Duration
Duration
50 HRS
Duration
Course Label
SDC
Course Language
English
Duration
Course Mode
Online
Duration
Timings
6 PM - 8 PM
Days
Monday to Saturday
Registration Till
25 May 2026
Duration
Tentative ClassStart Date
summer
Duration
Eligible Schools:
1. School of Computer Science and Engineering 2. School of AI and Emerging Technologies 3. School of Computing and Artificial Intelligence
Certificate Criteria
Certificate Criteria
75% attendance, 50% score in all Exams/CA

Curriculum Snapshot

Explore the comprehensive course modules

1 Arrays

Introduction to DSA, Time & Space Complexity, Arrays – Basics and Operations (Insert, Delete, Search), Arrays – Sorting (Bubble, Selection, Insertion), Searching (Binary Search, Two-Pointer, etc.), and Arrays – Practice Problems.

2 Linked Lists

Linked Lists : Introduction, Memory representation, Allocation, Traversal, Insertion, Deletion, Header linked lists: Two-way lists: operations on two way linked lists

3 Stack and Queue

Stacks : Introduction: List and Array representations, Operations on stack (traversal, push and pop), Queue : Array and list representation, operations (traversal, insertion and deletion), Priority Queues

4 Heaps and Hashing

Hashing – Hash Tables, Collision Handling, Hashing – Applications (Frequency Count, LRU Cache), Heaps – Min Heap, Max Heap, Heap Sort, and Practice Problems - Hashing and heap.

5 Trees

Binary Trees – Introduction (Complete and Extended Binary Trees), Memory Representation (Linked, Sequential), Binary Search Tree – Introduction, Searching, Insertion and Deletion, Traversing, and Practice Problems.

6 Graphs

Graph Traversal – BFS, DFS, Graphs – Topological Sort, and Cycle Detection

Instructor Spotlight

Learn from leading experts in stem cell research

Mukesh Sharma

Mukesh Sharma

Assistant Professor

testing15may2026testing15may2026

Arvind Kumar

Arvind Kumar

Assistant Professor

testing15may2026testing15may2026testing15may2026