Data Structures Using C by E Balagurusamy, 2/e

Overview:

Data Structures Using C covers a wide range of data structures courses along with rich variety of pedagogical features and aids. The strength of this book lies in its simple and lucid presentation of the subject which will help beginners in better understanding of the concepts. It adopts a student-friendly approach to the subject matter with many solved and unsolved examples, illustrations and well-structured C programs.

Key Features:

- Expanded coverage with new topics on Strings and Recursion.
- Enhanced coverage on topics like Multiple Stacks, ADT, Heaps, and Topological Sorting.
- Practical applications integrated with each chapter.
- Rich pedagogy containing checkpoints, solved problems, examples, Multiple-choice questions, review questions, and Programming Exercises.
- End-of-chapter problems for university and competitive exams.

About the Book

Data Structures Using C covers a wide range of data structures courses along with rich variety of pedagogical features and aids. The strength of this book lies in its simple and lucid presentation of the subject which will help beginners in better understanding of the concepts. It adopts a student-friendly approach to the subject matter with many solved and unsolved examples, illustrations and well-structured C programs.

Table of content

Chapter 1: C Recap – I
Chapter 2: C Recap – II
Chapter 3: Introduction to Algorithm and Data Structures
Chapter 4: Arrays
Chapter 5: Strings
Chapter 6: Recursion
Chapter 7: Linked Lists
Chapter 8: Stacks
Chapter 9: Queues
Chapter 10: Trees
Chapter 11: Graphs
Chapter 12: Sorting and Searching