Advanced Data Structures & Algorithm Analysis

Advanced Data Structures refer to complex and specialized arrangements of data that enable efficient storage, retrieval, and manipulation of information in computer science and programming. These structures go beyond basic data types like arrays and lists, offering sophisticated ways to organize and manage data for optimal performance in various algorithms and applications.

Course Handout

Text Books

1.Computer Algorithms in C++, Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekaran, 2nd Edition University Press

Reference Books:

1. Data Structures and program design in C, Robert Kruse, Pearson Education Asia

2. An introduction to Data Structures with applications, Trembley& Sorenson, McGraw Hill

3. The Art of Computer Programming, Vol.1: Fundamental Algorithms, Donald E Knuth, Addison- Wesley, 1997.

4. Data Structures using C & C++: Langsam, Augenstein &Tanenbaum, Pearson, 1995 Algorithms + Data Structures & Programs: N.Wirth, PHI

5. Fundamentals of Data Structures in C++: Horowitz Sahni& Mehta, Galgottia Pub.

6. Data structures in Java: Thomas Standish, Pearson Education Asia

"The best algorithm is often the one that fits the problem, not the one that looks smartest."

— Robert Sedgewick

Page updated

Google Sites

Report abuse