Answer Posted / shruti

Kapildalke -> u are rite..

the differance between a structure and union is that,

in structure memory is allocated to each and every element
of the structure.

in union memory allocated is only of the element which
requires maximum memory.

What are the Advantages of using macro

1177

---

Explain how can I avoid the abort, retry, fail messages?

1049

---

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

1138

---

Why & is used in scanf in c?

1102

---

A c program to display count values from 0 to 100 and flash each digit for a secong.reset the counter after it reaches 100.use for loop,. pls guys hepl me.. :(

2257

---

Can math operations be performed on a void pointer?

1052

---

why use "return" statement a) on executing the return statement it immediately transfers the control back to the calling program b) it returns the value present in the parentheses return, to the calling program c) a & b d) none of the above

1081

---

Write a C/C++ program that connects to a MySQL server and checks if the InnoDB plug-in is installed on it. If so, your program should print the maximum number of concurrent threads that the InnoDB plug-in can create.

1942

---

What is meant by int main ()?

1211

---

What should malloc() do?

1170

---

How do you declare a variable that will hold string values?

1179

---

What is integer constants?

1080

---

the maximum length of a character constant can be a) 1 character b) 8 characters c) 256 chaacters d) 125 characters

2302

---

Explain the use of fflush() function?

1085

---

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 }

3189

---