Answer Posted / n

int a[5]={5,5,5,5,5};

What is a pragma?

1123

---

C program to find all possible outcomes of a dice?

2351

---

How to Throw some light on the splay trees?

1062

---

What is the size of enum in c?

1112

---

program to convert a integer to string in c language'

2453

---

Write a program which returns the first non repetitive character in the string?

1120

---

What is the use of linkage in c language?

1055

---

What is clrscr ()?

1106

---

Explain how can you tell whether two strings are the same?

1010

---

Tell me when is a void pointer used?

1172

---

Explain the advantages and disadvantages of macros.

1097

---

What does calloc stand for?

1155

---

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 }

3184

---

How does sizeof know array size?

1114

---

List a few unconditional control statement in c.

983

---