in malloc and calloc which one is fast and why?
Answer / bobby sigh
malloc is more faster than calloc because malloc required
only const sign integer or datatype
while calloc required type,block
so malloc is more faster than calloc
| Is This Answer Correct ? | 13 Yes | 1 No |
Some coders debug their programs by placing comment symbols on some codes instead of deleting it. How does this aid in debugging?
How can I change the size of the dynamically allocated array?
Why we not create function inside function.
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
Write a program in "C" to calculate the root of a quadratic equation ax^2+bx+c=0, where the value of a,b & c are known.
Can you think of a way when a program crashed before reaching main? If yes how?
Are there namespaces in c?
Is the exit() function same as the return statement? Explain.
1 Answers Agilent, ZS Associates,
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 }
Write the program for displaying the ten most frequent words in a file such that your program should be efficient in all complexity measures.
What is static memory allocation? Explain
Explain bit masking in c?