Programming in C By Jignesh Shah

4-6. Function prototyping
(1) No argument, No returntype
(2) No argument, With returntype
(3) With argument, Without returntype
(4) With argument, With returntype
4-7. Passing arguments to a function
(1) Call by value
(2) Call by reference
4-8. Nesting of functions
4-9. Recursion
4-10. Typical Programs
4-11. Macros
Exercises 4

Chapter 5 STORAGE CLASSES

5-1. Introduction
5-2. Types of storage classes
5-3. Automatic variables
5-4. External variable
Difference between external variable definition and declaration
Inherent dangers of external variables
5-5. Static variable
5-6. Register variable
5-7 Multi-file Programming
Rules associated with the use of functions in multi-file
programming
Variables in multi-file programs
How to run multi-file programs
Exercises 5

Chapter 6 ARRAY

6-1. Introduction
6-2. What is an array?
6-3. Defining one-dimensional array
6-4. Initializing arrays
6-5. Processing an array
6-6. Passing array to function
6-7. Two-dimensional arrays
6-8. Initializing two-dimensional arrays
6-9. Array and strings
6-10. Declaration and initialization of strings
6-11. How to input strings?
6-12. How to print strings to the screen?
(1) %s
(2) putchar( )
(3) puts( )
6-13. Finding length of a string
6-14. Copying strings
6-15. Comparison of two strings
6-16. Reversing a string
6-17. Concatenating strings
6-18. String handling functions
(1) String length functions
(2) String copy functions
(3) String compare functions
(4) String reverse functions
(5) String concatenate function
(6) String lower functions
(7) String upper functions
(8) String set function
(9) Bytes swapping function
6-19. Typical programs
Exercises 6

Chapter 7 POINTERS

7-1. Introduction
7-2. What is pointer?
7-3. Declaration and initialization of pointers
(1) char *ch
(2) int *number
(3) float *fptr
7-4. ‘&’ and ‘*’ operators
(1) &
(2) ‘*’
7-5. Pointer and one-dimensional arrays
7-6. Pointer and two-dimensional array
7-7. Dynamic memory allocation
Allocating a block of memory
Freeing the used space
Modifying block size
7-8. Operations on pointers
7-9. Pointer and functions
7-10. Functions returning pointers
Exercises 7

Chapter 8 STRUCTURES AND UNIONS

8-1. Introduction
8-2. Structure declaration
8-3. Dot operator
8-4. How to give values to structure members?
8-5. Structure initialization
8-6. Using unary operators with structures
8-7. Using assignment operator with structure
(1) Assigning complete structure variable to another structure
variable
(2) Assigning values in the individual members of the
structure variable
8-8. Array of structures
8-9. Arrays within structures
8-10. Structures within structures – nested structure
8-11. Structures and functions
8-12. Structures and pointers
How pointers to structure variables declare?
How a structure is accessed using its pointer?
8-13. typedef feature of ‘C’
8-14. Unions
8-15. Typical programs
(1) Structure time
(2) gettime( )
(3) kbhit( )
(4) delay( )
Exercises 8

Chapter 9 WORKING WITH FILES

9-1. Introduction
9-2. Opening a file
9-3. Closing a data-file
9-4. File input/output functions
(1) putc function
(2) getc function
(3) fputc function
(4) fgetc function
(5) fputs function
(6) fgets function
(7) putw function
(8) getw function
(9) fwrite function
(10) fread function
(11) fprintf function
(12) fscanf function

9-5. Opening a file in append mode
9-6. A program to copy a file
9-7. Error handling during file I/O operation
(1) feof( ) function
(2) ferror( ) function
9-8. Movement of file pointer
(1) fseek function
(2) ftell( ) function
(3) rewind function
Exercises 9

Chapter 10 LINK LIST

10-1. Introduction
10-2. Linked list
10-3. Types of linked list
Two way list
Circular linked list
10-4. Basic list operation
10-5. Creating a linked list
10-6. Traversing a linked list
10-7. Searching a linked list
10-8. Insertion into linked list
10-8-1. Insertion at first node in the list
10-8-2. Insertion at last in the list
10-8-3. Insertion at middle in the list
Algorithm for inserting node at middle of the list
Deletion of node at first in link list
Doubly linked linear lists
Steps for Algorithm

Chapter 11 INTRODUCTION TO OBJECT ORIENTED
PROGRAMMING

11-1. Introduction
11-2. Needs for object oriented programming
(1) Procedural languages
(2) Division into functions
(3) Problems with structured programming
(4) Data undervalued
(5) Relationship to the real world
(6) New data types
11-3. Object Oriented Approach
11-4. Characteristics of OOP language
(1) Classes & objects
(2) Data abstraction and encapsulation
(3) Inheritance
(4) Polymorphism and overloading

(5) Creating new data types
11-5. Something about C++
(1) cout – output operator
(2) cin – input operator
11-6. Examples on C++
Exercises 11

Chapter 12 SPECIAL PROGRAMS

Appendix A FLOWCHART AND ALGORITHM

A-1. Introduction
A-2. Algorithm
A-3. Characteristics
A-4. Flowchart
A-5. Flowchart symbols
(1) Input & output
(2) Processor
(3) Terminal
(4) Decision maker
(5) Connecter
A-6. Computer flowcharting symbols
A-7. Arithmetic operators and comparators
A-8. Typical flowcharts

Appendix B BIT OPERATORS

B-1. Introduction
B-2. Bitwise operators
B-3. Bitwise logical operators
(1) Bitwise AND operator
(2) Bitwise OR operator
(3) Bitwise exclusive OR
B-4. Bitwise shift operators
(1) Left shift operator
(2) Right shift operators
B-5. Bitwise complement operator

Appendix C ASCII CHARACTER SET TABLE

C-1. Control character set
C-2. Printing character set
C-3. Extended ASCII character set

Appendix DOPERATORS PRECEDENCE TABLE

Appendix ESTANDARD LIBRARY FUNCTIONS

E-1. alloc.h E-7. graphics.h
E-2. conio.h E-8. math.h
E-3. ctype.h E-9. stdio.h
E-4. dir.h E-10.stdlib.h
E-5. dos.h E-11.String.h
E-6. io.h E-12.time.h

Index