an ANSI type of compiler if you type in the name of a file 
that hold C source

1) loop is a special provisions made in various programming languages in which we travel through till a certain condition is reached ....

2) whenever we have to print certain number of values repeatedly or constantly we can go for looping structures...

3) whenever a certain same operations has to be performed for different values consecutively we go for looping.....


thank u

by the help of loop we run the part of program many times  with in the a specific condition. that part of program have a range it close in special sign({.......}).

we use loop when we want the given condition is checked 
contineously.

1)loop is used to perform a  particular task till the given 
condition is correct.
2)to run the program effiecently and effecttively.

run a part of a programme till the specified condition is 
satisfied
instead of doing each&every time for printing some values 
we use loop,so time saving

loops are used at times when we need to repeatedly check a 
condion or during in situations when we need to execute 
statements again and again as we need.

ya sure we can write ur own coding for printf & scanf functions.... but writing a function for the two is not that much easy ... in printf we must write our coding such that we have to have contact with VGA ( video graphic application) etc etc....


thank u

go to command prompt  change the directory in which the
program exist and then type command
cpp programname.c
it will generate programname.i file
that's the expanded source code 
//KEEP IT DIRTY

here the basic thing we must understand is that :

printf(); is a function. this printf() always returns the
number of character it processes inside " ".......here it
will return 4 according to me... this will will be assigned
to i and everytime 'i' will be a non zero value always and
also a semicolon is placed after for statement , so compiler
takes that has the next line and PRINTS "HELLO" INFINITELY
since 'i' value is always non zero or always TRUE...

and there is no way for the second printf() to get printed
according to me......... 



thank u

Infinite times
i =printf("Hello");
here printf("hello") will return 5 i.e i=5 which will always
remain true that's why hello will be printed infinate times.

for(i=0;i=printf("Hello");i++);
means
for(i=0;i=printf("Hello");i++)
{
   
}
thats why it will print     Hello     only one time.

"Hello" will be printed infinite time.......

since after the loop there is a semicolon , so according to
the compiler this semicolon will be taken as next line and
the loop will be iterating till the termination condition....


output possibilities :

1)if the variable 'i' which is used as an signed integer
variable , this will take an infinite values and stop at one
instance and it will terminate the application. but wont
display anything in the screen

2) if this is an unsigned variable this will be infinite
with values going on and on without stopping.. but not
displaying it...


conclusion : loop is infinite here.....



thank u

after for lop,there is a semicolon.it means loop terminate
here..condition inside the loop will always true.so it will
be an infinite loop..nothing will be printed on the screen.
for next statement there will be printed any garbage value...

i is a signed integer
it will print  only and only -32768
//KEEP IT DIRTY

4

ans is i=2

i=1i=1etc.

Function Overloading or Polymorphic Behaviour for C
functions can be seen for those functions who accept
variable number of arguments.
They can take any number of arguments and any type of
arguments, its upon the programmer or the code inside it,
that decides what it wants those arguments to be , int ,
char ,float or something else..

ALthough it is not seperate function that runs for different
number and types of arguments, still for the user, a
function will be provided for different types of list of
input parameters, all being sent to the same ('name of the
')function..

#include <stdarg.h>
enum data_type{ TYPE_INT=0,TYPE_STRING=1};
int max( int num_of_arguments,...)
{
va_list arg_list;
va_start(arg_list, num_of_arguments);
data_type type=va_arg(arg_list,data_type);

if(type=TYPE_INT)
{
  int max =0,i;
  for(i = 2; i <= num_of_arguments; i++)
   {
     if((a  = va_arg(arg_list, int)) > max)
          max = a;
     }
}
else
{
//do whaterver..
}
va_end(arg_list);

}

In c also we are allowed to function overloading with
parameters wherever we like.

It is page size. almost 64k in linux OS.
After which we have to use realloc to get more memory.
In case, there is more memory available in dynamic memory
space, then realloc will give the pointer else NULL.

good morining to all ,

C is full of functions.... that point am making it clear.. we cant even get any input or output without using functions...
printf();, scanf(); , getc();, are some of the well known fuctions...

i can say C has some 200 to 300 function approx. i dont know...


thank u

hello 
not coorect but aprocsimet   200-300 fuctuion in c

good morning to you.....


here what i suggest is that , at the time of dynamic memory allocation the memory would not been in the position to allocate that much of huge memory at a single instance...... UR MEMORY WILL BE INCAPABLE IF U TRY TO ALLOCATE A HUGE AMOUNT LIKE ABOVE FOR UR USE.......

u try this.... you declare an array size of 200 or 300... this will give a warning that MEMORY FULL........ the one of the disadvantages in C is that we cant balance a very large amount of data's which are outside the range .... so only we will go for DATA BASE....... 



hope this helps u for getting some ideas.......

thank u

I want to make a point here...I am not sure whether there is a limit to amount of memory that you can allocate using malloc...

I used this code in a program and it ran perfectly fine...

--------------
char **a;
int **val;

a =(char **) malloc ( 1000 * sizeof *a );
 for ( i = 0; i < 1000; i++ )
  a[i] =(char *) malloc ( 1000 * sizeof *a[i] );
 val =(int **) malloc ( 1000 * sizeof *val );
 for ( i = 0; i < 1000; i++ )
  val[i] =(int *) malloc ( 1000 * sizeof *val[i] );

---------------

Keep two pointers, 
1. fast pointer moves two nodes at a time
2. slow pointer moves one node at a time

keep moving both the pointers, once the fast pointer reaches
the end node, your slow pointer would be at middle of the list.

U mean without any looping statements r just for loop????? 
It can be done in a single traversal using Hare n turtle
method as said above using a for or while loop.....
 Without using looping statements d list can't be traversed..  
Plz make the question clear.....

let us take a binary number.. say :

       0000000110101110  (16 bit number)
we already know it's the consersion to HEXA DECIMAL equivalent.... so split the numbers into 4 bits each... like,

      0000 0001 1010 1110 (16 bit number)

and for converting directly there is a conversion called 8421 code...

     8421 | 8421 | 8421 | 8421
     0000 | 0001 | 1010 | 1110

now in the first pass it is zero (from left to right) , second it is 1 , in third it is 10 (A in hexa.) , in fourth it is 14 (E in hexa.)


thus the final representation for the above binary is : 1AE


thank u