size maximum allocated by calloc()

3 Answers   DELL,

---

what is pointer ?

10 Answers   Kernex Micro Systems,

---

printf(), scanf() these are a) library functions b) userdefined functions c) system functions d) they are not functions

0 Answers  

---

What is c programing language?

0 Answers  

---

what is associativity explain what is the precidence for * and & , * and ++ how the folloing declaration work 1) *&p; 2) *p++;

0 Answers   L&T,

---

---

What are the 4 types of unions?

0 Answers  

---

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 }

0 Answers   Facebook,

---

What is the value of a[3] if integer a[] = {5,4,3,2,1}?

0 Answers  

---

Explain function?

0 Answers  

---

what is ANSI and ISO

7 Answers   HCL,

---

what is the difference between exit() and _exit() functions?

2 Answers  

---

What is the difference between break and continue?

0 Answers  

---