Answer Posted / arunthathi

it's 3404. i had worked upto this level.

pierrot's divisor program using c or c++ code

2238

---

What is hashing in c?

1163

---

can any one tel me wt is the question pattern for NIC exam

1968

---

Explain threaded binary trees?

1156

---

How to throw some light on the b tree?

1081

---

How does normalization of huge pointer works?

1167

---

What is cohesion and coupling in c?

1031

---

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 }

3184

---

Should I use symbolic names like true and false for boolean constants, or plain 1 and 0?

1055

---

How is = symbol different from == symbol in c programming?

1040

---

What are the benefits of c language?

1174

---

Why is c called c not d or e?

1096

---

Here is a good puzzle: how do you write a program which produces its own source code as output?

1093

---

why use functions a) writing functions avoids rewriting the same code over and over b) using functions it becomes easier to write programs and keep track of what they are doing c) a & b d) none of the above

1152

---

What is atoi and atof in c?

1084

---