Advance Data Structures and Algorithms using C++

Course Description

1. Understand and analyze time and space complexity of algorithms and data structures. 2. Illustrate the importance and applications of linked lists in real-world problems. 3. Differentiate between stack and queue data structures for efficient problem solving. 4. Apply recursion techniques and implement tree-based data structures. 5: Use heap operations and hashing techniques for efficient data storage, retrieval, and collision handling. 6. Identify and adapt to emerging data structures and algorithms to stay updated with technological advancements.

Course Fee Seats Limited

₹2500.00

Course Details

Duration
Duration
60 HRS
Duration
Course Label
SDC
Course Language
English
Duration
Course Mode
Online
Duration
Timings
6 PM - 8 PM
Days
Monday to Friday
Registration Till
25 May 2026
Duration
Tentative ClassStart Date
summer
Duration
Eligible Schools:
Certificate Criteria
Certificate Criteria
75% attendance, 50% score in all Exams/CA

Curriculum Snapshot

Explore the comprehensive course modules

1 Fundamentals of DSA – Complexity, Arrays Basic Sorting

Introduction to Algorithm Analysis & Complexity Notations ,Array Fundamentals and Basic Operations Searching Techniques: Linear and Binary Search ,Basic Sorting Algorithms: Bubble and Selection Sort ,Insertion Sort and Comparative Analysis of Sorting Algorithms

2 Linear Data Structures – Linked Lists

Introduction to Linked Lists and Memory Representation , Insertion Operations in Singly Linked Lists , Deletion Operations in Singly Linked Lists , Traversal and Problem Solving using Linked Lists, Advanced Linked Lists: Doubly and Circular Linked Lists

3 Stack and Queue Data Structures

Stack Implementation using Arrays , Stack Implementation using Linked Lists , Applications of Stack: Expression Evaluation , Queue Implementation: Linear and Circular Queue , Advanced Queues: Deque and Priority Queue

4 Recursion and Tree Data Structures

Fundamentals of Recursion and Problem Solving , Recursive Applications: Tower of Hanoi , Introduction to Binary Trees , Tree Traversal Techniques (Inorder, Preorder, Postorder) , Binary Search Trees: Insertion, Deletion, Searching

5 Advanced Algorithms – Sorting, Heaps Hashing

Divide and Conquer: Merge Sort , Divide and Conquer: Quick Sort , Heap Data Structure: Insertion and Deletion , Heap Sort and Applications of Heaps , Hashing Techniques and Collision Resolution

6 Graph Algorithms and Course Revision

Graph Traversal using Breadth-First Search (BFS) , Graph Traversal using Depth-First Search (DFS) , Shortest Path Algorithm: Dijkstra’s Algorithm , Advanced Shortest Path Algorithms: Bellman-Ford and Floyd-Warshall , Comprehensive Revision and Mock Assessment

Instructor Spotlight

Learn from leading experts in stem cell research

Harsh Vardhan

Harsh Vardhan

Assistant Professor

Harsh Vardhan (Computer Science & Engineering)