skilldevelopment.cpe@lpu.co.in

What you'll learn

The course "Fundamentals of Data Structures: Learn, Apply, and Build Projects" is an intensive 6-week summer training designed to equip students with a solid understanding of fundamental data structures and their applications. This course focuses on both theoretical concepts and practical implementation using C++/Java. Participants will explore essential data structures such as arrays, linked lists, stacks, queues, trees, and graphs while applying them to real-world problems. By the end of the course, students will have hands-on experience of building projects that leverage data structures for efficient problem-solving. Whether you’re preparing for coding interviews, competitive programming, or software development roles, this course will provide the essential foundation and confidence to tackle complex data challenges. Learning Outcomes: By the end of this training, participants will be able to: Understand Core Data Structures – Learn the fundamental concepts, operations, and use cases of arrays, linked lists, stacks, queues, trees, and graphs. Implement Data Structures Efficiently – Write efficient code to implement various data structures from scratch. Analyze Time and Space Complexity – Understand and apply Big-O notation to evaluate the efficiency of different data structures. Apply Data Structures in Problem-Solving – Use data structures to solve real-world problems, including searching, sorting, and optimizing performance in applications. Develop Hands-On Projects – Build mini-projects that demonstrate the practical applications of data structures in software development. Prepare for Technical Interviews – Gain problem-solving techniques and coding strategies to excel in technical job interviews and competitive programming. This course is ideal for students, aspiring developers, and professionals looking to strengthen their foundational programming skills and apply them to real-world challenges.

  • Student will learn the basic concepts of Linked Kist, insertion/ deletion and Searching operations on Linked List and Solving Coding Problems based on that.
  • Student will learn the basic concepts of Stacks, Queues and apply them in solving the statndard coding problems.
  • Student will understand the Basics of Trees and Graphs and use them in solving some coding problems.
  • Student will apply the data structure concepts in developing small projects.
  • Introduction to programming fundamentals, control structures, and object-oriented concepts. Covers problem-solving techniques, modular programming, and performance analysis using time and space complexity.
  • Focus on array data structure including operations like traversal, searching, insertion, deletion, and basic sorting techniques with practical implementation.
  • Introduction to linked lists and their types, along with operations and hands-on coding practice. Includes assessment through MCQ-based test.
  • Covers linear data structures like stack and queue, recursion techniques, and problem-solving approaches using these concepts.
  • Introduction to hierarchical and non-linear data structures, including tree traversal, heap operations, and graph traversal algorithms.
  • Application of learned concepts through project-based learning, focusing on real-world problem-solving and implementation skills.
  • Student will learn Basic Object Oriented Programming skills
  • Student will learn the basic concepts of Arrays, various operations on Array and Solving Coding Problems based on that.

Avatar
Ravi Kant Sahu
Assistant Professor

Ravi Kant Sahu is an Assistant Professor at the School of Computing and Artificial Intelligence, Lovely Professional University, with over 14 years of teaching experience. He holds an M.Tech. in Computer Science from NIT Hamirpur and is GATE and UGC NET qualified. He is also an Oracle Certified Associate, Java SE 8 Programmer. His expertise includes Data Structures, Java Programming, and Competitive Coding, and he has actively contributed to student mentoring and technical training.