LPU - Lovely Professional University
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 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. This course equips learners with problem-solving skills essential for competitive programming and real-world applications.

  • Basics of Stack & Operations on Stack Basics of Queue & Operations on Queue Applications of Stack & Queue Project - 2
  • Merge sort, Quick sort Binary Search Tree: introduction, searching, insertion and deletion Binary Search Tree : In-order traversal, Pre-order traversal, Post-order traversal using recursion Application based on Binary Search Tree (BST)
  • introduction of graph, BFS, DFS Warshall’s Algorithm Floyd Warshall Algorithm modified Warshall algorithm Project - 3
  • Fundamentals of Object Oriented Programming Using Data Types, Operators, Control Statements, and Loops Creating and Using Classes, Structures, Pointers and Functions Asymptotic Notations, and Complexity analysis
  • Fundamentals of Data Structures, performing Searching, and Traversing in Array Insertion and Deletion operations in Array Sorting Algorithms and Merging in Array Project - 1
  • Basics of Linked List and it's types Operations on Linked List (Insertion and Deletion) Operations on Linked List (Searching and Traversing) Solving Standard Coding Problems on Array and Linked List

Avatar
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