Answer Posted / andeep singh

Pointer is faster than array if there is only one pointer used

Can you apply link and association interchangeably?

1123

---

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 }

3180

---

What does the function toupper() do?

1117

---

Explain why can’t constant values be used to define an array’s initial size?

1348

---

Why enum is used in c?

946

---

What is the process to create increment and decrement stamen in c?

1054

---

Can a function be forced to be inline? Also, give a comparison between inline function and the C macro?

1087

---

Explain the difference between null pointer and void pointer.

1077

---

number of times a digit is present in a number

2035

---

What is realloc in c?

1080

---

What is output redirection?

1210

---

console I/O functions means a) the I/O operations done on disk b) the I/O operations done in all parts c) the input given through keyboard is displayed VDU screen d) none of the above

1165

---

How to declare pointer variables?

1231

---

Write a code to generate a series where the next element is the sum of last k terms.

1219

---

Is main is user defined function?

1136

---