Data Structures
Ravi Bhandari
Course specifications
• DS (232001) – 3-0-3-4.5
• Slot A (Mon, Thu, Fri)
• Lab (Fri – 3:30pm)
• Text/Reference Books:
• Introduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald
[Link] and Clifford Stein , PHI
• Data Structures Through C++ by Yashavant Kanetkar, BPB Publications
• Material provided by instructor
What will you learn?
• This course will enable you to appreciate the use of Data structures in
Computer Science.
• Understand and implement Linear and non-linear data structures.
• Select appropriate data structure for your application.
Grading Policy
• Mid Semester Exam – 25%
• End Semester Exam – 30%
• Quizzes (2) – 20%
• Lab exam(s) – 20%
• Class participation – 5%
What are Data Structures
• Data structures are the fundamental building blocks of computer
programming. They define how data is organized, stored, and
manipulated within a program. Understanding data structures is very
important for developing efficient and effective algorithms.
Types of Data Structures
• Linear
• Array
• Linked List
• Stack
• Queue
• Non-linear
• Tree
• Graphs