This book is the second edition of a text designed for undergraduate engineering courses in Data Structures. The treatment of the subject matter in this second edition maintains the same general philosophy as in the first edition but with significant additions. These changes are designed to improve the readability and understand ability of all algorithms so that the students acquire a firm grasp of the key concepts. This book provides a complete picture of all important data structures used in modern programming practice. It shows: various ways of representing a data structure; different operations to manage a data structure; and, several applications of a data structure. The algorithms are presented in English-like constructs for ease of comprehension by students, though all of them have been implemented separately in C language to test their correctness. Red-black tree and spray tree are discussed in detail. This title includes a new chapter on Sorting; a new chapter on Searching; and, a new appendix on Analysis of Algorithms for those who may be unfamiliar with the concepts of algorithms. It provides numerous section-wise assignments in each chapter. It also includes exercises-Problems to Ponder-in each chapter to enhance learning. This book is suitable for students of computer science, computer applications, information and communication technology (ICT), and computer science and engineering.

Specifications

Common questions