Answer Posted / dhananjay

x=6 beacuse x will contain the latest value.

Explain union. What are its advantages?

1081

---

What's the right way to use errno?

1150

---

what is the different bitween abap and abap-hr?

2342

---

find the sum of two matrices and WAP for it.

1146

---

What is the best way to store flag values in a program?

1084

---

In a switch statement, what will happen if a break statement is omitted?

1069

---

Does c have class?

1127

---

Explain what happens if you free a pointer twice?

1091

---

What does struct node * mean?

1027

---

what is a function method?give example?

2375

---

what are the advanced features of functions a) function declaration and prototypes b) calling functions by value or by reference c) recursion d) all the above

1130

---

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 }

3194

---

What is data type long in c?

1078

---

Why does notstrcat(string, "!");Work?

1155

---

write a program to find the given number is prime or not

4775

---