skilldevelopment.cpe@lpu.co.in

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 Assistant Professor,CSE With 8+ years of experience shaping future tech leaders, she has been teaching Data Structures & Algorithms (DSA) and Design & Analysis of Algorithms (DAA) since 2016 not just as a subject, but as a core foundation for cracking coding interviews and excelling in real-world problem solving.She has proudly served as Program Leader and Deputy Head of Campus at some of the most reputed institutes, mentoring thousands of students and helping them transform their logic, confidence, and coding mindset.Her classes aren t about theory dumps she connect core concepts with real-world tools, industry expectations, and hands-on challenges to keep things sharp, engaging, and deeply practical.