This textbook is written for those who would like to learn C & Data Structures by themselves and become experts on their own steam. The focus is on teaching you the methods and the theory in an easy and understandable manner, that makes you confident. The approach taken in this text is to teach by practice and examples. We have taught the C and Data Structures for several years to graduate and post-graduate students and our experience shows that considerable effort is needed both on the part of instructors and students to cover the entire requisite material. This is mainly due to negligible or no previous knowledge of programming skills available with the student. Hence our C coverage has been extensive and almost on talking terms with you, explaining the details, the art of programming and so on.

In the first chapter itself, we have introduced most of the concepts of C like loops, arrays and structures and even a small program on files. Our idea is that you should become conversant with bare minimum skills to program, so that you can handle laboratory and other works. However, you may proceed to Chapter 2 directly, should you so wish.

In succeeding chapters, we have introduced basics of programming, control loops and functions. Arrays and pointers are dealt with extensively, keeping in view their importance. Concepts like memory management and storage type and pre-processor directives have been explained with the help of programming examples.

Chapters on structures and files have been designed to introduce you to all the concepts involved through examples. Examples are so chosen that each example, while reinforcing your learning, will introduce a new concept. This way we feel the practice and concepts stay with you. We have defined the data structure and its need and linked the concepts to other linear data structures.

Each problem is explained with the help of a diagram, an algorithm, and a function code. The programming style chosen is consistent so as to make the student adept at writing such programs.

Non-linear data structures like trees and graphs have been presented in an easy to understand manner. Each iteration and an event has been explained with an illustration. This text lays importance on understanding the algorithm and program. The chapter on Searching and Sorting will answer all your queries on efficiency of sorting, programming techniques etc.
All the chapters have been provided with running examples.