Answer Posted / akash

c secures more privacy than c++

Is it valid to address one element beyond the end of an array?

1123

---

Did c have any year 2000 problems?

1062

---

What are the types of data files?

1154

---

What math functions are available for integers? For floating point?

1078

---

Is c dynamically typed?

1093

---

what is the height of tree if leaf node is at level 3. please explain

2089

---

How do you convert strings to numbers in C?

1170

---

in case any function return float value we must declare a) the function must be declared as 'float' in main() as well b) the function automatically returned float values c) function before declared 'float' keyword d) all the above

977

---

What is structure padding and packing in c?

1008

---

a construct the"else" part of "if" statement contains anoth "if else" statement is called a) if-else b) else-if-else c) if-else-if-else d) chain if/if-else-if

1094

---

Is array a primitive data type in c?

1003

---

What do you understand by friend-functions? How are they used?

1160

---

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

---

What is the purpose of type declarations?

1079

---

What are the types of type specifiers?

985

---