Answer Posted / nila

d.computes compound interest for 1 year

What is a union?

991

---

What are nested functions in c?

979

---

What do the functions atoi(), itoa() and gcvt() do?

1140

---

In which layer of the network datastructure format change is done

1841

---

Give differences between - new and malloc() , delete and free() ?

1049

---

Some coders debug their programs by placing comment symbols on some codes instead of deleting it. How does this aid in debugging?

1083

---

Difference between linking and loading?

1065

---

What are the c keywords?

1148

---

Can a variable be both const and volatile?

1074

---

How are strings stored in c?

977

---

Explain which of the following operators is incorrect and why? ( >=, <=, <>, ==)

980

---

What is include directive in c?

1097

---

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

---

find the output? void r(int a[],int c, int n) { if(c>n) { a[c]=a[c]+c; r(a,++c,n); r(a,++c,n); } } int main() { int i,a[5]={0}; r(a,0,5); for(i=0;i<5;i++) printf("\n %d",a[i]); getch(); }

2265

---

Add Two Numbers Without Using the Addition Operator

773

---