Interested to Buy Any Domain ? << Click Here >> for more details...
main()
{
int i=5;
printf("%d%d%d%d",i++,i--,i);
}
- 10 Answers
- 13025 Views
- I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / sravan kumer
Answer is 455848 in 'Turbo C++'
because here gave 4 %d's but given variables to print are 3.
So here Turbo C++ will evaluate first 3 parameters given as
---> first i will be evaluated so i=5 because printf() evaluates from right to left.
---> then i-- is 5 because it is post decrement so 1st prints value and then increments i=4
---> then i++ is post increments so 1st prints i value i.e 4
and then it will be incremented to 5.
---> so it printf will print 455 but there is another %d ,printf will handle those with a garbage values i.e 848 here.
so answer is 455848.i.e 455 is common after that some garbage value will be printed.
| Is This Answer Correct ? | 1 Yes | 0 No |
some garbage value , 4,5,5...
why in this o/p garbage value is because only 3 parameters
are passed but we have assigned 4 control strings , where
one control string is useless, so for that compiler will
print garbage value....
| Is This Answer Correct ? | 2 Yes | 4 No |
Answer / sravankumar
printf() function evaluates from right to left
printf("\n %d %d %d",i++,i--,i);
4 5 5
<- <- <- <- <-evaluation of expression
but prints as the way we mentioned in printf() function
i.e first i = 5
then i--= 5 because it is post decrement
then i++= 4 this because i is decremented in above, and
not incremented immediately because is post
increment
So output is : 4 5 5
| Is This Answer Correct ? | 0 Yes | 3 No |
Answer / sunil5a2
4 5 5
printf excutes form lefthand side onwords..
| Is This Answer Correct ? | 0 Yes | 5 No |
What are the types of type qualifiers in c?
What is the best style for code layout in c?
what is c language?
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;i<n1-1;i++) { if( !( (a1[i]>a1[i+1]) && (a2[i]>a2[i+1]) ) ) return false; } return true;//assumed that each array doesn't contain duplicate elements in themshelves }
What are the types of data structures in c?
Can we add pointers together?
Struct(s) { int a; long b; } Union (u) {int a; long b; } Print sizeof(s)and sizeof(u) if sizeof(int)=4 and sizeof(long)=4
IS STRUCTURES CAN BE USED WITHIN AN ARRAY?
the number of measuring units from a arbitrary starting point in a record area or control block to some other point a) branching b) recording pointer c) none d) offset
write a c program to print the next of a particular no without using the arithmetic operator or looping statements?
main() { inta=10,b=20; a>=5?b=100:b=200; printf("%d ",b); }
Can stdout be forced to print somewhere other than the screen?
C 
