Most books on C and Data Structures cover theoretical concepts without program implementation. It

is the intention of this book to provide the learning material on C and Data Structures with basics

together with programs to beginners in an understandable and easy manner.

This book is meant for the students of Computer Science and Engineering and Electronics

Engineering of Anna University, Chennai. The contents are designed exclusively as per the Computer

Science and Engineering syllabus. In addition, the contents will be useful to Electronics Engineering

students. Except Pascal, learning material on C and Data Structures has been provided for Electronics

students.

This book is also helpful in other streams such as BCA, MCA, as well as for students of diploma and

and basics of C program. In addition, the reader is exposed to the classification of algorithms and

introduction to programming techniques. The role of interpreter, compiler and the distinction between

them is also described in this chapter. Mention is also made of the various sections of a C program and

the rules that should be adopted while writing a program. The distinction between iteration and

recursion is made as well.

Chapter 2 exposes the reader to the fundamentals of C. Different types of characters such as Letters,

Digits, White space, and Special Characters are described. Various delimiters used with C statements,

keywords, and identifiers are also explained. Different constants, variables, and data types to be used

in C are narrated. The rules for defining and initializing variables are explained.

Chapter 3 explains the various operators with their priorities. The use of comma and conditional

their nested use. The supporting statements, break, cont inue, and goto, are also illustrated.

Chapter 6 is devoted to loop statements, that is, for loop, while loop and do-while loop. The limitations

of do-while loop and the while loop are covered.

C apter 7 explains declaration and initialization of arrays. It covers one-, two-, three-, and multi-

d tensional arrays. The characteristics of arrays are explained at the beginning of this chapter. The

functions scanf () and sprint f () are also discussed with suitable examples. These two functions are

used for reading data from array and writing data to array.

Chapter 8 covers detail and initialization of strings. The various formats for display of strings are

described. The standard string functions are illustrated with numerous examples. The application of

function as an argument is also described. The reader can follow the concepts of functions by executing

programs as illustrated in this chapter. The recursive nature of functions is also explained with

suitable examples.

Chapter 11 throws lijfhf on various pre-defined macros in ANSI and Turbo C as well as user-defined

macros. It consists of # defin e, #undef, # in clu de, # lin e, token pasting and stringizing operator and

At the end, various macros defined in header file s t d i o . h and ctyp e. h are explained.

Chapter 12 is an important chapter since it contains various features of structures and unions. Features

of structure with their declaration and initialization are described. The use of dot (.) and arrow (->)

operators is explained with examples. The operation of structure with function, pointer, array and the

with simulation of various MS-DOS commands are elaborated. The I/O redirections for storing data

from programs and sending data to programs are explained.

Chapter 14 introduces data structures. It covers description of static and dynamic linked lists. The

insertion, deletion, merging, and searching operations on elements with the help of these linked list

techniques have been explained.The data structure stack and queue with their representation and

implementations are illustrated. Types of linked list such as single and double linked list are explained

with numerous examples.

Chapter 15 explains non-linear data structure and its types such as trees and binary trees. The traversing

of binary tree and binary search tree with representation and implementation is elaborated. In the end

various hashing techniques are explained. Programs are provided for understanding non-linear data

Ashok N. Kamthane