Answer Posted / k.kavitha

1) Quick sort

How are portions of a program disabled in demo versions?

1234

---

How can I use a preprocessorif expression to ?

1003

---

Why is main function so important?

1052

---

Explain what is the difference between a free-standing and a hosted environment?

1129

---

There seem to be a few missing operators ..

1007

---

What is the time and space complexities of merge sort and when is it preferred over quick sort?

1016

---

What is the difference between union and structure in c?

1088

---

What is difference between far and near pointers?

989

---

What's a good way to check for "close enough" floating-point equality?

1097

---

Find the second largest element in an array with minimum no of comparisons and give the minimum no of comparisons needed on an array of size N to do the same.

1219

---

What is int main () in c?

1031

---

What is malloc return c?

977

---

Explain enumerated types.

980

---

Explain what is meant by 'bit masking'?

1123

---

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;ia1[i+1]) && (a2[i]>a2[i+1]) ) ) return false; } return true;//assumed that each array doesn't contain duplicate elements in themshelves }

3130

---