SlideShare a Scribd company logo
1 of 28
Print Nos. From 1 to 10 
main( ) 
{ 
int i = 1 ; 
while ( i <= 10 ) 
{ 
printf ( ”%d”, i ) ; 
} 
} 
a = a * 10 ; 
a *= 10 ; 
b = b % 5 ; 
b %= 5 ; 
i += 1 ; 
Same as i++, + 
+i, i = i + 1 
+= -= *= /= %= += -= *= /= %= CCoommppoouunndd AAssssiiggnnmmeenntt OOppeerr..
One More Way 
main( ) 
{ 
int i = 1 ; 
while ( ) 
{ 
Any Non-Zero 
number 
printf ( ”%d”, i ) ; 
i++ ; 
} 
} 
1 /* Repeat infinite times */
Applying Brakes 
main( ) 
{ 
break - Terminates Loop 
exit( ) - Terminates Program 
break - Terminates Loop 
exit( ) - Terminates Program 
int i = 1 ; 
while ( 1 ) /* Repeat infinite times */ 
{ 
printf ( ”%d”, i ) ; 
i++ ; 
} 
} 
if ( i > 10 ) 
break ; 
if ( i > 10 ) 
exit( ) ; 
if ( i > 10 ) 
exit( ) ; 
Keyword
Calculate 
n! 
nS 
i 
i = 1 
xn 
Running product 
1 * 2 * 3 * 4 *….n 
1 + 2 + 3 + 4 +.…n 
2 * 2 * 2 * 2 *….n 
Running sum 
Running product
Running Sum And Products 
int s, p, pr, i, n ; 
i = 1 ; 
while ( i <= n ) 
{ 
s = 0 ; p = 1 ; pr = 1 ; 
s = s + ; 
} 
i 
p = p * i ; 
pr = pr * 2 ; 
1 + 2 + 3 + 4 +.…n RS 
1 * 2 * 3 * 4 *….n RP 
2 * 2 * 2 * 2 *….n RP 
1 + 2 + 3 + 4 +.…n RS 
1 * 2 * 3 * 4 *….n RP 
2 * 2 * 2 * 2 *….n RP 
main( ) 
{ 
scanf ( ”%d”, &n ) ; 
i++ ; 
printf ( ”%d %d %d”, s, p, pr ) ; 
} 
i s 
1 0 
2 1 
3 3 
4 6 
5 10 
6 15 
5
x x3 x5 x7 x9 
1! 3! 5! 7! 9! 
main( ) 
{ 
x x3 x5 x7 x9 
1! 3! 5! 7! 9! 
scanf ( ”%f”, &x ) ; 
while ( i <= 10 ) 
{ 
i = 1 ; s = 0 ; 
calculate numerator 
calculate denominator 
term = numerator / denominator 
Add / subtract alternate terms to/from s 
i++ ; 
} 
print ( s ) ; 
}
main( ) 
{ 
scanf ( ”%f ”, &x ) ; 
i = 1 ; 
while ( i <= 10 ) 
{ 
OK ? 
float x, s, n, d, t ; int i, j, k, n ; 
i++ ; 
} 
printf ( ”%f ”, s ) ; 
} 
x1 x3 x5 
1! 3! 5! 
x1 x3 x5 
1! 3! 5! 
i j 
1 1 
2 3 
3 5 
4 7 
5 9 
.. .. 
j = 2 * i - 1 ; 
while ( k <= j ) 
{ 
d = d * k ; n = n * x ; 
k++ ; 
} 
k = n = d = 1 ; 
t = n / d ; 
( i % 2 == 0 ) ? s = s - t : s = s + t ; 
Anything 
wrong ? 
s = 0 ; 
Associates 
from R to L
Prime Number or Not 
main( ) 
{ 
printf ( ”Enter any number” ) ; 
scanf ( ”%d”, &n ) ; 
... 
... 
} 
13 
2 3 4 .. .. .. 12 
int n ; 
13
Prime No. 
main( ) 
{ 
int n ; 
printf ( ”Enter any number” ) ; 
scanf ( ”%d”, &n ) ; 
} 
13 
2 3 4 .. .. .. 12 
int i = 2 ; 
while ( ) 
i <= n - 1 
{ 
if ( n % i = = 0 ) 
printf ( ”Not a prime number” ) ; 
else 
i++ ; 
}
main( ) 
{ 
int n, i = 2 ; 
printf ( ”Enter any number” ) ; 
scanf ( ”%d”, &n ) ; 
while ( i <= n - 1 ) 
13 
{ 
if ( n % i == 0 ) 
printf ( ”Not a prime number” ) ; 
else 
i++ ; 
} 
} 
if ( i == n ) 
break ; 
{ 
} 
printf ( ”Prime number” ) ;
Generate Prime Numbers 
2 17 
3 19 
5 23 
7 . 
11 . 
13 199
i = ++a && ++b && ++c ; 
j = ++a || ++b || ++c ; 
i = ++a && ++b && ++c ; 
j = ++a || ++b || ++c ; 
What Would Be The O/P 
b = ( b = ( ++++ii &&&& ++++jj )) |||| ++++kk ;; 
main( ) 
{ 
int i = 5, j = 4, k = -1, a, b ; 
a = i && !j ; 
b = ++i && ++j || ++k ; 
printf ( ”%d %d %d %d %d”, a, b, i, j, k ) ; 
} 
bb == ++++ii &&&& (( ++++jj |||| ++++kk ));; 
00 1 6 5 -1
Loop Control Instructions 
 while 
 for 
 
 do-while
The while Loop 
main( ) 
{ 
int m1, m2, m3, avg, i ; 
i = 1 ; 
while ( i = 10 ) 
{ 
scanf ( ”%d%d%d”, m1, m2, m3 ) ; 
avg = ( m1 +m2 + m3 ) / 3 ; 
printf ( ”%d”, avg ) ; 
i++ ; 
} 
} 
Init Test Incr 
Test 
Test 
Incr 
Incr 
Test Incr 
.. .. 
.. ..
The for Loop 
main( ) 
{ 
int m1, m2, m3, avg, i ; 
scanf ( ”%d%d%d”, m1, m2, m3 ) ; 
avg = ( m1 + m2 + m3 ) / 3 ; 
printf ( ”%d”, avg ) ; 
} 
( ) 
Init Test Incr 
Test 
Test 
Incr 
Incr 
Test Incr 
.. .. 
for .. .. i = 1 ; i = 10 ; i++ 
{ 
}
Comparision - I 
Infinite Loop Finite Loop 
main( ) 
{ 
int i = 1 ; 
while ( i = 10 ) 
statement1 ; 
statement2 ; 
statement3 ; 
i++ ; 
} 
main( ) 
{ 
int i ; 
for ( i = 1 ; i = 10 ; i++ ) 
statement1 ; 
statement2 ; 
statement3 ; 
}
Comparison II 
Infinite Loop Finite Loop 
main( ) 
{ 
int i = 1 ; 
while ( i = 10 ) ; 
{ 
statement1 ; 
statement2 ; 
statement3 ; 
i++ ; 
} 
} 
main( ) 
{ 
int i ; 
for ( i = 1 ; i = 10 ; i++ ) ; 
{ 
statement1 ; 
statement2 ; 
statement3 ; 
} 
}
Print Nos. From 1 to 10 
main( ) 
{ 
int i ; 
for ( i = 1 ; i = 10 ; i++ ) 
printf ( ”n%d”, i ) ; 
}
Dropping Initialisation 
main( ) 
{ 
int i = 1 ; 
for ( ; i = 10 ; i++ ) 
printf ( ”n%d”, i ) ; 
}
Dropping Incrementation 
main( ) 
{ 
int i = 1 ; 
for ( ; i = 10 ; ) 
{ 
printf ( ”n%d”, i ) ; 
i++ ; 
} 
}
Dropping Condition 
main( ) 
; ; Necessary 
{ 
int i = 1 ; 
for ( ; ; ) 
{ 
printf ( ”%d”, i ) ; 
i++ ; 
} 
} 
if ( i  10 ) 
break ; 
printf ( ”%d”, i++ ) ; 
if ( ++i  10 )
Comparison III 
Error Infinite Loop 
main( ) 
{ 
int i = 1 ; 
while ( ) 
{ 
statement1 ; 
statement2 ; 
statement3 ; 
} 
} 
main( ) 
{ 
int i = 1 ; 
for ( ; ; ) 
{ 
statement1 ; 
statement2 ; 
statement3 ; 
} 
}
Drawing Boxes 
012..... 24 
0 1 2 … … … … 79 
(10,20) 
TTiipp :: (( 1100,, 2200 )) 
(23,70) 
( row number, col number )
Box Drawing Characters 
Character ASCII value 
218 
191 
192 
217 
196 
179
To Begin With... 
main( ) 
{ 
clrscr( ) ; 
printf ( ”%c”, 218 ) ; 
… 
… 
}
main( ) 
{ 
clrscr( ) ; 
} 
int r, c ; 
(10,20) 
gotorc ( 10, 20 ) ; printf ( ”%c”, 218 ) ; 
gotorc ( 10, 70 ) ; printf ( ”%c”, 191 ) ; 
gotorc ( 23, 20 ) ; printf ( ”%c”, 192 ) ; 
gotorc ( 23, 70 ) ; printf ( ”%c”, 217 ) ; 
for ( r = 11 ; r  23 ; r++ ) 
{ 
gotorc ( r, 20 ) ; printf ( ”%c”, 179 ) ; 
gotorc ( r, 70 ) ; printf ( ”%c”, 179 ) ; 
} 
for ( … … … .. ) 
{ 
} 
(23,70)
#include ”goto.c” 
main( ) 
{ 
int r, c ; 
clrscr( ) ; 
gotorc ( 10, 20 ) ; printf ( ”%c”, 218 ) ; 
.. .. 
.. .. 
for ( r = 11 ; r  23 ; r++ ) 
{ 
.. .. 
} 
for ( … … … ) 
{ 
} 
}
9966 -- 9999 
CChhaapptteerr 33

More Related Content

What's hot (20)

Practica 4 errores
Practica 4 erroresPractica 4 errores
Practica 4 errores
 
Metodos Numericos(Segundo Taller De Aplicadas)
Metodos Numericos(Segundo Taller De Aplicadas)Metodos Numericos(Segundo Taller De Aplicadas)
Metodos Numericos(Segundo Taller De Aplicadas)
 
Fcfs Cpu Scheduling With Gantt Chart
Fcfs Cpu Scheduling With Gantt ChartFcfs Cpu Scheduling With Gantt Chart
Fcfs Cpu Scheduling With Gantt Chart
 
Metodos Numericos
Metodos NumericosMetodos Numericos
Metodos Numericos
 
(Meta 4) ejemplo calcular la mitad de un numero dev c++
(Meta 4) ejemplo calcular la mitad de un numero dev c++ (Meta 4) ejemplo calcular la mitad de un numero dev c++
(Meta 4) ejemplo calcular la mitad de un numero dev c++
 
Sujet bac info 2012 g1, g2 et g3 avec correction
Sujet bac info 2012 g1, g2 et g3 avec correctionSujet bac info 2012 g1, g2 et g3 avec correction
Sujet bac info 2012 g1, g2 et g3 avec correction
 
Para la suma y la multiplicacion de 2
Para la suma y la multiplicacion de 2Para la suma y la multiplicacion de 2
Para la suma y la multiplicacion de 2
 
Programas for
Programas forProgramas for
Programas for
 
Rafaeltorres
RafaeltorresRafaeltorres
Rafaeltorres
 
week-24x
week-24xweek-24x
week-24x
 
Absolute Loader
Absolute LoaderAbsolute Loader
Absolute Loader
 
[C++ Korea] Effective Modern C++ Study, Item 27, 29 - 30
[C++ Korea] Effective Modern C++ Study, Item 27, 29 - 30[C++ Korea] Effective Modern C++ Study, Item 27, 29 - 30
[C++ Korea] Effective Modern C++ Study, Item 27, 29 - 30
 
Program to remove Left factoring
Program to remove Left factoringProgram to remove Left factoring
Program to remove Left factoring
 
Sum2
Sum2Sum2
Sum2
 
Daniel snake
Daniel snakeDaniel snake
Daniel snake
 
Info clasa
Info clasaInfo clasa
Info clasa
 
Retornan y no reciben
Retornan y no recibenRetornan y no reciben
Retornan y no reciben
 
Alocação Dinâmica em C
Alocação Dinâmica em CAlocação Dinâmica em C
Alocação Dinâmica em C
 
Vcs12
Vcs12Vcs12
Vcs12
 
B.f.s
B.f.sB.f.s
B.f.s
 

Viewers also liked (17)

Vcs28
Vcs28Vcs28
Vcs28
 
Vcs20
Vcs20Vcs20
Vcs20
 
Vcs21
Vcs21Vcs21
Vcs21
 
Vcs16
Vcs16Vcs16
Vcs16
 
Vcs24
Vcs24Vcs24
Vcs24
 
Vcs5
Vcs5Vcs5
Vcs5
 
Vcs14
Vcs14Vcs14
Vcs14
 
DATASTRUCTURES PPTS PREPARED BY M V BRAHMANANDA REDDY
DATASTRUCTURES PPTS PREPARED BY M V BRAHMANANDA REDDYDATASTRUCTURES PPTS PREPARED BY M V BRAHMANANDA REDDY
DATASTRUCTURES PPTS PREPARED BY M V BRAHMANANDA REDDY
 
C LANGUAGE UNIT-1 PREPARED BY M V BRAHMANANDA REDDY
C LANGUAGE UNIT-1 PREPARED BY M V BRAHMANANDA REDDYC LANGUAGE UNIT-1 PREPARED BY M V BRAHMANANDA REDDY
C LANGUAGE UNIT-1 PREPARED BY M V BRAHMANANDA REDDY
 
ELEMENTARY DATASTRUCTURES
ELEMENTARY DATASTRUCTURESELEMENTARY DATASTRUCTURES
ELEMENTARY DATASTRUCTURES
 
DATA STRUCTURES AND ALGORITHMS UNIT-3 TREES PREPARED BY M V BRAHMANANDA REDDY
DATA STRUCTURES AND ALGORITHMS UNIT-3 TREES PREPARED BY M V BRAHMANANDA REDDYDATA STRUCTURES AND ALGORITHMS UNIT-3 TREES PREPARED BY M V BRAHMANANDA REDDY
DATA STRUCTURES AND ALGORITHMS UNIT-3 TREES PREPARED BY M V BRAHMANANDA REDDY
 
C language unit-1
C language unit-1C language unit-1
C language unit-1
 
Vcs19
Vcs19Vcs19
Vcs19
 
C notes by m v b reddy(gitam)imp notes all units notes 5 unit order
C notes by m v b  reddy(gitam)imp  notes  all units notes  5 unit orderC notes by m v b  reddy(gitam)imp  notes  all units notes  5 unit order
C notes by m v b reddy(gitam)imp notes all units notes 5 unit order
 
AVL TREE PREPARED BY M V BRAHMANANDA REDDY
AVL TREE PREPARED BY M V BRAHMANANDA REDDYAVL TREE PREPARED BY M V BRAHMANANDA REDDY
AVL TREE PREPARED BY M V BRAHMANANDA REDDY
 
C LANGUAGE NOTES
C LANGUAGE NOTESC LANGUAGE NOTES
C LANGUAGE NOTES
 
Datastructures and algorithms prepared by M.V.Brehmanada Reddy
Datastructures and algorithms prepared by M.V.Brehmanada ReddyDatastructures and algorithms prepared by M.V.Brehmanada Reddy
Datastructures and algorithms prepared by M.V.Brehmanada Reddy
 

More from Malikireddy Bramhananda Reddy (14)

M v bramhananda reddy dsa complete notes
M v bramhananda reddy dsa complete notesM v bramhananda reddy dsa complete notes
M v bramhananda reddy dsa complete notes
 
B-TREE PREPARED BY M V BRAHMANANDA REDDY
B-TREE PREPARED BY M V BRAHMANANDA REDDYB-TREE PREPARED BY M V BRAHMANANDA REDDY
B-TREE PREPARED BY M V BRAHMANANDA REDDY
 
DATASTRUCTURES UNIT-1
DATASTRUCTURES UNIT-1DATASTRUCTURES UNIT-1
DATASTRUCTURES UNIT-1
 
Data representation UNIT-1
Data representation UNIT-1Data representation UNIT-1
Data representation UNIT-1
 
C SLIDES PREPARED BY M V B REDDY
C SLIDES PREPARED BY  M V B REDDYC SLIDES PREPARED BY  M V B REDDY
C SLIDES PREPARED BY M V B REDDY
 
C AND DATASTRUCTURES PREPARED BY M V B REDDY
C AND DATASTRUCTURES PREPARED BY M V B REDDYC AND DATASTRUCTURES PREPARED BY M V B REDDY
C AND DATASTRUCTURES PREPARED BY M V B REDDY
 
C PROGRAMS
C PROGRAMSC PROGRAMS
C PROGRAMS
 
Vcs29
Vcs29Vcs29
Vcs29
 
Vcs26
Vcs26Vcs26
Vcs26
 
Vcs23
Vcs23Vcs23
Vcs23
 
Vcs22
Vcs22Vcs22
Vcs22
 
Vcs17
Vcs17Vcs17
Vcs17
 
Vcs15
Vcs15Vcs15
Vcs15
 
Vcs8
Vcs8Vcs8
Vcs8
 

Vcs6

  • 1. Print Nos. From 1 to 10 main( ) { int i = 1 ; while ( i <= 10 ) { printf ( ”%d”, i ) ; } } a = a * 10 ; a *= 10 ; b = b % 5 ; b %= 5 ; i += 1 ; Same as i++, + +i, i = i + 1 += -= *= /= %= += -= *= /= %= CCoommppoouunndd AAssssiiggnnmmeenntt OOppeerr..
  • 2. One More Way main( ) { int i = 1 ; while ( ) { Any Non-Zero number printf ( ”%d”, i ) ; i++ ; } } 1 /* Repeat infinite times */
  • 3. Applying Brakes main( ) { break - Terminates Loop exit( ) - Terminates Program break - Terminates Loop exit( ) - Terminates Program int i = 1 ; while ( 1 ) /* Repeat infinite times */ { printf ( ”%d”, i ) ; i++ ; } } if ( i > 10 ) break ; if ( i > 10 ) exit( ) ; if ( i > 10 ) exit( ) ; Keyword
  • 4. Calculate n! nS i i = 1 xn Running product 1 * 2 * 3 * 4 *….n 1 + 2 + 3 + 4 +.…n 2 * 2 * 2 * 2 *….n Running sum Running product
  • 5. Running Sum And Products int s, p, pr, i, n ; i = 1 ; while ( i <= n ) { s = 0 ; p = 1 ; pr = 1 ; s = s + ; } i p = p * i ; pr = pr * 2 ; 1 + 2 + 3 + 4 +.…n RS 1 * 2 * 3 * 4 *….n RP 2 * 2 * 2 * 2 *….n RP 1 + 2 + 3 + 4 +.…n RS 1 * 2 * 3 * 4 *….n RP 2 * 2 * 2 * 2 *….n RP main( ) { scanf ( ”%d”, &n ) ; i++ ; printf ( ”%d %d %d”, s, p, pr ) ; } i s 1 0 2 1 3 3 4 6 5 10 6 15 5
  • 6. x x3 x5 x7 x9 1! 3! 5! 7! 9! main( ) { x x3 x5 x7 x9 1! 3! 5! 7! 9! scanf ( ”%f”, &x ) ; while ( i <= 10 ) { i = 1 ; s = 0 ; calculate numerator calculate denominator term = numerator / denominator Add / subtract alternate terms to/from s i++ ; } print ( s ) ; }
  • 7. main( ) { scanf ( ”%f ”, &x ) ; i = 1 ; while ( i <= 10 ) { OK ? float x, s, n, d, t ; int i, j, k, n ; i++ ; } printf ( ”%f ”, s ) ; } x1 x3 x5 1! 3! 5! x1 x3 x5 1! 3! 5! i j 1 1 2 3 3 5 4 7 5 9 .. .. j = 2 * i - 1 ; while ( k <= j ) { d = d * k ; n = n * x ; k++ ; } k = n = d = 1 ; t = n / d ; ( i % 2 == 0 ) ? s = s - t : s = s + t ; Anything wrong ? s = 0 ; Associates from R to L
  • 8. Prime Number or Not main( ) { printf ( ”Enter any number” ) ; scanf ( ”%d”, &n ) ; ... ... } 13 2 3 4 .. .. .. 12 int n ; 13
  • 9. Prime No. main( ) { int n ; printf ( ”Enter any number” ) ; scanf ( ”%d”, &n ) ; } 13 2 3 4 .. .. .. 12 int i = 2 ; while ( ) i <= n - 1 { if ( n % i = = 0 ) printf ( ”Not a prime number” ) ; else i++ ; }
  • 10. main( ) { int n, i = 2 ; printf ( ”Enter any number” ) ; scanf ( ”%d”, &n ) ; while ( i <= n - 1 ) 13 { if ( n % i == 0 ) printf ( ”Not a prime number” ) ; else i++ ; } } if ( i == n ) break ; { } printf ( ”Prime number” ) ;
  • 11. Generate Prime Numbers 2 17 3 19 5 23 7 . 11 . 13 199
  • 12. i = ++a && ++b && ++c ; j = ++a || ++b || ++c ; i = ++a && ++b && ++c ; j = ++a || ++b || ++c ; What Would Be The O/P b = ( b = ( ++++ii &&&& ++++jj )) |||| ++++kk ;; main( ) { int i = 5, j = 4, k = -1, a, b ; a = i && !j ; b = ++i && ++j || ++k ; printf ( ”%d %d %d %d %d”, a, b, i, j, k ) ; } bb == ++++ii &&&& (( ++++jj |||| ++++kk ));; 00 1 6 5 -1
  • 13. Loop Control Instructions while for do-while
  • 14. The while Loop main( ) { int m1, m2, m3, avg, i ; i = 1 ; while ( i = 10 ) { scanf ( ”%d%d%d”, m1, m2, m3 ) ; avg = ( m1 +m2 + m3 ) / 3 ; printf ( ”%d”, avg ) ; i++ ; } } Init Test Incr Test Test Incr Incr Test Incr .. .. .. ..
  • 15. The for Loop main( ) { int m1, m2, m3, avg, i ; scanf ( ”%d%d%d”, m1, m2, m3 ) ; avg = ( m1 + m2 + m3 ) / 3 ; printf ( ”%d”, avg ) ; } ( ) Init Test Incr Test Test Incr Incr Test Incr .. .. for .. .. i = 1 ; i = 10 ; i++ { }
  • 16. Comparision - I Infinite Loop Finite Loop main( ) { int i = 1 ; while ( i = 10 ) statement1 ; statement2 ; statement3 ; i++ ; } main( ) { int i ; for ( i = 1 ; i = 10 ; i++ ) statement1 ; statement2 ; statement3 ; }
  • 17. Comparison II Infinite Loop Finite Loop main( ) { int i = 1 ; while ( i = 10 ) ; { statement1 ; statement2 ; statement3 ; i++ ; } } main( ) { int i ; for ( i = 1 ; i = 10 ; i++ ) ; { statement1 ; statement2 ; statement3 ; } }
  • 18. Print Nos. From 1 to 10 main( ) { int i ; for ( i = 1 ; i = 10 ; i++ ) printf ( ”n%d”, i ) ; }
  • 19. Dropping Initialisation main( ) { int i = 1 ; for ( ; i = 10 ; i++ ) printf ( ”n%d”, i ) ; }
  • 20. Dropping Incrementation main( ) { int i = 1 ; for ( ; i = 10 ; ) { printf ( ”n%d”, i ) ; i++ ; } }
  • 21. Dropping Condition main( ) ; ; Necessary { int i = 1 ; for ( ; ; ) { printf ( ”%d”, i ) ; i++ ; } } if ( i 10 ) break ; printf ( ”%d”, i++ ) ; if ( ++i 10 )
  • 22. Comparison III Error Infinite Loop main( ) { int i = 1 ; while ( ) { statement1 ; statement2 ; statement3 ; } } main( ) { int i = 1 ; for ( ; ; ) { statement1 ; statement2 ; statement3 ; } }
  • 23. Drawing Boxes 012..... 24 0 1 2 … … … … 79 (10,20) TTiipp :: (( 1100,, 2200 )) (23,70) ( row number, col number )
  • 24. Box Drawing Characters Character ASCII value 218 191 192 217 196 179
  • 25. To Begin With... main( ) { clrscr( ) ; printf ( ”%c”, 218 ) ; … … }
  • 26. main( ) { clrscr( ) ; } int r, c ; (10,20) gotorc ( 10, 20 ) ; printf ( ”%c”, 218 ) ; gotorc ( 10, 70 ) ; printf ( ”%c”, 191 ) ; gotorc ( 23, 20 ) ; printf ( ”%c”, 192 ) ; gotorc ( 23, 70 ) ; printf ( ”%c”, 217 ) ; for ( r = 11 ; r 23 ; r++ ) { gotorc ( r, 20 ) ; printf ( ”%c”, 179 ) ; gotorc ( r, 70 ) ; printf ( ”%c”, 179 ) ; } for ( … … … .. ) { } (23,70)
  • 27. #include ”goto.c” main( ) { int r, c ; clrscr( ) ; gotorc ( 10, 20 ) ; printf ( ”%c”, 218 ) ; .. .. .. .. for ( r = 11 ; r 23 ; r++ ) { .. .. } for ( … … … ) { } }
  • 28. 9966 -- 9999 CChhaapptteerr 33