Answer / vignesh1988i

SEE /... we cant return 1000 variables at a time ... using
call by value...... only call by reference can do it....
tat is. usage of pointers...... since it will change
directly in the address itself.... that's a specality...


#include<stdio.h>
#include<conio.h>
void fun(int *,int *,int *.............1000 int's );
void main()
{
int a1,b1,c1,d1,.............a1000;
fun(&a1,&a2,...... &a1000);
for(int i=0;i<1000;i++)
printf("\n %d",a1);
getch();
}
void fun(int *a1,int *b2,.......... 1000 ptr declarations)
{
*a1=1;
*a2=2
.
.
.
.
.
.
100th varaible =1000;
}

Answer / ramachandran

#include<stdio.h>
int fun(int *a)
{
return ++(*a);
}

int main()
{
int a=0,i,d;
for(i=0;i<100;i++)
{
d=fun(&a);
printf("\n%d",d);
}
getch();
}

Answer / codee

extending the previous answer by passing array instead of
all variables

Answer / mishra@deepa

the first answer is quite long......

just pass an array(1000 elements) and return that.....

Answer / y hussain reddy

#include<stdio.h>
void main()
{
int *a;
a=(int*)malloc(200);
void f(int *);
f(a);

for(i=0;i<100;i++)
printf("%d ",a[i]);
}
void f(int *a)
{

int i;
for(i=0;i<100;i++)
a[i]=i;
}

Answer / vignesh1988i

you r right sir.... but he has asked 1000 VARIABLES.. so
only i done in this way.....

how to find the largest element of array without using relational operater?

6 Answers   Satyam, Wipro,

how to find out the inorder successor of a node in a tree??

2 Answers   TCS, Yahoo,

What is void pointers in c?

0 Answers  

What is the difference between int and float?

3 Answers  

find largest element in array w/o using sorting techniques.

3 Answers   Zycus Infotech,

There are 21 people in a room. They have to form groups of 3 people each. How many combinations are possible? Write a C program to print the same.

1 Answers   HCL, iGate,

The % symbol has a special use in a printf statement. How would you place this character as part of the output on the screen?

0 Answers  

At a shop of marbles, packs of marbles are prepared. Packets are named A, B, C, D, E &#133;&#133;.. All packets are kept in a VERTICAL SHELF in random order. Any numbers of packets with these names could be kept in that shelf as in this example: bottom of shelf ---> [AAAJKRDFDEWAAYFYYKK]-----Top of shelf. All these packets are to be loaded on cars. The cars are lined in order, so that the packet could be loaded on them. The cars are also named [A, B, C, D, E,&#133;&#133;&#133;&#133;.]. Each Car will load the packet with the same alphabet. So, for example, car &#145;A&#146; will load all the packets with name &#145;A&#146;. Each particular car will come at the loading point only once. The cars will come at the loading point in alphabetical order. So, car &#145;B&#146; will come and take all the packets with name &#145;B&#146; from the shelf, then car &#145;C&#146; will come. No matter how deep in the shelf any packet &#145;B&#146; is, all of the &#145;B&#146; packets will be displaced before the &#145;C&#146; car arrives. For that purpose, some additional shelves are provided. The packets which are after the packet B, are kept in those shelves. Any one of these shelves contains only packets, having the same name. For example, if any particular shelf is used and if a packet with name X is in it, then only the packets having names X will be kept in it. That shelf will look like [XXXXXXX]. If any shelf is used once, then it could be used again only if it is vacant. Packets from the initial shelf could be unloaded from top only. Write a program that finds the minimum total number of shelves, including the initial one required for this loading process.

0 Answers   Infosys,

Print all numbers which has a certain digit in a certain position eg: number=45687 1 number=4 2 number=5 etc

4 Answers  

main() { char *p1="Name"; char *p2; p2=(char *)malloc(20); while(*p2++=*p1++); printf("%s\n",p2); }

4 Answers   CitiGroup,

How can I return multiple values from a function?

6 Answers  

HOW DO YOU HANDLE EXCEPTIONS IN C?

2 Answers   AppLabs,