LPU - Lovely Professional University
What you'll learn

Course Overview As data-driven technologies evolve, mastering Data Structures and Algorithms (DSA) becomes essential for aspiring software developers. Designed exclusively for 2nd-year engineering students, this 50-hour summer training in C++ will enable learners to strengthen their algorithmic thinking, prepare for technical interviews, and excel in competitive programming. Students will journey from foundational concepts like arrays and recursion to advanced topics including dynamic programming, graph algorithms, tries, and segment trees. The bootcamp integrates hands-on coding, real-world challenges, and mini contests to foster practical mastery of DSA. Learning Outcomes By the end of this bootcamp, participants will be able to: Implement core data structures and algorithms in C++ using industry-standard practices. Analyze time and space complexity to write optimized code. Solve real-world problems using recursion, backtracking, greedy, and dynamic programming techniques. Apply graph theory, trees, and advanced data structures in coding contests. Prepare for technical interviews and online platforms like Codeforces, LeetCode, and HackerRank.

  • Introduction to DSA Time and Space Complexity
  • Basics of Arrays Insertion, Deletion, Traversal Two Pointer Technique Sliding Window Technique
  • Singly Linked List Doubly Linked List Circular Linked List
  • Stack Basics and Applications Problems like Next Greater Element, Min Stack
  • Queue Basics Circular Queue Deque and Its Applications
  • Binary Tree Traversals (Recursive & Iterative) Binary Search Tree Operations
  • BFS and DFS Traversals Topological Sorting Shortest Path Algorithms (Dijkstra, Bellman-Ford) Floyd-Warshall Algorithm Cycle Detection, Bipartite Graphs
  • MinHeap and MaxHeap Priority Queue Applications: K Largest Elements, Top K Frequent Elements
  • Various searching & sorting algos with their applications
  • Backtracking - Concept, N-Queens, Subsets, recursion
  • Basics (Fibonacci, Knapsack etc)
  • Introduction to DSA Time and Space Complexity
  • Basics of Arrays Insertion, Deletion, Traversal Two Pointer Technique Sliding Window Technique
  • Singly Linked List Doubly Linked List Circular Linked List
  • Stack Basics and Applications Problems like Next Greater Element, Min Stack
  • IP uploaded
  • Queue Basics Circular Queue Deque and Its Applications
  • Binary Tree Traversals (Recursive & Iterative) Binary Search Tree Operations
  • BFS and DFS Traversals Topological Sorting Shortest Path Algorithms (Dijkstra, Bellman-Ford) Floyd-Warshall Algorithm Cycle Detection, Bipartite Graphs
  • MinHeap and MaxHeap Priority Queue Applications: K Largest Elements, Top K Frequent Elements
  • Various searching & sorting algos with their applications
  • Backtracking - Concept, N-Queens, Subsets, recursion
  • Basics (Fibonacci, Knapsack etc)

Avatar
Prabhjeet Kaur
Assistant Professor

Prabhjeet Kaur is an experienced educator with over 8 years of teaching experience in Data Structures and Algorithms (DSA) and Design & Analysis of Algorithms (DAA) since 2016. She focuses on building strong problem-solving skills and preparing students for technical interviews and placements. Her students have demonstrated excellence on global platforms, achieving 2nd Runner-Up position at Google Gen AI Hackathons, securing top positions in national-level hackathons, and earning selection in prestigious NASA Bootcamps. These accomplishments reflect a strong emphasis on innovation, practical learning, and global competitiveness. Her teaching methodology emphasizes concept clarity, structured problem-solving, and hands-on coding practice. She mentors students to improve logical thinking, coding efficiency, and confidence in solving interview-level problems. Through this bootcamp, she aims to help students master core DSA concepts, enhance coding skills, and excel in technical interviews and placement opportunities.