What you'll learn

Data Structures using C++ focuses on organizing and managing data efficiently using object-oriented programming principles. It covers fundamental concepts like arrays, linked lists, stacks, and queues, along with their operations such as insertion, deletion, searching, and traversing. Sorting algorithms like merge sort and quick sort, as well as searching techniques, are explored for optimizing data retrieval. Advanced topics include binary search trees (BST) with traversal techniques and applications, along with graph algorithms like BFS, DFS, Warshall’s Algorithm, and Floyd-Warshall Algorithm. This course equips learners with problem-solving skills essential for competitive programming and real-world applications.

  • Learners will understand OOP fundamentals, data types, control structures, classes, pointers, and complexity analysis in C++.
  • Learners will understand fundamental data structures, array operations, searching, merging, and traversal techniques in C++
  • Learners will understand the basics of linked lists, their types, operations like insertion, deletion, searching, and traversal, along with doubly linked lists and solving standard coding problems.
  • Learners will understand the fundamentals of stacks and queues, their operations, and real-world applications in problem-solving
  • Learners will understand merge sort, quick sort, and binary search trees (BST), including operations, traversals, and real-world applications.
  • Learners will understand graph fundamentals, traversal techniques (BFS, DFS), and shortest path algorithms, including Warshall’s and Floyd-Warshall algorithms.

Dr. Om Prakash Yadav
Associate Professor

Faculty Profile Faculty Name: Dr. Om Prakash Yadav Faculty Designation: Associate Professor Faculty UID: 26121 Faculty Department: School of Computer Science and Engineering Faculty Experience: 20 years