CS8251 - Programming in C

®
TM
TECHNICAL PUBLICATIONS - An up thrust for knowledge

®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

+ + =
+ + + + + +
+ + + + +
®
TM

×
®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

More meaningful
and readable names
{ Proper comments
}
Use of
Aligned identation
opening and
closing braces
®
TM

Start
Program Code Enter Program
Source Program
Edit
Source Program
Compile
C Compiler Source Program
Syntax Yes
Errors ?
No Object Code
System Library Link with

System Library
Executable Object Code
Input Data Execute

Object Code
Data Error Logic Error

Logic & Data
Errors?
No Error
Correct result
Stop
®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

integer Fractional
part part
Optional
3 ⋅ 163 E –6 F suffix
Decimal Exponent
point part
®
TM

®
TM

Data types
User
Basic Derived
derived
Character Integer Real
short int, float, double Array, function,

char Structure, union
int, long int long double pointer
®
TM

Indexes
result [0] 12
result [1] 38
result [2] 45
Element result [3] 52
result [4] 67
result [5] 92
result [6] 15
result [7] 84 Name of

the array
result
®
TM

int result [8] ; 12 38 45 52 67 92 15 84
Type of [0] [1] [2] [3] [4] [5] [6] [7]
each element
char book [10] ; B O O K O F C \0
Name of [0] [1] [2] [3] [4] [5] [6] [7] [8] [9]
the array
float num [4] ; 4.0 5.5 6.0 7.5
Number of [0] [1] [2] [3]

elements
®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

Primary Identifier , Constant Or Parenthetical expression
Example : 2 ∗ (a – 5)
Postfix Operand Operator
Example : a++ ( Same effect as a = a + 1)
Unary Operator Operand
Example : ++a ( Same effect as a = a + 1)
Binary Operand Operator Operand
Example : a+b
Binary
Ternary Operator Expression Operator Expression
expression
Example : y = (f < g) ? g : f
Assignment Variable Operator Expression
Example : b=a+9
Expression Operator Expression

Comma
Example : for (i = 0 , j = 0 ; i < 5 ; i + +)

Note : A comma expression is a complex expression made up of two expressions
separated by commas. It is often used in for statement. (see chapter 7)
®
TM

∗ ∗ ∗
®
TM

®
TM

is complement of
< >=
is complement of
> <=
is complement of
== !=
®
TM

⎛ ⎞
⎜ ⎟
⎜ ⎟
⎝ ⎠
®
TM

®
TM

×
®
TM

®
TM

False
Test expression
True
Conditional expression takes Conditional expression takes

on value of expression 1 on value of expression 2
Exit
<
conditional expression
Test expression ? expression 1 : expression 2
Test boolean expression conditional operators
True Is False
i<0
x=0 x = 50
®
TM

True Is False
f<g
y=g y=f
®
TM

Operand 1 : 1111 0000 1111 0001
Operand 2 : 1
X = operand 1 << operand 2
X = 1110 0001 1110 0010
zero is inserted
on right
Operand 1 : 1111 0000 1111 0000

Operand 2 : 2
X = operand 1 >> operand 2
X = 00 1111 0000 1111 00
Two zero bits are

inserted from left
®
TM

®
TM

∗
5 ∗ 10 /2 %3 ∗8
Graphical representation
– b ++
Graphical representation
®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

1 2 3 4
Right
1 2 3 4 justified
Left
1 2 3 4 justified
Overriding the
1 2 3 4
minimum field width
Padding
0 0 1 2 3 4 with zerors
®
TM

default
3 4 5 6 • 1 2 0 6 5 0 precision
is 6
6 decimal places
7 characters wide
3 4 5 6 • 1 2
2 decimal
places
®
TM

9 characters wide
right
3 4 5 6 • 1 2 justified
2 decimal
places
left
3 4 5 6 • 1 2 justified
9 characters wide
3 • 4 5 6 e + 0 3
3 decimal
places
12 characters wide
3 • 4 5 6 1 2 0 e + 0 3
6 decimal
places
12 characters wide
right
3 • 4 5 6 1 e + 0 3 justified
4 decimal
places
left
3 • 4 5 6 1 e + 0 3 justified
left
– 3 • 4 5 6 1 e + 0 3 justified
®
TM

T H I S I S A T E S T S T R I N G
®
TM

T H I S I S A T E S T
T H I S I S A T E S T
®
TM

®
TM

function name Function arguments
scanf ( " control string," address _ list );
®
TM

®
TM

a 1 2 3 4
a 1 2 3
a 1 2 3 4
®
TM

a – 1 2 3 4
a – 1 2
®
TM

®
TM

®
TM

®
TM

®
TM

Control structures
Conditional Unconditional
control control
1. break
Selection or Looping or
2. continue
decision making branching
3. go to
1. if
1. for
2. if else
2. while
3. if else if ladder
3. do while
4. switch
⎫
⎬
⎭
⎫
⎬
⎭
®
TM

False
Test expression
True
Body of if Body of else
Exit
®
TM

®
TM

False Test True
expression 1
False Test True

expression 2
Statement Statement Statement

sequence 3 sequence 2 sequence 1
Exit
®
TM

if (expression 1)
if (expression 2)
Statement 1 ;
The compiler pairs
else
this if and else
Statement 2 ;
if (expression 1)
{
if (expression 2)
body of if
statement 1;
Compiler pairs
this if and else {
else
statement 2 ; body of else
®
TM

®
TM

⎫
⎬
⎭
⎫
⎬
⎭
⎫
⎬
⎭
Switch variable True

matches first case First case body
constant
False

matches second case Second case body
constant
False

matches third case Third case body
constant
False
Default body
Exit
®
TM

Value of expression
or variable
case 1 match
Case 1
case 2 match
Case 2
case 3 match Case 3
default default
Exit
®
TM

®
TM

The goto statement
goto label ; label : statement ;
label : statement ; goto label ;
Forward branch Backward branch
®
TM

Test False
condition Exit
True
Body of loop
(a) Pre-tested loop
Body of loop
True Test
condition
False
Exit
(b) Post-tested loop
⎫
⎪
⎬
⎪
⎭
®
TM

Initialization
expression
Test False
expression Exit
True
Body of loop
Update expression
®
TM

®
TM

for (i = 1; i < 10; i ++)
{
statement ;
:
for ( j = 0; j < 10; j ++)
{
statement ; Inner Outer
: loop loop
statement ;
}
statement ;
}
®
TM

®
TM

Test False
expression Exit
True
Body of
loop
®
TM

®
TM

Body of loop
True Test
expression
False
Exit
®
TM

for (initialization ; test condition ; updation)
{ ....
if (test condition)
continue ;
......
......
}
while (test condition) do

{ .... { ....
if (test condition) if (test condition)
continue ; continue ;
...... ......
...... ......
} } while (test condition) ;
®
TM

®
TM

®
TM

®
TM

Text based on
commands
Preprocessor
Source program
for compilation
Source program
Translator
Object module
®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

Conditional code
If condition
is true
condition
If condition
is false
®
TM

®
TM

®
TM

Enter loop
False
test expression
of loop
True
Yes
continue?
No
Exit loop
Remaining body
of loop
Enter loop
False
test expression
of loop
True
Yes
break?
No
Exit loop
Remaining body
of loop
®
TM

®
TM

Array elements
46 52 65 ... 82 78
marks[0] marks[1] marks[2] marks[n–2] marks[n–1]
Array Subscript
name
®
TM

numbers [0] = 10 marks [0] = 50.5
numbers [1] = 12 marks [1] = 67.82
numbers [2] = 52 marks [2] = 78.12
numbers [3] = 18 marks [3] = 30.25
numbers [4] = 5 marks [4] = 40.0
®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

0
int arr [5] [4] ; 1 arr [3] [1]
First dimension
(rows)
2
0 1 2 3
Second dimension
(columns)
arr [1] [2] [3]

0
int arr[3] [5] [4] ;

Second dimension
1
(rows)
3
2
4 1
0
0 1 2 3 First dimension
(planes)
Third dimension
(columns)
®
TM

×
®
TM

®
TM

®
TM

®
TM

×
⎡a b⎤
⎢c d⎥⎦
⎣
⎡a b c⎤
⎢d e f ⎥
⎢ ⎥
⎢⎣g h i ⎥⎦
e f d f d e
a⋅ – b⋅ + c⋅
h i g i g h
®
TM

f g h e g h e f h e f g
|A|= a ⋅ j k l – b⋅ i k l + c⋅ i j l – d⋅ i j k
n o p m o p m n p m n o
®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

94
38 82
22 10 42 55
22
35 42
52 68 72 89
®
TM

91
57 84
38 10 48 25
25
33
57 48
38 10 91 84
33
25
57 91
38 10 48 84
33
A[0] 84
A[1] 57 48 A[2]
91
57 25 A[4] 10 A[5] A[6]

A[3] 38 33 25
38 10 48 84 A[7] 91
33
®
TM

33
A[0] 57
25 10
A[1] A[2]
38 48
A[6] 38 48 57 84
A[5]
A[3] 25 A[4] 10 33 84
91
A[7] 91
25
A[0] 48
10 33
A[2]
A[1] 38 33
38 48 57 84
A[5] A[6]
A[3] 25 A[4] 10 57 84
91
A[7] 91
10
38
25 33
25 33
38 48 57 84
10 48 57 84 91
91
®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

× × ×
®
TM

®
TM

\n
®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

Memory Variable in
address memory
1000 10
1004 (address)
1001 04
1002
1003
1004 50 pointer
1005
1006
Memory
®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

name n o m o n t h \0
j a n \0
f e b \0
m a r \0
Pointer Variable
d e c \0
Address Value
15 characters a) Single indirection

Aname [0] n o m o n t h \0
Pointer 1 Pointer 2 Variable
Aname [1] j a n \0
Address Address Value
Aname [2] f e b \0
Aname [3] m a r \0
b) Multiple indirection
Aname [12] d e c
Aname
(Aname + 1)
(Aname + 2)
∗(∗(Aname + 2) + 5)
∗ (Aname + 2) ∗ (Aname + 2) + 5
®
TM

®
TM

®
TM

∗ ∗
∗
®
TM

®
TM

®
TM

∫
®
TM

Array [0] 10 20 30
Array [1] 11 12 13 14 15 16 17 18
Array [2] 12
Array [3] 25 35 45 15 20
Array [4] 32 16
10 20 30
Array [0]
Array [1] 11 12 13 14 15 16 17 18
Array [2] 12
Array [3]
25 35 45 15 20
Array [4]
32 16
city [0] Pune
city [1] Bombay
× city [2] Ahmedabad
®
TM

P u n e \0
B o m b a y \0
A h m e d a b a d \0
∗ ∗
∗
®
TM

®
TM

∗
®
TM

®
TM

Student structure
name [64] member 1
course [128] member 2
age member 3
year member 4
®
TM

®
TM

®
TM

®
TM

®
TM

Field 1 Field 2 Field 3 Field 4
student A [0]
student A [1]
student A [2]
student A [38]
student A [39]
®
TM

®
TM

®
TM

×
®
TM

®
TM

®
TM

Memory
management
malloc calloc realloc free
®
TM

®
TM

®
TM

Node 0 Node 1 Node 2 Node 3
Data Pointer Data Pointer Data Pointer Data NULL
A link list of intergers is as shown below.
10 Pointer 20 Pointer 30 Pointer 40 NULL
Note : The link field of last node consists of 'NULL' which indicates end of linked list.
®
TM

Data Pointer Data Pointer Data Pointer Data NULL
Node 1_2
Inserted Data Pointer

Node
Data Pointer Data Pointer Data NULL Data NULL
®
TM

Node 10 20 30 40 50
a[0] a[1] a[2] a[3] a[4]
Data Next link
Index
®
TM

10 Pointer 20 Pointer 30 Pointer 40 NULL
First or
Head
10 Pointer 20 Pointer 30 Pointer 40 Pointer
10 Next Previous 20 Next Previous 30 NULL

NULL
First or
Head
Previous 10 Next Previous 20 Next Previous 30 Next
®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

∗
Top
40
node
30
20
10 NULL
®
TM

®
TM

®
TM

←
↑
®
TM

↑ ↑
↑ ↑
®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

Program
0010 1000 0001 1101 0000 0000 0000 1111
a b
®
TM

®
TM

®
TM

fopen(.....)
fseek (fp, 4 ∗ sizeof ( STRUCTURE_TYPE), SEEK_SET ) ;
fseek (fp, – 4 ∗ sizeof ( STRUCTURE_TYPE), SEEK_END ) ;
fseek (fp, 2 ∗ sizeof ( STRUCTURE_TYPE), SEEK_CUR ) ;
®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

∗
®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

− b ± b 2 − 4ac
2a
®
TM

x2 + x
2x
®
TM

®
TM

®
TM

®
TM

®
TM

x2 x4 x6
+
2! 4! 6!
− x2 x4
2! 4!
x 3 x5
+
− t i−2 × x2 3! 5!
(i − 1) × i −x3 x5
3! 5!
− t 2 × x2 − −x 2 x2 x4
+
3× 2! 3× 4! − t i−2 × x2
(i − 1) × i
− t 3 × x2 − −x 3 x2 x5
4× 3! 4×5 5!
®
TM

®
TM

1 + x + x 2 + x 3 + ..... + x n
13 + 5 3 + 3 3 = 153
®
TM

1 1 1 1 1
1+ + + + +.........+
1! 2! 3! 4! n!
®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

×
®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

i2 = − 1
bdi 2
(a + bi) ⎛ ac + bd ⎞ ⎛ bc − ad ⎞
=⎜ ⎟+⎜ ⎟⎟ i
(c + di) ⎜⎝ c 2 + d 2 ⎟⎠ ⎜⎝ c 2 + d 2 ⎠
®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

®
TM

CS8251 - Programming in C

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

CS8251 - Programming in C

Uploaded by

Copyright:

Available Formats

®

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge

Program Code Enter Program

System Library Link with

Executable Object Code

Input Data Execute

Data Error Logic Error

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge

Character Integer Real

short int, float, double Array, function,

TECHNICAL PUBLICATIONS - An up thrust for knowledge

Element result [3] 52

result [7] 84 Name of

TECHNICAL PUBLICATIONS - An up thrust for knowledge

char book [10] ; B O O K O F C \0

float num [4] ; 4.0 5.5 6.0 7.5

Number of [0] [1] [2] [3]

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge

Postfix Operand Operator

Example : a++ ( Same effect as a = a + 1)

Unary Operator Operand

Example : ++a ( Same effect as a = a + 1)

Binary Operand Operator Operand

Assignment Variable Operator Expression

Expression Operator Expression

Example : for (i = 0 , j = 0 ; i < 5 ; i + +)

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge