adsa course 1

ADSA Course (Advanced Data Structures & Algorithms)

Swarnandhra College of Engineering and Technology, 2025-2026

Syllabus

Course Objectives

• Provide knowledge on advanced data structures frequently used in Computer Science.
• Develop skills in algorithm design techniques.
• Understand the use of various data structures in algorithm design.

Course Outcomes

• CO1: Discover the performance of an algorithm using asymptotic notation.
• CO2: Use divide and conquer technique to solve problems.
• CO3: Understand greedy and dynamic programming techniques.
• CO4: Recognize problems suitable for backtracking, branch and bound solutions.
• CO5: Understand the complexity classes NP-Hard and NP-Complete.

Units

UNIT I: Algorithm Analysis, AVL Trees, B-trees, B+ trees

UNIT I: Algorithm Analysis, AVL Trees, B-trees, B+ trees

• Algorithm Analysis, AVL Trees – Creation, Insertion, Deletion operations and Applications.
• B-trees – Creation, Insertion, Deletion operations and Applications.
• B+ trees – Creation, Insertion, Deletion operations and Applications.

Lab Programs

Program 1: Construct an AVL tree and implement insert and delete operations

Program 2: Construct a B-Tree and implement searching, insertion, and deletion

Materials

Textbooks

• Fundamentals of Data Structures in C++, Horowitz, Ellis; Sahni, Sartaj.
• Computer Algorithms/C++, Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekaran.

Reference Books

• Data Structures and Program Design in C, Robert Kruse, Pearson Education Asia.
• The Art of Computer Programming, Vol. 1, Donald E Knuth, Addison-Wesley.

© 2025 Swarnandhra College of Engineering and Technology. All Rights Reserved.