what will be the output:
main(){char ch;int a=10;printf("%d",ch);}
Answers were Sorted based on User's Feedback
Answer / kanmani
I think this program produce some garbage value.
Is This Answer Correct ? | 0 Yes | 0 No |
Answer / vikram
output will be any garbage value since ch is not assigned
any value
Is This Answer Correct ? | 0 Yes | 0 No |
Answer / thirupathi reddy
it doesn't give error
it depends up on compiler u use. but gives some value
Is This Answer Correct ? | 0 Yes | 0 No |
Answer / p.thriveni
it will giv the warning as 'a' is assigned a avalue that
is never be used.
Is This Answer Correct ? | 0 Yes | 0 No |
Explain what are its uses in c programming?
difference between ordinary variable and pointer in C?
please can any one suggest me best useful video tutorials on c i am science graduate.please help me.u can email me to sas29@in.com
how can i make a program with this kind of output.. Enter a number: 5 0 01 012 0123 01234 012345 01234 0123 012 01 0
what are far pointers?
How pointer is benefit for design a data structure algorithm?
What is the use of header files?
Is malloc memset faster than calloc?
Given a valid 24 hour format time find the combination of the value and write a program ,do not hard the value and if any other inputs provided should work with the logic implemented Input: 11:30 Output: 13:10 Input: 18:25 Output: 21:58
What is getch c?
Differentiate between new and malloc(), delete and free() ?
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 }