Interested to Buy Any Domain ? << Click Here >> for more details...
Answer Posted / vikesh
int *a[5] means that there are 5 integer pointers[which
store adresess of only integers] whose adresses are in
continous locations and each pointer name is accesed by *a
[0],*a[1]....*a[4].for example
a[0]=n means a[0] points to n, a[1]=p means a[1] points to
p.[where n and p are integers]Let the adress of n and p be
some 625 and 254 respectively. then a[0] will hold 625
whose adress is(assume)1000 and a[1]will hold 254 whose
adress is 1002.similarly the a[2] will hold some adress(if
u make it to point) with its adress 1004 and a[3] will hold
some others adress with its adress 1006 and a[4] will hold
some others adress with its adress 1008.
| Is This Answer Correct ? | 26 Yes | 1 No |
Post New Answer View All Answers
How do I round numbers?
I have written a pro*C program to fetch data from the cursor. where in i have used the concept of BULK FETCH.... each FETCH statement is taking lots of time to fetch specified number of rows at...
What is main () in c language?
How do you convert strings to numbers in C?
find the output? void r(int a[],int c, int n) { if(c>n) { a[c]=a[c]+c; r(a,++c,n); r(a,++c,n); } } int main() { int i,a[5]={0}; r(a,0,5); for(i=0;i<5;i++) printf("\n %d",a[i]); getch(); }
What is pragma in c?
Can i use “int” data type to store the value 32768? Why?
number of times a digit is present in a number
Explain two-dimensional array.
writ a program to compare using strcmp VIVA and viva with its output.
What are the application of void data type in c?
What is bubble sort in c?
At a shop of marbles, packs of marbles are prepared. Packets are named A, B, C, D, E …….. 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,………….]. Each Car will load the packet with the same alphabet. So, for example, car ‘A’ will load all the packets with name ‘A’. Each particular car will come at the loading point only once. The cars will come at the loading point in alphabetical order. So, car ‘B’ will come and take all the packets with name ‘B’ from the shelf, then car ‘C’ will come. No matter how deep in the shelf any packet ‘B’ is, all of the ‘B’ packets will be displaced before the ‘C’ 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.
What is a union?
When can a far pointer be used?
