Data Structures Using C, 2nd Edition

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.

Table of Contents

Chapter 1. Introduction to C
Chapter 2. Introduction to Data Structures and Algorithms
Chapter 3. Arrays
Chapter 4. Strings
Chapter 5. Structures and Unions
Chapter 6. Linked Lists
Chapter 7. Stacks
Chapter 8. Queues
Chapter 9. Trees
Chapter 10. Efficient Binary Trees
Chapter 11. Multi-way Search Trees
Chapter 12. Heaps
Chapter 13. Graphs
Chapter 14. Searching and Sorting
Chapter 15. Hashing and Collision
Chapter 16. Files and Their Organization
Appendix A: Memory Allocation in C Programs
Appendix B: Garbage Collection
Appendix C: Backtracking
Appendix D: Josephus Problem
Appendix E: File Handling in C
Appendix F: Address Calculation Sort
Appendix G: Answers