Golgappa.net | Golgappa.org | BagIndia.net | BodyIndia.Com | CabIndia.net | CarsBikes.net | CarsBikes.org | CashIndia.net | ConsumerIndia.net | CookingIndia.net | DataIndia.net | DealIndia.net | EmailIndia.net | FirstTablet.com | FirstTourist.com | ForsaleIndia.net | IndiaBody.Com | IndiaCab.net | IndiaCash.net | IndiaModel.net | KidForum.net | OfficeIndia.net | PaysIndia.com | RestaurantIndia.net | RestaurantsIndia.net | SaleForum.net | SellForum.net | SoldIndia.com | StarIndia.net | TomatoCab.com | TomatoCabs.com | TownIndia.com
Interested to Buy Any Domain ? << Click Here >> for more details...




#include<stdio.h>

main()

{

int a[3];

int *I;

a[0]=100;a[1]=200;a[2]=300;

I=a;

Printf(“%d\n”, ++*I);

Printf(“%d\n”, *++I);



Printf(“%d\n”, (*I)--);

Printf(“%d\n”, *I);

}

what is the o/p



a. 101,200,200,199

b. 200,201,201,100

c. 101,200,199,199

d. 200,300,200,100

Answer Posted / mann

a. 101,200,200,199

Is This Answer Correct ?    7 Yes 0 No



Post New Answer       View All Answers


Please Help Members By Posting Answers For Below Questions

What are qualifiers and modifiers c?

1069


Write a C/C++ program to add a user to MySQL. The user should be permitted to only "INSERT" into the given database.

2026


What is sizeof array in c?

1119


What is .obj file in c?

1136


What is use of integral promotions in c?

1209


Differentiate between a structure and a union.

1337


How can I avoid the abort, retry, fail messages?

1189


Explain what is the difference between functions getch() and getche()?

1114


How many loops are there in c?

1168


You have given 2 array. You need to find whether they will create the same BST or not. For example: Array1:10 5 20 15 30 Array2:10 20 15 30 5 Result: True Array1:10 5 20 15 30 Array2:10 15 20 30 5 Result: False One Approach is Pretty Clear by creating BST O(nlogn) then checking two tree for identical O(N) overall O(nlogn) ..we need there exist O(N) Time & O(1) Space also without extra space .Algorithm ?? DevoCoder guest Posted 3 months ago # #define true 1 #define false 0 int check(int a1[],int a2[],int n1,int n2) { int i; //n1 size of array a1[] and n2 size of a2[] if(n1!=n2) return false; //n1 and n2 must be same for(i=0;ia1[i+1]) && (a2[i]>a2[i+1]) ) ) return false; } return true;//assumed that each array doesn't contain duplicate elements in themshelves }

3245


How can I remove the trailing spaces from a string?

1128


code for replace tabs with equivalent number of blanks

2220


What is the difference between test design and test case design?

2137


What is indirection? How many levels of pointers can you have?

1211


What are two dimensional arrays alternatively called as?

1247