Answer Posted / rama krishna sidhartha

A data structure is a collection or organization of the data
in computer memory
(or)
A data structure is arrangement of data in a computer's
memory or even disk storage.

In linear and non-linear data structures, linear data
structure is better than non linear data structure. Because
in linear data structure, the elements of the data structure
are represented in the sequence. Whereas, in non linear data
structure is not in sequence.

Are the expressions * ptr ++ and ++ * ptr same?

1088

---

What is the difference between abs() and fabs() functions?

1060

---

a=10;b= 5;c=3;d=3; if(a printf(%d %d %d %d a,b,c,d) else printf("%d %d %d %d a,b,c,d);

1068

---

What are the two types of structure?

1040

---

What is strcmp in c?

1018

---

Explain the ternary tree?

967

---

what are # pragma staments?

2000

---

What is the explanation for cyclic nature of data types in c?

1140

---

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 }

3127

---

What is meant by recursion?

997

---

Explain null pointer.

1041

---

What are types of structure?

1065

---

Differentiate between a structure and a union.

1227

---

Tell me what are bitwise shift operators?

1091

---

What are the data types present in c?

1091

---