Interested to Buy Any Domain ? << Click Here >> for more details...
struct node {struct node*temp,*new}
prinf("%d",sizeof(struct node));
- 2 Answers
- 4356 Views
- I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / aravind
ok guys.
Here first structure is not ended with a
termination.Structure is nested with another
structure.Usually pointer takes 4 bytes for GCC compiler
and here he defined 2 pointers so o/p would be 8 bytes but
compiler shows error of being undeclared structure
| Is This Answer Correct ? | 2 Yes | 0 No |
Answer / dani
It's architecture dependent. If you have a 32 bit address than the output will be 4 (octets), if the address is 64 bit than it'll be 8.
| Is This Answer Correct ? | 0 Yes | 1 No |
A program to allow an input operand and operator from the operator and read on the display and output operand.
What is the explanation for the dangling pointer in c?
What is a pointer on a pointer in c programming language?
What is alloca() and why is its use discouraged?
Give basis knowledge of web designing ...
What is the output of below code? main() { static in a=5; printf("%3d",a--); if(a) main(); }
hi folks i m approching for h1 b interview on monday 8th of august at montreal and i m having little problem in my approval notice abt my bithdate my employer has made a mistake while applying it is 12th january and istead of that he had done 18 the of january do any body have any solution for that if yes how can i prove my visa officer abt my real birthdate it urgent please let me know guys thaks dipesh patel
What does 2n 4c mean?
How can you check to see whether a symbol is defined?
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 bitwise shift operators in c programming?
#define MAX(x,y) (x) > (y) ? (x) : (y) main() { int i = 10, j = 5, k = 0; k = MAX(i++, ++j); printf("%d %d %d", i,j,k); } what will the values of i , j and k? }
14 Answers CDAC, GATE, NDS, TCS,
C 
