LPU - Lovely Professional University
What you'll learn

From syntax confusion to problem-solving confidence: This course is a focused bridge between academic exposure and practical coding confidence. It is specially curated for students who have studied C++ and Data Structures before, but still struggle to write programs independently, debug errors, understand memory behavior, and apply DS concepts in real problems. • Rebuilds weak fundamentals through guided coding rather than theory-heavy revision. • Moves naturally from C++ syntax and logic into algorithms, then into data structures. • Uses two-hour lab slots so every concept becomes a working program. • Prepares students for lab exams, internships, placements, and advanced DSA learning. Key Takeaways: 1 Logic Building: Break a problem into input, process, output, cases, dry run, and final code. 2 C++ Foundation: Write cleaner programs using conditions, loops, functions, arrays, strings, classes, and pointers. 3 Memory Confidence: Understand references, pointers, dynamic memory, recursion, and linked-node thinking. 4 Algorithmic Skill: Analyze time and space complexity; implement searching and sorting with confidence. 5 DS Implementation: Build stacks, queues, linked lists, trees, hashing basics, and graph traversals using C++. 6 Career Readiness: Improve readiness for lab exams, placement rounds, internships, and project-based assessments.

  • Structure of a C++ program; input/output operations; variables and data types; operators and expressions; conditional statements; loops; nested loops and pattern problems; debugging common errors; flowchart-based logic building.
  • Functions and modular programming; pass by value vs reference; 1D and 2D arrays; strings and string manipulation; memory introduction; pointers and pointer arithmetic; dynamic memory allocation; recursion fundamentals.
  • Classes and objects; constructors and destructors; encapsulation; inheritance; polymorphism; function overloading; operator overloading; simple class-based modeling.
  • Time and space complexity; linear search; binary search; bubble, selection, insertion, and merge sort; recursion-based problem solving; problem-solving strategies; coding interview-style questions.
  • Introduction to data structures; arrays as DS; stack implementation; queue and circular queue; singly and doubly linked lists; stack and queue applications; expression evaluation.
  • Trees and binary trees; binary search tree; tree traversals; heap basics; hashing concepts; graph representation; BFS and DFS introduction; STL basics: vector, stack, queue, map.

Avatar
Sumit Mittu
Assistant Professor

Mr. Sumit Mittu, Assistant Professor in School of Computer Science and Engineering, Lovely Professional University, is strong academician with 20+ years of experience in teaching as well as academic administration who also served as Deputy Director with Division of Career Services (LPU). He is a proud recipient of Best Faculty award from Cognizant Technology Solutions. He is also awarded Teacher Appreciation Award (Best Faculty) award by LPU. He is also a He has trained thousands of undergraduate and post-graduate students with skills of programming using several languages like C/C++, Java, Python, VB, C#, SQL, HTML, JS, ASP, etc. as well as contributed in building strong foundation in students for core computer science courses including but not limited to Data Structures, Operating Systems, Computer Networks, DBMS, Data Analytics etc. He is the author of the book “A Workbook on C++” published by Cengage Learning. He has also delivered several guest lectures and FDPs on topics like e-learning, smart teaching, computer programming etc. He has a strong hold on handling data for diversified application areas and problems statements over academia and understands the career expectation of the recruiters and skill gap in students.