What you'll learn

This course provides a solid foundation in Data Structures and Algorithms (DSA) using C++. It covers fundamental concepts such as arrays, linked lists, stacks, queues, trees, graphs, sorting, and searching algorithms. Through hands-on coding exercises and problem-solving techniques, students will develop a strong understanding of how data is stored, manipulated, and optimized in real-world applications. By the end of this course, learners will be able to analyze algorithm efficiency and implement data structures efficiently in C++. Outcomes: 1. Understand the Fundamentals of DSA. 2. Implement Basic Data Structures in C++ 3. Apply Trees and Graphs Concepts 4. Master Searching and Sorting Algorithms 5. Analyze Algorithm Complexity 6. Solve Real-World Problems Using DSA

  • oImportance of DSA in problem-solving oIntroduction to Time and Space Complexity oBig-O, O, and T Notation Algorithm Design and Analysis Basics
  • oTypes: 1D, 2D, Dynamic Arrays oOperations: Insertion, Deletion, Traversal oApplications: Searching, Sorting, Sliding Window Problems
  • oTypes: Singly Linked List, Doubly Linked List, Circular Linked List oOperations: Insertion, Deletion, Traversal oProblems: Detecting Cycles, Reversing a Linked List
  • oDefinition and Operations (Push, Pop, Peek) oApplications: Expression Evaluation (Infix, Prefix, Postfix) Implementing Stacks using Arrays and Linked Lists oTypes: Simple Queue, Circular Queue, Priority Queue oOperations: Enqueue, Dequeue oApplications: Scheduling, BFS Traversal
  • oBasic Concepts: Binary Tree, Binary Search Tree (BST) oOperations: Insertion, Deletion, Search, Traversal (Pre-order, In-order, Post-order) oBalanced Trees: AVL, Red-Black Trees oMin-Heap, Max-Heap Operations: Insert, Extract-Min/Max, Heapify Graph Algorithms
  • Hashing Techniques Collision Resolution Techniques

Sudha Shanker Prasad
Assistant Professor

Mr. Sudha is currently working as Assistant Professor in the School of Computer Science & Engineering at Lovely Professional University. He has done Master’s in Computer Science and Engineering and has 7+ years experience as a Data Structure and Algorithms tutor in various colleges. He have conducted lots of workshops and skill development courses on programming languages, data structures and algorithms.


Sumanjeet Kaur Toor
Lecturer

Dr. Harjeet is currently working as Assistant Professor in the School of Computer Science & Engineering at Lovely Professional University. She has 25+ years of experience as a Data Structure and Algorithms tutor in various colleges. He have conducted lots of workshops and skill development courses on programming languages, data structures and algorithms.