1st BSC C Programming Notes
1st BSC C Programming Notes
LECTURE NOTE
on
PROGRAMMING IN “C”
COURSE :BCA I-Sem
By
Asst. Professor Shweta V D
SYLLABUS
Module –I
C Language Fundamentals.
Character set, Identifiers, keyword, data types, Constants and variables, statements, expression,
operators, precedence of operators, Input-output, Assignments, control structures decision
making and branching.
Module -II
Module –III
Pointers, Structures, Unions, File handling:
Pointer variable and its importance, pointer arithmetic, passing parameters, Declaration of structures,
pointer to pointer, pointer to structure, pointer to function, union, dynamic memory allocation, file
managements.
CONTENTS
Module: 1
Lecture 1: Introduction to C
Module: 2
Module: 3
Lecture 24: size of Structure in, array vs structure, array within structure
Lecture 25: passing structure to function, Nested Structure
Lecture 32:
Lecture 33:
Lecture Note: 1
Introduction to C
3*Under revision
ANSI C standard emerged in the early 1980s, this book was split into two titles:
The original was still called Programming in C, and the title that covered ANSI C
was called Programming in ANSI C. This was done because it took several years
for the compiler vendors to release their ANSI C compilers and for them to
become ubiquitous. It was initially designed for programming UNIX operating
system. Now the software tool as well as the C compiler is written in C.
Major parts of popular operating systems like Windows, UNIX, Linux is still
written in C. This is because even today when it comes to performance (speed of
execution) nothing beats C. Moreover, if one is to extend the operating system to
work with new devices one needs to write device driver programs. These programs
are exclusively written in C. C seems so popular is because it is reliable, simple
and easy to use. often heard today is – “C has been already superceded by
languages like C++, C# and Java.
Program
level language:
Low level languages are machine level and assembly level language. In
machine level language computer only understand digital numbers i.e. in the form
of 0 and 1. So, instruction given to the computer is in the form binary digit, which
is difficult to implement instruction in binary code. This type of program is not
portable, difficult to maintain and also error prone. The assembly language is on
other hand modified version of machine level language. Where instructions are
given in English like word as ADD, SUM, MOV etc. It is easy to write and
understand but not understand by the machine. So the translator used here is
assembler to translate into machine level. Although language is bit easier,
programmer has to know low level details related to low level language. In the
5*Under revision
assembly level language the data are stored in the computer register, which varies
for different computer. Hence it is not portable.
Compiler and interpreter are used to convert the high level language into machine
level language. The program written in high level language is known as source
program and the corresponding machine level language program is called as object
program. Both compiler and interpreter perform the same task but there working is
different. Compiler read the program at-a-time and searches the error and lists
them. If the program is error free then it is converted into object program. When
program size is large then compiler is preferred. Whereas interpreter read only one
line of the source code and convert it to object code. If it check error, statement by
statement and hence of take more time.
On Mac OS X, CodeWarrior and Xcode are two IDEs that are used by many
programmers. Under Windows, Microsoft Visual Studio is a good example of a
popular IDE. Kylix is a popular IDE for developing applications under Linux.
Most IDEs also support program development in several different programming
languages in addition to C, such as C# and C++.
Lecture Note: 2
1 ) Comment line
2) Preprocessor directive
4) main function( )
Local variables;
Statements;
Comment line
/*……………………………..*/
Comment line is used for increasing the readability of the program. It is useful in
explaining the program and generally used for documentation. It is enclosed within
the decimeters. Comment line can be single or multiple line but should not be
nested. It can be anywhere in the program except inside string constant & character
constant.
Preprocessor Directive:
7*Under revision
This is the section where variable are declared globally so that it can be access by
all the functions used in the program. And it is generally declared outside the
function :
main()
It is the user defined function and every function has one main() function from
where actually program is started and it is encloses within the pair of curly braces.
The main( ) function can be anywhere in the program but in general practice it is
placed in the first position.
Syntax :
main()
……..
……..
……..
int main( )
return 0
The main function does not return any value when void (means null/empty) as
Output: C language
The program execution start with opening braces and end with closing brace.
And in between the two braces declaration part as well as executable part is
mentioned. And at the end of each line, the semi-colon is given which indicates
statement termination.
#include <stdio.h>
return 0;
9*Under revision
on a particular computer system. Figure below shows the steps that are involved in
entering, compiling, and executing a
computer program developed in the C programming language and the typical Unix
commands that would be entered from the command line.
Step 1: The program that is to be compiled is first typed into a file on the
computer system. There are various conventions that are used for naming files,
typically be any name provided the last two characters are “.c”or file with
extension .c. So, the file name prog1.c might be a valid filename for a C program.
A text editor is usually used to enter the C program into a file. For example, vi is a
popular text editor used on Unix systems. The program that is entered into the file
is known as the source programbecause it represents the original form of the
program expressed in the C language.
Step 2: After the source program has been entered into a file, then proceed to have
it compiled. The compilation process is initiated by typing a special command on
the system. When this command is entered, the name of the file that contains the
source program must also be specified. For example, under Unix, the command to
initiate program compilation is called cc. If we are using the popular GNU C
compiler, the command we use is gcc.
In the first step of the compilation process, the compiler examines each program
statement contained in the source program and checks it to ensure that it conforms
to the syntax and semantics of the language. If any mistakes are discovered by the
compiler during this phase, they are reported to the user and the compilation
process ends right there. The errors then have to be corrected in the source program
(with the use of an editor), and the compilation process must be restarted. Typical
errors reported during this phase of compilation might be due to an expression that
has unbalanced parentheses (syntactic error), or due to the use of a variable that is
not “defined” (semantic error).
Step 3: When all the syntactic and semantic errors have been removed from the
program, the compiler then proceeds to take each statement of the program and
translate it into a “lower” form that is equivalent to assembly language program
needed to perform the identical task.
Step 4: After the program has been translated the next step in the compilation
process is to translate the assembly language statements into actual machine
instructions. The assembler takes each assembly language statement and converts it
into a binary format known as object code, which is then written into another file
on the system. This file has the same name as the source file under Unix, with the
last letter an “o” (for object) instead of a “c”.
Step 5: After the program has been translated into object code, it is ready to be
linked.This process is once again performed automatically whenever the cc or gcc
command is issued under Unix. The purpose of the linking phase is to get the
program into a final form for execution on the computer.
Step 6: To subsequently execute the program, the command a.outhas the effect of
loading the program called a.out into the computer’s memory and initiating its
execution.
11*Under revision
known as input, the program temporarily suspends its execution so that the input
can be entered. Or, the program might simply wait for an event, such as a mouse
being clicked, to occur. Results that are displayed by the program, known as
output, appear in a window, sometimes called the console. If the program does not
produce the desired results, it is necessary to go back and reanalyze the program’s
logic. This is known as the debugging phase, during which an attempt is made to
remove all the known problems or bugsfrom the program. To do this, it will most
13*Under revision
#include <stdio.h>
int v1, v2, sum; //v1,v2,sum are variables and int is data type declared
return 0;
Output:
Lectu
re Note: 3
Character set
15*Under revision
The alphabets, numbers and special symbols when properly combined form
constants, variables and keywords.
Identifiers
Identifiers are user defined word used to name of entities like variables, arrays,
functions, structures etc. Rules for naming identifiers are:
1) name should only consists of alphabets (both upper and lower case), digits
and underscore (_) sign.
2) first characters should be alphabet or underscore
3) name should not be a keyword
4) since C is a case sensitive, the upper case and lower case considered
differently, for example code, Code, CODE etc. are different identifiers.
5) identifiers are generally given in some meaningful name such as value,
net_salary, age, data etc. An identifier name may be long, some
implementation recognizes only first eight characters, most recognize 31
characters. ANSI standard compiler recognize 31 characters. Some invalid
identifiers are 5cb, int, res#, avg no etc.
Keyword
There are certain words reserved for doing specific task, these words
are known as reserved word or keywords. These words are predefined and always
written in lower case or small letter. These keywords cann’t be used as a variable
name as it assigned with fixed meaning. Some examples are int, short, signed,
unsigned, default, volatile, float, long, double, break, continue, typedef, static,
do, for, union, return, while, do, extern, register, enum, case, goto, struct,
char, auto, const etc.
data types
Data types refer to an extensive system used for declaring variables or functions of
different types before its use. The type of a variable determines how much space it
occupies in storage and how the bit pattern stored is interpreted. The value of a
variable can be changed any time.
17*Under revision
When the qualifier unsigned is used the number is always positive, and when
signed is used number may be positive or negative. If the sign qualifier is not
mentioned, then by default sign qualifier is assumed. The range of values for
signed data types is less than that of unsigned data type. Because in signed type,
the left most bit is used to represent sign, while in unsigned type this bit is also
used to represent the value. The size and range of the different data types on a 16
bit machine is given below:
Basic data Data type with type Size Range
type qualifier (byte)
char char or signed char 1 -128 to 127
Unsigned char 1 0 to 255
int int or signed int 2 -32768 to 32767
unsigned int 2 0 to 65535
short int or signed short 1 -128 to 127
int unsigned short int long 1 0 to 255
int or signed long int 4 -2147483648 to 2147483647
unsigned long int 4 0 to 4294967295
float float 4 -3.4E-38 to 3.4E+38
double double Long 8 1.7E-308 to 1.7E+308
double 10 3.4E-4932 to 1.1E+4932
Lecture Note: 4
Constants
19*Under revision
In decimal constant first digit should not be zero unlike octal constant first digit
must be zero(as 076, 0127) and in hexadecimal constant first two digit should be
0x/ 0X (such as 0x24, 0x87A). By default type of integer constant is integer but if
the value of integer constant is exceeds range then value represented by integer
type is taken to be unsigned integer or long integer. It can also be explicitly
mention integer and unsigned integer type by suffix l/L and u/U.
Real constant is also called floating point constant. To construct real constant we
must follow the rule of ,
-real constant must have at least one digit.
-It must have a decimal point.
-It could be either positive or negative.
-Default sign is positive.
-No commas or blanks are allowed within a real constant. Ex.: +325.34 426.0
-32.76
Character constant
String constant
Set of characters are called string and when sequence of characters are enclosed
within a double quote (it may be combination of all kind of symbols) is a string
constant. String constant has zero, one or more than one character and at the end of
the string null character(\0) is automatically placed by compiler. Some examples
are “,sarathina” , “908”, “3”,” ”, “A” etc. In C although same characters are
enclosed within single and double quotes it represents different meaning such as
“A” and ‘A’ are different because first one is string attached with null character at
the end but second one is character constant with its corresponding ASCII value is
65.
Symbolic constant
Symbolic constant is a name that substitute for a sequence of characters and,
characters may be numeric, character or string constant. These constant are
generally defined at the beginning of the program as
#define MAX 10
#define CH ‘b’
Variables
Variable is a data name which is used to store some data value or symbolic names
for storing program computations and results. The value of the variable can be
change during the execution. The rule for naming the variables is same as the
naming identifier. Before used in the program it must be declared. Declaration of
variables specify its name, data types and range of the value that variables can
store depends upon its data types.
21*Under revision
Syntax:
int a;
char c;
float f;
Variable initialization
When we assign any initial value to variable during the declaration, is called
initialization of variables. When variable is declared but contain undefined value
then it is called garbage value. The variable is initialized with the assignment
operator such as
Or int a;
a=20; statements
Lecture Note: 5
Expressions
a==b // logical
func(a, b) // function call
Expressions consisting entirely of constant values are called constant expressions.
So, the expression 121 + 17 - 110
Operator
This is a symbol use to perform some operation on variables, operands or with the
constant. Some operator required 2 operand to perform operation or Some
required single operation.
Several operators are there those are, arithmetic operator, assignment, increment ,
decrement, logical, conditional, comma, size of , bitwise and others.
1. Arithmatic Operator
This operator used for numeric calculation. These are of either Unary arithmetic
operator, Binary arithmetic operator. Where Unary arithmetic operator required
only one operand such as +,-, ++, --,!, tiled. And these operators are addition,
subtraction, multiplication, division. Binary arithmetic operator on other hand
required two operand and its operators are +(addition), -(subtraction),
*(multiplication), /(division), %(modulus). But modulus cannot applied with
floating point operand as well as there are no exponent operator in c.
Unary (+) and Unary (-) is different from addition and subtraction.
When both the operand are integer then it is called integer arithmetic and the result
is always integer. When both the operand are floating point then it is called floating
arithmetic and when operand is of integer and floating point then it is called mix
type or mixed mode arithmetic . And the result is in float type.
2.Assignment Operator
A value can be stored in a variable with the use of assignment operator. The
assignment operator(=) is used in assignment statement and assignment expression.
Operand on the left hand side should be variable and the operand on the right hand
23*Under revision
side should be variable or constant or any expression. When variable on the left
hand side is occur on the right hand side then we can avoid by writing the
compound statement. For example,
int x= y;
int Sum=x+y+z;
The Unary operator ++, --, is used as increment and decrement which acts upon
single operand. Increment operator increases the value of variable by
one .Similarly decrement operator decrease the value of the variable by one. And
these operator can only used with the variable, but cann't use with expression and
constant as ++6 or ++(x+y+z).
It again categories into prefix post fix . In the prefix the value of the variable is
incremented 1st, then the new value is used, where as in postfix the operator is
written after the operand(such as m++,m--).
EXAMPLE
let y=12;
z= ++y;
y= y+1;
z= y;
Similarly in the postfix increment and decrement operator is used in the operation .
And then increment and decrement is perform.
EXAMPLE
let x= 5;
y= x++;
y=x; x=
x+1;
4.Relational Operator
a.(a>=b) || (b>20)
c. 0(b!=7)
5. Conditional Operator
SYNTAX
Here exp1 is first evaluated. It is true then value return will be exp2 . If false then
exp3.
EXAMPLE
(a>b) ? a:b;
printf(“value is:%d”);
Output:
25*Under revision
Value is:10
6. Comma Operator
EXAMPLE
int i, j, k, l;
for(i=1,j=2;i<=5;j<=10;i++;j++)
7. Sizeof Operator
Size of operator is a Unary operator, which gives size of operand in terms of byte
that occupied in the memory. An operand may be variable, constant or data type
qualifier.
EXAMPLE
main( )
{ int
sum;
float f;
Lecture Note: 6
8. Bitwise Operator
Bitwise operator permit programmer to access and manipulate of data at bit level.
Various bitwise operator enlisted are one's complement (~) bitwise
AND (&) bitwise OR (|) bitwise XOR
(^) left shift (<<) right shift (>>)
These operator can operate on integer and character value but not on float and
double. In bitwise operator the function showbits( ) function is used to display the
binary representation of any integer or character value.
In one's complement all 0 changes to 1 and all 1 changes to 0. In the bitwise OR its
value would obtaining by 0 to 2 bits.
It operate on 2operands and operands are compared on bit by bit basic. And hence
both the operands are of same type.
Operator used with one or more operand and return either value zero (for false) or
one (for true). The operand may be constant, variables or expressions. And the
expression that combines two or more expressions is termed as logical expression.
C has three logical operators :
Operator Meaning
&& AND
|| OR
! NOT
27*Under revision
Where logical NOT is a unary operator and other two are binary operator. Logical
AND gives result true if both the conditions are true, otherwise result is false. And
logial OR gives result false if both the condition false, otherwise result is true.
[] array subscript
arrow operator
. dot operator
---------------------------------------------------------------------------------------------------
+ unary plus 2 right to left
- unary minus
++ increment
- - decrement
! logical not
~ 1’s complement * indirection&address (data
type) type cast sizeofsize in byte
- subtraction
----------------------------------------------------------------------------------------------------
<<left shift 5 left to right
>>right shift
---------------------------------------------------------------------------------------------------
<= less than equal to 6 left to right
>= greater than equal to
<less than
>greater than
----------------------------------------------------------------------------------------------------
== equal to 7 left to right
!=not equal to
----------------------------------------------------------------------------------------------------
&bitwise AND 8 left to right
----------------------------------------------------------------------------------------------------
^ bitwise XOR9 left to right
--------------------------------------------------------------------------------------------------|
bitwise OR10 left to right
&&logical AND11 || logical OR12
?:conditional operator 13
----------------------------------------------------------------------------------------------------
=, *=, /=, %= assignment operator 14 right to left
&=, ^=, <<= >>=
---------------------------------------------------------------------------------------------------
, comma operator 15
----------------------------------------------------------------------------------------------------
Lecture Note: 7
Control Statement
Loops in C
Syntax:-
while(condition)
Statement 1;
Statement 2;
Or while(test condition)
Statement;
The test condition may be any expression .when we want to do something a fixed
no of times but not known about the number of iteration, in a program then while
loop is used.
Here first condition is checked if, it is true body of the loop is executed else, If
condition is false control will be come out of loop.
Example:-
#include<stdio.h>
void main()
int p=1;
While(p<=5)
printf(“Welcome to C\n”);
P=p+1;
}
}
Output: Welcome to C
Welcome to C
Welcome to C
Welcome to C
Welcome to C
So as long as condition remains true statements within the body of while loop will
get executed repeatedly.
do while loop
This (do while loop) statement is also used for looping. The body of this loop may
contain single statement or block of statement. The syntax for writing this
statement is:
Syntax:-
31*Under revision
Do
Statement; }
while(condition);
Example:#include
<stdio.h> void
do
Printf(“%d”,X);
X=X+1;
}whie(X<=10);
Printf(“ ”);
Output: 4 5 6 7 8 9 10
Here firstly statement inside body is executed then condition is checked. If the
condition is true again body of loop is executed and this process continue until the
condition becomes false. Unlike while loop semicolon is placed at the end of
while.
There is minor difference between while and do while loop, while loop test the
condition before executing any of the statement of loop. Whereas do while loop
test condition after having executed the statement at least one within the loop.
If initial condition is false while loop would not executed it’s statement on other
hand do while loop executed it’s statement at least once even If condition fails for
first time. It means do while loop always executes at least once. Notes:
Do while loop used rarely when we want to execute a loop at least once.
Lecture Note: 8
for loop
In a program, for loop is generally used when number of iteration are known in
advance. The body of the loop can be single statement or multiple statements. Its
syntax for writing is:
Syntax:-
for(exp1;exp2;exp3)
Statement;
Or
33*Under revision
Statement;
int i;
for(i=1;i<10;i++)
Printf(“ %d ”, i);
Output:-1 2 3 4 5 6 7 8 9
Nesting of loop
When a loop written inside the body of another loop then, it is known as nesting of
loop. Any type of loop can be nested in any type such as while, do while, for. For
example nesting of for loop can be represented as :
void main()
int i,j;
for(i=0;i<2;i++)
for(j=0;j<5; j++)
Output: i=0
j=0 1 2 3 4
i=1 j=0 1
2 3 4 Break
statement(br
eak)
Sometimes it becomes necessary to come out of the loop even before loop
condition becomes false then break statement is used. Break statement is used
inside loop and switch statements. It cause immediate exit from that loop in which
it appears and it is generally written with condition. It is written with the keyword
as break. When break statement is encountered loop is terminated and control is
transferred to the statement, immediately after loop or situation where we want to
jump out of the loop instantly without waiting to get back to conditional state.
When break is encountered inside any loop, control automatically passes to the
first statement after the loop. This break statement is usually associated with if
statement. Example : void main()
int j=0;
for(;j<6;j++)
35*Under revision
if(j==4)
break;
Output:
0123
Continue statement is used for continuing next iteration of loop after skipping
some statement of loop. When it encountered control automatically passes
through the beginning of the loop. It is usually associated with the if statement. It is
useful when we want to continue the program without executing any part of the
program.
The difference between break and continue is, when the break encountered loop is
terminated and it transfer to the next statement and when continue is encounter
control come back to the beginning position.
In while and do while loop after continue statement control transfer to the test
condition and then loop continue where as in, for loop after continue control
transferred to the updating expression and condition is tested. Example:void
main()
int n;
{ if(n==4)
continue;
printf(“%d”, n);
Printf(“out of loop”);
Lecture Note: 9
if statement
Statement execute set of command like when condition is true and its syntax is
If (condition)
Statement;
The statement is executed only when condition is true. If the if statement body is
consists of several statement then better to use pair of curly braces. Here in case
condition is false then compiler skip the line within the if block.
void main()
int n;
scanf(“%d”,&n);
If (n>10)
}
37*Under revision
Output:
Enter a number:12
Number is greater
it is bidirectional conditional control statement that contains one condition & two
possible action. Condition may be true or false, where non-zero value regarded as
true & zero value regarded as false. If condition are satisfy true, then a single or
block of statement executed otherwise another single or block of statement is
executed.
if (condition)
Statement1;
Statement2;
else
Statement1;
Statement2;
Else statement cannot be used without if or no multiple else statement are allowed
within one if statement. It means there must be a if statement with in an else
statement.
Example:-
void main()
int n;
number”); else
printf(“odd number”); }
odd number
Lecture Note: 10
Nesting of if …else
When there are another if else statement in if-block or else-block, then it is called
nesting of if-else statement. Syntax is :-
if (condition)
If (condition)
Statement1; else
39*Under revision
statement2;
Statement3;
If….else LADDER
In this type of nesting there is an if else statement in every else part except the last
part. If condition is false control pass to block where condition is again checked
with its if statement. Syntax is :-
if (condition)
Statement1; else if
(condition)
statement2; else if
(condition)
statement3; else
statement4;
This process continue until there is no if statement in the last block. if one of the
condition is satisfy the condition other nested “else if” would not executed.
But it has disadvantage over if else statement that, in if else statement whenever
the condition is true, other condition are not checked. While in this case, all
condition are checked.
Lecture Note: 11
ARRAY
Array is the collection of similar data types or collection of similar entity stored in
contiguous memory location. Array of character is a string. Each data item of an
array is called an element. And each element is unique and located in separated
memory location. Each of elements of an array share a variable but each element
having different index no. known as subscript.
ADVANTAGES: array variable can store more than one value at a time where
other variable can store one value at a time.
Example:
int arr[100];
int mark[100];
DECLARATION OF AN ARRAY :
Its syntax is :
int arr[100];
int mark[100];
int a[5]={10,20,30,100,5}
The declaration of an array tells the compiler that, the data type, name of the array,
size of the array and for each element it occupies memory space. Like for int data
type, it occupies 2 bytes for each element and for float it occupies 4 byte for each
41*Under revision
element etc. The size of the array operates the number of elements that can be
stored in an array and it may be a int constant or constant int expression.
int ar[5];
Symbolic constant can also be used to specify the size of the array as:
INITIALIZATION OF AN ARRAY:
After declaration element of local array has garbage value. If it is global or static
array then it will be automatically initialize with zero. An explicitly it can be
initialize that
Example:
in ar[5]={20,60,90, 100,120}
Array subscript always start from zero which is known as lower bound and upper
value is known as upper bound and the last subscript value is one less than the size
of array. Subscript can be an expression i.e. integer value. It can be any integer,
integer constant, integer variable, integer expression or return value from
functional call that yield integer value.
The array elements are standing in continuous memory locations and the
amount of storage required for hold the element depend in its size & type.
int [20];
#include<stdio.h>
int main()
+)
scanf(“%d”,&arr[i]);
for (i=0;i<5;i++)
printf(“%d\t”,arr[i]);
return 0;
OUTPUT:
43*Under revision
Example: From the above example value stored in an array are and occupy its
memory addresses 2000, 2002, 2004, 2006, 2008 respectively.
Example 2:
#include<stdio.h>
void main()
{ sum = sum +
a[i]; }
OUTPUT:
= 275
int marks[]={99,78,50,45,67,89};
If during the initialization of the number the initializers is less then size of array,
then all the remaining elements of array are assigned value zero . For example:-
45*Under revision
int marks[5]={99,78};
Here the size of the array is 5 while there are only two initializers so After this
initialization, the value of the rest elements are automatically occupied by zeros
such as
Then the all the element of the array will be initialized to zero. If the number of
initializers is more than the size given in brackets then the compiler will show an
error.
For example:-
int arr[5]={1,2,3,4,5,6,7,8};//error
we cannot copy all the elements of an array to another array by simply assigning it
to the other array like, by initializing or declaring as int a[5] ={1,2,3,4,5}; int
b[5]; b=a;//not valid
(note:-here we will have to copy all the elements of array one by one, using for
loop.)
#include<stdio.h>
void main()
int arr[10],i;
+)
scanf(“%d”,&arr[i]);
check(arr[i]);
oi
ch
ec
k(
in
{ if(num
%2=0)
47*Under revision
else
Lecture Note: 12
Two dimensional array is known as matrix. The array declaration in both the array
i.e.in single dimensional array single subscript is used and in two dimensional
array two subscripts are is used.
Its syntax is
Or we can say 2-d array is a collection of 1-D array placed one below the other.
Example:-
int a[2][3];
For example:-
20 2 7
8 3 15
00 01 02 10
11 12
For processing 2-d array, we use two nested for loops. The outer for loop
corresponds to the row and the inner for loop corresponds to the column.
For example int a[4][5]; for reading value:-
for(i=0;i<4;i++)
{ for(j=0;j<5;j++)
{ scanf(“%d”,&a[i][j]);
{ for(j=0;j<5;j+
+)
49*Under revision
printf(“%d”,a[i][j]);
2-D array can be initialized in a way similar to that of 1-D array. for
example:intmat[4][3]={11,12,13,14,15,16,17,18,19,20,21,22};
These values are assigned to the elements row wise, so the values of
elements after this initialization are
While initializing we can group the elements row wise using inner braces.
for example:-
int mat[4][3]={{11,12,13},{14,15,16},{17,18,19},{20,21,22}};
And while initializing , it is necessary to mention the 2nd dimension where 1st
dimension is optional.
int mat[][3];
int mat[2][3];
int mat[][];
If we initialize an array as
int mat[4][3]={{11},{12,13},{14,15,16},{17}};
Then the compiler will assume its all rest value as 0,which are not defined.
We can also give the size of the 2-D array by using symbolic constant
Such as
#define ROW 2;
#define COLUMN 3;
int mat[ROW][COLUMN];
String
Here each character occupies 1 byte of memory and last character is always NULL
character. Where ’\o’ and 0 (zero) are not same, where ASCII value of ‘\o’ is 0
and ASCII value of 0 is 48. Array elements of character array are also stored in
contiguous memory allocation.
51*Under revision
Here the NULL character is not necessary and the compiler will assume it
automatically.
A string constant is a set of character that enclosed within the double quotes
and is also called a literal. Whenever a string constant is written anywhere in a
program it is stored somewhere in a memory as an array of characters terminated
by a NULL character (‘\o’).
Example – “m”
“Tajmahal”
The string constant itself becomes a pointer to the first character in array.
1000 1001 1002 1003 1004 1005 1006 1007 100 1009
T a j M A H a l \o
Lecture Note: 13
There are several string library functions used to manipulate string and the
prototypes for these functions are in header file “string.h”. Several string functions
are strlen()
This function return the length of the string. i.e. the number of characters in the
string excluding the terminating NULL character.
It accepts a single argument which is pointer to the first character of the string.
For examplestrlen(“suresh”);
legnth:intstr(char str[])
o’)
{ i++;
return i;
53*Under revision
Example:#include<stdi
o.h>
#include<string.h>
void main()
char str[50];
print(”Enter a string:”);
gets(str);
Output:
strcmp()
This function is used to compare two strings. If the two string match, strcmp()
return a value 0 otherwise it return a non-zero value. It compare the strings
character by character and the comparison stops when the end of the string is
reached or the corresponding characters in the two string are not same.
strcmp(s1,s2)
return a value:
=0 when s1=s2
The exact value returned in case of dissimilar strings is not defined. We only know
that if s1<s2 then a negative value will be returned and if s1>s2 then a positive
value will be returned.
For example:
/*String comparison…………………….*/
#include<stdio.h>
#include<string.h>
void main()
char str1[10],str2[10];
printf(“Enter two
strings:”); gets(str1);
gets(str2);
if(strcmp(str1,str2)==0)
else
strcpy()
This function is used to copying one string to another string. The function
strcpy(str1,str2) copies str2 to str1 including the NULL character. Here str2 is the
source string and str1 is the destination string.
The old content of the destination string str1 are lost. The function returns a pointer
to destination string str1.
Example:-
#include<stdio.h>
#include<string.h>
void main()
char str1[10],str2[10];
printf(“Enter a string:”);
scanf(“%s”,str2);
strcpy(str1,str2);
n”,str1,str2); strcpy(str,”Delhi”);
strcpy(str2,”Bangalore”);
strcat()
This function is used to append a copy of a string at the end of the other string. If
the first string is “”Purva” and second string is “Belmont” then after using this
function the string becomes “PusvaBelmont”. The NULL character from str1 is
moved and str2 is added at the end of str1. The 2nd string str2 remains unaffected. A
pointer to the first string str1 is returned by the function.
Example:-
#include<stdio.h>
#include<string.h>
void main()
char str1[20],str[20];
printf(“Enter two
strings:”); gets(str1);
gets(str2); strcat(str1,str2);
one”);
Output
Base
57*Under revision
Lecture Note: 14
FUNCTION
It is something like to hiring a person to do some specific task like, every six
months servicing a bike and hand over to it.
The user defined functions defined by the user according to its requirement
System defined function can’t be modified, it can only read and can be used.
These function are supplied with every C compiler
Source of these library function are pre complied and only object code get used by
the user by linking to the code by linker
Syntax:-
Return type name of function (type 1 arg 1, type2 arg2, type3 arg3)
when user gets his own function three thing he has to know, these are.
function(arg1,arg2,arg3);
Statement;
Return value;
Function declaration:-
Function declaration is also known as function prototype. It inform the compiler
about three thing, those are name of the function, number and type of argument
received by the function and the type of value returned by the function.
While declaring the name of the argument is optional and the function prototype
always terminated by the semicolon.
59*Under revision
Function definition:-
Function definition consists of the whole description and code of the function.
It tells about what function is doing what are its inputs and what are its out put
Syntax:-
return type function(type 1 arg1, type2 arg2, type3 arg3) /*function header*/
Statement 1;
Statement 2;
Return value
The return type denotes the type of the value that function will return and it is
optional and if it is omitted, it is assumed to be int by default. The body of the
function is the compound statements or block which consists of local variable
declaration statement and optional return statement.
The local variable declared inside a function is local to that function only. It can’t
be used anywhere in the program and its existence is only within this function.
Function Call
When the function get called by the calling function then that is called, function
call. The compiler execute these functions when the semicolon is followed by the
function name. Example:- function(arg1,arg2,arg3);
The argument that are used inside the function call are called actual argument
Ex:-
Actual argument
The arguments which are mentioned or used inside the function call is knows as
actual argument and these are the original values and copy of these are actually
sent to the called function
Function (x);
Function(2,3,sum(a, b));
Formal Arguments
The arguments which are mentioned in function definition are called formal
arguments or dummy arguments.
These arguments are used to just hold the copied of the values that are sent by the
calling function through the function call.
These arguments are like other local variables which are created when the function
call starts and destroyed when the function ends.
The basic difference between the formal argument and the actual argument are
1) The formal argument are declared inside the parenthesis where as the
local variable declared at the beginning of the function block.
2). The formal argumentare automatically initialized when the copy of actual
arguments are passed while other local variable are assigned values through the
statements.
61*Under revision
Order number and type of actual arguments in the function call should be match
with the order number and type of the formal arguments.
Return type
It is used to return value to the calling function. It can be used in two way as
return
Or return(expression);
(a*b+c);
Here the 1st return statement used to terminate the function without returning any
value
{ int
a,b;
scanf(“%d%d”,&a,&b);
int S=sum(a,b);
printf(“summation is = %d”,s);
int z=x1+y1;
Return z;
Advantage of function
By using function large and difficult program can be divided in to sub programs
and solved. When we want to perform some task repeatedly or some code is to be
used more than once at different place in the program, then function avoids this
repeatition or rewritten over and over.
Notes:-
A function is defined when a function name followed by a pair of curly braces Any
function can be called by another function even main() can be called by other
function.
main()
{ function
1() }
function1()
{ Statemen
t;
function2;
}
function 2()
63*Under revision
A function can call itself again and again and this process is called recursion.
A function can be called from other function but a function can’t be defined in
another function
void function()
Statement;
Example:-
void me();
main() {
me();
printf(“in main”);
} void
me()
printf(“come on”);
Output: come on
Function with no
argument but
return value
Syntax:
int fun(void);
main() {
int r;
r=fun(); }
int fun() {
reurn(exp);
65*Under revision
Example: int
sum(); main() {
int b=sum();
} int
sum() {
int a,b,s;
s=a+b;
return s;
Here called function is independent and are initialized. The values aren’t passed by
the calling function .Here the calling function and called function are
communicated partly with each other.
Lecture Note: 16
Here the function have argument so the calling function send data to the called
function but called function dose n’t return value.
Syntax:-
main()
{ int
(a,b);
Statement;
Here the calling function has the argument to pass to the called function and the
called function returned value to the calling function. Syntax:-
fun(int,int);
main()
int r=fun(a,b);
int fun(intx,inty)
return(exp);
Example:
67*Under revision
main() {
int fun(int);
int a,num;
printf(“enter value:\n”);
scanf(“%d”,&a)
int num=fun(a);
int fun(int x)
{ +
+x;
return x;
There are two way through which we can pass the arguments to the function such
as call by value and call by reference.
1. Call by value
In the call by value copy of the actual argument is passed to the formal argument
and the operation is done on formal argument.
When the function is called by ‘call by value’ method, it doesn’t affect content of
the actual argument.
Changes made to formal argument are local to block of called function so when the
control back to calling function the changes made is vanish.
Example:
main() {
n”); scanf(“%d
%d”,&x,&y);
change(x ,y);
{ int k;
k=a;
a=b;
b=k;
23
2. Call by reference
Instead of passing the value of variable, address or reference is passed and the
function operate on address of the variable rather than value.
Here formal argument is alter to the actual argument, it means formal arguments
calls the actual arguments.
69*Under revision
Example:void
main()
n”); scanf(“%d%d”,&a,&b);
change(&a,&b);
{ int k;
k=*a;
*a=*b;
*b= k;
32
So here instead of passing value of the variable, directly passing address of the
variables. Formal argument directly access the value and swapping is possible even
after calling a function.
Lecture Note: 17
Local variable:-
variables that are defined with in a body of function or block. The local
variables can be used only in that function or block in which they are declared.
Same variables may be used in different functions such as function() { int
a,b;
function 1();
function2 ()
int
a=0; b=20; }
Global variable:-
the variables that are defined outside of the function is called global variable. All
functions in the program can access and modify global variables. Global variables
are automatically initialized at the time of initialization.
Example:
71*Under revision
#include<stdio.h>
void function(void);
void function1(void);
void function2(void);
int a, b=20;
void main()
function();
function1();
function2();
function()
function 1()
function 2()
Static variables: static variables are declared by writing the key word static.
-the static variables initialized only once and it retain between the function call. If
its variable is not initialized, then it is automatically initialized to zero.
Example:
void fun1(void);
void fun2(void);
void main()
fun1();
fun2();
} void
fun1()
printf(“a=%d, b=
Output:a= 10 b= 2
a=10 b= 3
Recursion
When function calls itself (inside function body) again and again then it is
called as recursive function. In recursion calling function and called function are
73*Under revision
Syntax:
main ()
rec(); /*function
{ intnum;
printf(“enter a number”);
scanf(“%d”,&num);
f=fact(num);
printf(“factorial is =%d\n”f);
If (num==0||num==1)
return 1;
else
return(num*fact(num-1));
Lecture Note: 18
Monolithic Programming
The program which contains a single function for the large program is called
monolithic program. In monolithic program not divided the program, it is huge
long pieces of code that jump back and forth doing all the tasks like single thread
of execution, the program requires. Problem arise in monolithic program is that,
when the programsizeincreases it leads inconvenience and difficult to maintain
such as testing, debugging etc. Many disadvantages of monolithic programming
are:
Modular Programming
75*Under revision
. Then the linker will link all these modules to form the complete program. This
principle dividing software up into parts, or modules, where a module can be
changed, replaced, or removed, with minimal effect on the other software it works
with. Segmenting the program into modules clearly defined functions, it can
determine the source of program errors more easily. Breaking down program
functions into modules, where each of which accomplishes one function and
contains all the source code and variables needed to accomplish that function.
Modular program is the solution to the problem of very large program that are
difficult to debug, test and maintain. A program module may be rewritten while its
inputs and outputs remain the same. The person making a change may only
understand a small portion of the original program.
Disadvantages
However it may takes longer to develop the program using this technique.
Storage Classes
Storage class in c language is a specifier which tells the compiler where and how to
store variables, its initial value and scope of the variables in a program. Or
attributes of variable is known as storage class or in compiler point of view a
variable identify some physical location within a computer where its string of bits
value can be stored is known as storage class.
The kind of location in the computer, where value can be stored is either in the
memory or in the register. There are various storage class which determined, in
which of the two location value would be stored. Syntax of declaring storage
classes is:-
There are four types of storage classes and all are keywords:-
1 )Automatic (auto)
Examples:-
extern int x;
register char c;
static int y;
If initial value not assigned, then what value taken by uninitialized variable.
77*Under revision
3) Scope of the variable:-what would be the value of the variable of the program.
4) Life time :- It is the time between the creation and distribution of a variable or
how long would variable exists.
Its features:-
Storage-memory location
Life time:-Till the control remains within function or block in which it is defined.
It terminates when function is released.
The variable without any storage class specifier is called automatic variable.
Example:main( )
auto int i;
printf(“i=”,i);
Lecture Note: 19
Storage:-CPU register.
Life time :-till controls remains within function or blocks in which it is defined.
Register variable don’t have memory address so we can’t apply address operator
on it. CPU register generally of 16 bits or 2 bytes. So we can apply storage classes
only for integers, characters, pointer type.
Variable stored in register storage class always access faster than,which is always
stored in the memory. But to store all variable in the CPU register is not possible
because of limitation of the register pair.
And when variable is used at many places like loop counter, then it is better to
declare it as register class. Example:main( )
+) printf(“%d”,i);
Storage:-memory location
79*Under revision
Life time:- value of the variable persist or remain between different function call.
Example:main( )
reduce( );
reduce( );
reduce ( );
reduce( )
printf(“%d”,x); x+
+;
Output:-10,11,12
Features are:-
Storage:-memory area
Declaration does not create variables, only it refer that already been created at
somewhere else. So, memory is not allocated at a time of declaration and the
external variables are declared at outside of all the function.
Example:
main( )
printf( “i=%d”,i );
receive( );
receive ( );
reduce( );
reduce( );
receive( )
{ i=i+2;
reduce( )
{ i=i-1;
Output:-i=0,2,4,3,2.
When there is large program i.e divided into several files, then external variable
should be preferred. External variable extend the scope of variable.
81*Under revision
Lecture Note: 20
POINTER
Syntax-
Here * before pointer indicate the compiler that variable declared as a pointer.
e.g.
When pointer declared, it contains garbage value i.e. it may point any value in the
memory.
Two operators are used in the pointer i.e. address operator(&) and indirection
operator or dereference operator (*).
Example:
void main()
{ int
i=105; int
*p; p=&i;
printf(“value of i=%d”,*p);
printf(“value of i=%d”,*/&i);
printf(“address of i=%d”,&i);
printf(“address of i=%d”,p);
printf(“address of p=%u”,&p);
Pointer Expression
Pointer assignment
int i=10;
Here declaration tells the compiler that P will be used to store the address of
integer value or in other word P is a pointer to an integer and *p reads the value at
the address contain in p. P++;
printf(“value of p=%d”);
We can assign value of 1 pointer variable to other when their base type and data
type is same or both the pointer points to the same variable as in the array.
Int *p1,*p2;
P1=&a[1];
P2=&a[3];
We can assign constant 0 to a pointer of any type for that symbolic constant
‘NULL’ is used such as
83*Under revision
*p=NULL;
Pointer Arithmetic
Example:-
Note:-
But in case of array it is possible, since there data are stored in a consecutive
int *p,*p1;
P=&a[1]; P1=&a[6];
printf(“%d”,*p1-*p);
printf(“%d”,p1-p);
Example
int i=100;
int *p;
p=&i;
p=p+2;
p=p+3;
p=p+9;
Ex:inti=22;
*p1=&a; p1=p1-
10; p1=p1-2;
iii- Subtraction of one pointer to another is possible when pointer variable point to
an element of same type such as an array. Ex:-
in tar[ ]={2,3,4,5,6,7};
int *ptr1,*ptr1;
85*Under revision
ptr1=&a[3]; //2000+4
ptr2=&a[6]; //2000+6
Lecture Note: 21
Precedence of dereference (*) Operator and increment operator and
decrement operator
Equivalent to *(p++)
Since the operator associate from right to left, increment operator will applied to
the pointer p.
+p)→p=p+1
y=*p
equivalent to ++(*p)
p=p+1 then *p
y=*p then
P=p+1 ;
Pointer Comparison
Pointer variable can be compared when both variable, object of same data type
and it is useful when both pointers variable points to element of same array.
Moreover pointer variable are compared with zero which is usually expressed as
null, so several operators are used for comparison like the relational operator.
==,!=,<=,<,>,>=, can be used with pointer. Equal and not equal operators used to
compare two pointer should finding whether they contain same address or not and
they will equal only if are null or contains address of same variable. Ex: void
main()
printf(“not”);
Lecture Note: 22
87*Under revision
Pointer to pointer
Or
Syntax:-
**p1=&p; printf(“value of x=
%d”,x); printf(“value of x=
%d”,*p); printf(“value of x=
%d”,*&x); printf(“value of x=
%d”,**p1); printf(“value of p=
%u”,&p); printf(“address of p=
%u”,p1); printf(“address of x=
%u”,&p1); printf(“value of p=
%u”,p); printf(“value of p=
X 1000
%u”,&x);
22
P 2000
p1
96
*Under revision
3000
Pointer vs
array Example :
void main()
char*p=”Rama”;
In the above example, at the first time printf( ), print the same value array and
pointer.
Sructure
………
………
};
OR
struct
………
………
};
OR
struct tagname
90*Under revision
struct element 1;
struct element 2;
struct element 3;
………
………
struct element n;
};
struct student
int age;
branch[20];
91*Under revision
}; struct student s;
Like primary variables structure variables can also be initialized when they are
declared. Structure templates can be defined locally or globally. If it is local it can
be used within that function. If it is global it can be used by all other functions of
the program.
struct student
{ int age=20;
char name[20]=”sona”;
}s1;
struct student
int age,roll;
char name[20];
If initialiser is less than no.of structure variable, automatically rest values are
taken as zero.
92*Under revision
Dot operator is used to access the structure elements. Its associativety is from
left to right. structure variable ; s1.name[]; s1.roll; s1.age;
Example:
#include<stdio.h>
#include<conio.h>
void main()
{ int roll,
age; char
branch; }
s1,s2;
s2.roll=s1.roll;
printf(“%d”, s2.roll);
Unary, relational, arithmetic, bitwise operators are not allowed within structure
variables.
93*Under revision
Lecture Note:24
Size of structure-
Size of structure can be found out using sizeof() operator with structure variable
name or tag name with keyword.
sizeof(struct student);
or sizeof(s1);
sizeof(s2);
Array of structures
#include<stdio.h>
#include<string.h>
struct student
char name[30];
char
branch[25]; int
94*Under revision
roll; }; void
main() {
struct student
s[200]; int i;
s[i].roll=i+1;
printf("\nEnter information of
students:"); for(i=0;i<200;i++) {
branch:"); scanf("%s",s[i].branch);
printf("\n");
n"); for(i=0;i<200;i++) {
printf("\nBranch:"); puts(s[i].branch);
95*Under revision
struct student
roll,age,marks[5];
Nested structure
96*Under revision
element 1;
element 2;
………
………
struct
student1
{ member 1;
member
2; }variable 1;
……….
……….
element n;
}variable 2;
}; struct
student
student s2,s3;
97*Under revision
Nested structure may also be initialized at the time of declaration like in above
example.
{“ram”,201, {12,11}};
struct time
{ inthr,min; };
date,month;
}; struct
student char
nm[20];
struct day d;
Lecture Note: 25
We can pass each element of the structure through function but passing individual
element is difficult when number of structure element increases. To overcome this,
we use to pass the whole structure through function instead of passing individual
element.
98*Under revision
#include<stdio.h>
#include<string.h
struct student
{ char
name[30]; char
branch[25]; int
roll;
n enter name=”);
gets(s.name); printf("\
nEnter roll:");
scanf("%d",&s.roll);
printf("\nEnter branch:");
gets(s.branch);
display(name,roll,branch)
99*Under revision
#include<stdio.h>
#include<string.h>
struct student
{ char
name[30]; int
age,roll; };
void main()
struct student
s1={”sona”,16,101 }; struct
student s2={”rupa”,17,102 };
display(s1); display(s2); }
display(struct student s)
Output: name=sona
roll=16
100*Under revision
Lecture Note: 26
UNION
Union is derived data type contains collection of different data type or dissimilar
elements. All definition declaration of union variable and accessing member is
similar to structure, but instead of keyword struct the keyword union is used, the
main difference between union and structure is
Each member of structure occupy the memory location, but in the unions
members share memory. Union is used for saving memory and concept is useful
when it is not necessary to use all members of union at a time.
Where union offers a memory treated as variable of one type on one occasion
where (struct), it read number of different variables stored at different place of
memory.
Syntax of union:
union student
datatype member1;
datatype member2;
};
Datatype member1;
}var1;
101*Under revision
Union members can also be accessed by the dot operator with union variable and if
we have pointer to union then member can be accessed by using (arrow) operator
as with structure.
102*Under revision
struct student
int i;
char ch[10];
};struct student s;
Lecture Note:27
Nested of Union
union. Example:union a
int i;
int age;
};
union
103*Under revision
{ char
name[
10];
union a
aa;
}; union b bb;
Example:
void main()
{ struc
t a { int
i;
char
ch[20]; };
struct b
int i;
char
d[10]; };
union z
104*Under revision
struct a a1;
struct b b1; };
union z z1;
z1.b1.j=20;
z1.a1.i=10;
z1.a1.ch[10]= “
i“;
z1.b1.d[0]=”j “;
printf(“ “);
If number of values to be stored is less than the size of memory, there would be
wastage of memory.
If we would want to store more values by increase in size during the execution on
assigned size then it fails.
Allocation and release of memory space can be done with the help of some library
function called dynamic memory allocation function. These library function are
called as dynamic memory allocation function.These library function prototype
are found in the header file, “alloc.h” where it has defined.
Function take memory from memory area is called heap and release when not
required.
105*Under revision
Pointer has important role in the dynamic memory allocation to allocate memory.
malloc():
This function use to allocate memory during run time, its declaration
is void*malloc(size); malloc ()
returns the pointer to the 1st byte and allocate memory, and its return type is void,
which can be type cast such as: int *p=(datatype*)malloc(size)
If memory location is successful, it returns the address of the memory chunk that
was allocated and it returns null on unsuccessful and from the above declaration a
pointer of type(datatype) and size in byte.
And datatype pointer used to typecast the pointer returned by malloc and this
typecasting is necessary since, malloc() by default returns a pointer to void.
We can also use, the size of operator to specify the the size, such as
*p=(int*)malloc(5*size of int) Here, 5 is the no. of data.
Example:
int n ,avg,i,*p,sum=0;
106*Under revision
*)malloc(n*size(int));
if(p==null) printf(“not
sufficient”); exit();
for(i=0;i<n;i++)
scanf(“%d”,(p+i));
for(i=0;i<n;i++)
Printf(“%d”,*(p+i));
sum=sum+*p;
avg=sum/n; printf(“avg=
%d”,avg);
Lecture Note: 28
calloc()
Similar to malloc only difference is that calloc function use to allocate multiple
block of memory .
107*Under revision
Example:-
realloc()
The function realloc use to change the size of the memory block and it alter the
size of the memory block without loosing the old data, it is called reallocation of
memory.
*ptr=(int *)malloc(size);
size);
If new size is larger than the old size, then old data is not lost and newly allocated
bytes are uninitialized. If old address is not sufficient then starting address
contained in pointer may be changed and this reallocation function moves content
of old block into the new block and data on the old block is not lost.
Example:
#include<stdio.h
>
#include<alloc.h
108*Under revision
i,*p;
p=(int*)malloc(5
*size of (int));
if(p==null) {
printf(“enter 5 integer”);
for(i=0;i<5;i++) { scanf(“%d”,
(p+i)); int*ptr=(int*)realloc(9*size
of (int) ); if(ptr==null) {
printf(“not available”);
exit();
for(i=5;i<9;i++) scanf(“%d”,
(p+i)); for(i=0;i<9;i++)
printf(“%d”,*(p+i));
free()
109*Under revision
void(*ptr)
Or
free(p)
Lecture Note: 29
Dynamic array
Example:
#include<stdio.h
>
#include<alloc.h
110*Under revision
scanf(“%d”,&n);
p=(int*)malloc(n*size of int);
If(p==null) printf(“not
} for(i=0;i<n;i+
+) {
printf(“enter an
integer”);
scanf(“%d”,&p[i]);
for(i=0;i<n;i++) {
printf(“%d”,p[i]);
File handling
File: the file is a permanent storage medium in which we can store the data
permanently.
111*Under revision
(1) sequential file (2) random access file (3) binary file
File Operation
opening a file:
Before performing any type of operation, a file must be opened and for
this fopen() function is used. syntax:
example:
FILE *fp=fopen(“ar.c”,”r”);
If fopen() unable to open a file than it will return NULL to the file pointer.
File-pointer: The file pointer is a pointer variable which can be store the address
of a special file that means it is based upon the file pointer a file gets opened.
FILE* var;
Modes of open
character_variable=getc(file_ptr);
112*Under revision
puts(character-var,file-ptr);
ClOSING A FILE
fclose(file-ptr);
File Operation
(3)writing a file
(4)closing a file
Before performing any type of operation we must have to open the file.c, language
communicate with file using A new type called file pointer.
If fopen() unable to open a file then it will return NULL to the file-pointer.
113*Under revision
Lecture Note: 30
Syntax:
Syntax:
fputc(character,file_pointer);
#include<stdio.h
FILE *fs,*fd;
char ch;
If(fs=fopen(“scr.txt”,”r”)==0)
return;
114*Under revision
If(fd=fopen(“dest.txt”,”w”)==0)
while(ch=fgets(fs)!
=EOF) fputc(ch,fd);
fcloseall();
Syntax:
gets(file pointer);
Syntax:
fputs(integer,file_pointer);
#include<stdio.h>
#include<stdlib.h
word;
fp=fopen(“dgt.txt”,”wb”);
115*Under revision
If(fp==NULL)
exit(1);
} word=94;
putw(word,fp)
If(ferror(fp))
else
printf(“Successful write\
file*/
fp=fopen(“dgt.txt”,”rb”);
If(fp==NULL)
exit(1);
word=getw(fp);
116*Under revision
If(ferror(fp)) printf(“Error
printf(“Successful read:word=%d\n”,word);
/*clean up*/
fclose(fp);
Lecture Note: 31
Syntax:
fputs(string,file_pointer);
#include<string.h
>
#include<stdio.h>
void main(void) {
FILE*stream;
char string[]=”This is a
stream=fopen(“DUMMY.FIL”,”w+”);
117*Under revision
fwrite(string,strlen(string),1,stream);
fseek(stream,0,SEEK_SET);
+1,stream);
printf(“%s”,msg);
fclose(stream);
BOOKS:
118*Under revision
119*Under revision