Fundamentals of Data Structures: Learn, Apply and Build Projects

Course Description

Fundamentals of Data Structures is a 50-hour, 6-week practical course covering programming fundamentals, arrays, linked lists, stacks, queues, recursion, trees, heaps, graphs, searching, sorting, and algorithmic complexity. The course emphasizes hands-on coding, problem-solving, and project development through practical exercises, coding problems, assessments, and real-world projects such as Parking Management, Puzzle Game, and Phonebook applications. Learning Outcomes : Understand data structures and their operations, implement common data structures, apply searching and sorting algorithms, analyze algorithm complexity, solve programming problems efficiently, and develop real-world applications using data structures.

Course Fee Seats Limited

₹2000.00

Course Details

Duration
Duration
50 HRS
Duration
Course Label
SDC
Course Language
English
Duration
Course Mode
Online
Duration
Timings
Mon-Sat : 7 PM to 8 PM and Sun: 5 PM to 7 PM
Days
Monday to Sunday
Registration Till
31 Aug 2026
Duration
Tentative ClassStart Date
1st Week of September
Duration
Eligible Schools:
Certificate Criteria
Certificate Criteria
75% attendance, 50% score in all Exams/CA

Curriculum Snapshot

Explore the comprehensive course modules

1 Basics of Object Oriented Programming

Fundamentals of Programming, Using Data Types, Operators, Control Statements, and Loops Creating and Using Classes, Structures, Pointers and Functions Asymptotic Notations, and Complexity analysis

2 Arrays

Fundamentals of Data Structures Using Array and performing Searching, and Traversing Insertion and Deletion operations in Array Sorting Algorithms and Merging in Array

3 Linked List

Basics of Linked List and it's types Operations on Linked List (Searching and Traversing) Operations on Linked List (Insertion and Deletion) Solving Standard Coding Problems on Array and Linked List

4 Stack, Recursion and Queue

Basics of Stack, Queue and their Operations Fundamentals of Recursion and Solving Recursive Coding Problems Solving Standard Coding Problems on Stacks and Queues

5 Binary Tree, and Graphs

Fundamentals of Binary Tree, Binary Search Tree, and Heap Heap Sort Algorithm Fundamentals of Graphs, Graph Traversal (BFS and DFS) Solving Standard Coding Problems on Trees

6 Project Work

1. Parking Management System 2. Puzzle Game 3. Phonebook Application

Instructor Spotlight

Learn from leading experts in stem cell research

Ravi Kant Sahu

Ravi Kant Sahu

Assistant Professor

Mr. Ravi Kant Sahu is an Assistant Professor at Lovely Professional University, Punjab, India. He holds an M.Tech. from NIT Hamirpur and is qualified in UGC-NET and GATE. He is an Oracle Certified Associate in Java SE 8 Programming. With over 14 years of teaching experience, his expertise includes Java Programming, Data Structures and Algorithms, and Competitive Coding. His research interests include Wireless Sensor Networks, Routing Protocols, and Wireless Computing.

Dr. Om Prakash Yadav

Dr. Om Prakash Yadav

Associate Professor

Dr. Om Prakash Yadav is an Associate Professor at Lovely Professional University, Punjab, India, serving since 2020. He holds a Ph.D. in Computer Science and Engineering from SSSUTMS, Sehore. With over 21 years of teaching experience, his expertise includes Data Structures, C++, Java, Android Development, Computer Networks, and Algorithms. His research interests include IoT, AI, Machine Learning, Data Analytics, Communication Protocols, and Network Security. He has published Scopus-indexed papers and book chapters, UGC CARE articles, patents, and copyrights.