LPU - Lovely Professional University
What you'll learn

CO1 :: understand the concepts of abstract data type and algorithm complexity CO2 :: apply suitable data structure for solving problems CO3 :: examine the working of hashing and collision resolution techniques CO4 :: analyze the performance of various algorithms

  • This module introduces core concepts of data structures and algorithms, including problem-solving approaches and time-space complexity analysis, helping students understand efficiency and performance of different algorithmic solutions.
  • Covers array operations, searching, and sorting techniques along with problem-solving methods like prefix sum and sliding window to develop strong logical thinking and coding skills.
  • Focuses on dynamic memory structures including singly, doubly, and circular linked lists, along with operations, traversal, and real-world problem-solving using linked list techniques.
  • Introduces stack and queue data structures, their implementations, and applications such as expression evaluation, recursion handling, and real-time processing problems.
  • Explains hierarchical data structures including binary trees, BST, and heaps, along with traversal techniques and problem-solving for efficient data organization and retrieval.
  • Covers graph representations, traversal algorithms, hashing techniques, and advanced problem-solving strategies to handle complex data relationships and optimize algorithm performance.

Avatar
Aklesh Kumar
Assistant Professor

Assistant Professor