LPU - Lovely Professional University
What you'll learn

Data Structures, Algorithms & Problem Solving Masterclass is a comprehensive industry-oriented course designed to build strong programming and logical thinking skills required for coding interviews, competitive programming, and software development. The course covers fundamental to advanced topics including arrays, searching, sorting, linked lists, stacks, queues, trees, graphs, recursion, hashing, and dynamic programming with hands-on coding practice and real-world problem-solving techniques. Students will learn how to optimize solutions using brute force, better, and optimal approaches while improving time and space complexity analysis skills. The program also includes coding challenges inspired by platforms like LeetCode and Codeforces to help learners become placement-ready and confident problem solvers.

  • Basics of Data Structures, Classification of Data Structures (Linear and Non-linear), Abstract Data Types , Introduction to Algorithms, Time Complexity, Space Complexity, Asymptotic Notations (Big-O, Theta, Omega), Algorithmic Trade-offs
  • Array Representation in Memory, Array Traversal, Insertion and Deletion in Arrays, Linear Search, Binary Search (Iterative and Recursive), Bubble Sort, Selection Sort, Insertion Sort, Comparison of Sorting Algorithms, Problem Solving using Arrays
  • Introduction to Linked Lists, Singly Linked List, Doubly Linked List, Circular Linked List, Header Linked List, Insertion in Linked List, Deletion in Linked List, Traversal of Linked List, Applications of Linked Lists
  • Stack Concept and Operations (Push, Pop, Peek), Stack Implementation using Array and Linked List, Applications of Stack (Expression Evaluation, Infix to Postfix), Queue Concept and Operations, Simple Queue, Circular Queue, Priority Queue, Deque (Double Ended Queue), Applications of Queue
  • Recursion Basics, Recursive Problem Solving, Tower of Hanoi, Tree Terminology, Types of Trees, Binary Tree Representation, Tree Traversals (Inorder, Preorder, Postorder), Binary Search Tree (Insertion, Deletion, Searching), AVL Trees and Rotations
  • Heaps (Min Heap and Max Heap), Heap Sort, Graph Representation (Adjacency Matrix and List), Breadth First Search (BFS), Depth First Search (DFS), Shortest Path Algorithms (Dijkstra, Floyd-Warshall), Hashing, Hash Functions, Collision Resolution Techniques

Avatar
Dr. Vijay Kumar Garg
Professor

A respected academician and HOD(Programming-I), Dr. Vijay Kumar Garg has been actively involved in teaching, mentoring, and academic leadership for over 15 years. His expertise spans multiple core areas of computer science, and he is passionate about building strong foundations through hands-on projects and interactive learning. Dr. Garg is also involved in fostering industry-academic collaboration to enhance student readiness for the real world.