Data Structures Using C

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

1. Introduction to C

2. Introduction to Data Structures and Algorithms

3. Arrays

4. Strings

5. Structures and Unions

6. Linked Lists

7. Stacks

8. Queues

9. Trees

10. Efficient Binary Trees

11. Multi-way Search Trees

12. Heaps

13. Graphs

14. Searching and Sorting

15. Hashing and Collision

16. Files and Their Organization

About the Author

Reema Thareja, Assistant Professor, Department of Computer Science, Shyama Prasad Mukherjee College for Women, University of Delhi

Reema Thareja is Assistant Professor at the Department of Computer Science, Shyama Prasad Mukherjee College for Women, University of Delhi. She has completed MCA (Software Engineering) and M Phil (Computer Science). She specializes in programming languages, OS, microprocessors, DBMS, multimedia, and web technologies and is currently pursuing research in Requirements Engineering approach to improve Data Warehouse Quality.