This second edition of Data Structures Using C has been developed to provide a comprehensive and consistent coverage of both the abstract concepts of data structures as well as the implementation of these concepts using C language. It begins with a thorough overview of the concepts of C programming followed by introduction of different data structures and methods to analyse the complexity of different algorithms. It then connects these concepts and applies them to the study of various data structures such as arrays, strings, linked lists, stacks, queues, trees, heaps, and graphs. The book utilizes a systematic approach wherein the design of each of the data structures is followed by algorithms of different operations that can be performed on them, and the analysis of these algorithms in terms of their running times. Each chapter includes a variety of end-chapter exercises in the form of MCQs with answers, review questions, and programming exercises to help readers test their knowledge.

Introduction -- Array-based lists -- Linked lists -- Skiplists -- Hash tables -- Binary trees -- Random binary search trees -- Scapegoat trees -- Red-black trees -- Heaps -- Sorting algorithms -- Graphs -- Data structures for integers -- External memory searching.

Implementations, as well as interesting, real-world examples of each data structure and algorithm, are shown in the text. Full source code appears on the accompanying disk.

In the computer programming or software development, data structures is one of the most valuable roles for computer engineers. Use of appropriate data structures enables a computer system to perform its task more efficiently, by influencing the ability of computers to store and retrieve data from any location in its memory. This book is about the structure, actions and the principle of a different data type that help improve the ability to write an efficient algorithm, program and Analysis algorithm and programm complexity.

This book starts with the fundamentals of data structures and finally lead to the muchdetailed discussion on the subject. The very first chapter introduces the readers with elementary concepts of C as type conversions, structures, pointers, dynamic memory management, functions, flow-chart, algorithm and fundamental of data structures. This textbook covers the syllabus of Semester College course on data structures. It provides both a strong theoretical base in data structures and an advanced approach to their representation in C. The text is useful to C professionals and programmers, as well as students of any branch of Engineering of graduate and postgraduate courses. The data structures are presented with in the context of complete working programs that have been tested both on a UNIX system and a personal computer using Turbo-C++, Compiler. The code is developed in a top-down fashion, typically with the low-level data structures implementation following the high-level application code. This approach foster good programming habits and makes subject matter more interesting. The book has three goals- to develop a consistent programming methodology, to develop data structures access techniques and to introduce algorithms. The bulk of the text is developed to make a strong hold on data structures. Programming style and development methodology are introduced and its applications are presented. This has the advantage of allowing the reader to concentrate on the data structures, while illustrating how good practices make programming easier.

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 understandability of all algorithms so that the students acquire a firm grasp of the key concepts. This book is recommended in Assam Engineering College, Assam, Girijananda Chowdhury Institute of Management and Technology, Assam, Supreme Knowledge Foundation Group, West Bengal, West Bengal University of Technology (WBUT) for B.Tech. The 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  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. Key Features :  Red-black tree and spray tree are discussed in detail  Includes a new chapter on Sorting  Includes a new chapter on Searching  Includes a new appendix on Analysis of Algorithms for those who may be unfamiliar with the concepts of algorithms  Provides numerous section-wise assignments in each chapter  Also included are exercises—Problems to Ponder—in each chapter to enhance learning The book is suitable for students of : (i) computer science (ii) computer applications (iii) information and communication technology (ICT) (iv) computer science and engineering.