The book is a comprehensive undergraduate-level textbook designed to build a strong foundation in one of the most essential areas of computer science. The book systematically explains how data can be organized, stored, and processed efficiently using well-defined structures and algorithms. Emphasizing the concept of Abstract Data Types (ADTs), the text helps students understand the logical behaviour of data structures independent of their implementation.
Beginning with fundamental concepts, the book progresses through linear data structures such as lists, stacks, and queues, and advances to non-linear structures including trees, graphs, and hashing techniques. It provides in-depth coverage of modern tree structures and graph algorithms, along with a detailed treatment of sorting, searching, and hashing, which are central to efficient algorithm design.
Written in a clear and structured manner, the book balances theory with practical implementation using algorithms, diagrams and C-language programs. It is well suited for university examinations, classroom instruction, and self-learning, making it a valuable resource for undergraduate students pursuing Computer Science and related disciplines.
Sign Up for Newsletter 
