Answer Posted / raj

There is no difference between const volatile int i and
volatile const int j

Why dont c comments nest?

1054

---

What is the use of printf() and scanf() functions?

1136

---

Write a program, where i have a grid with many cells, how many paths are possible from one point to other desired points.

1242

---

What is a c token and types of c tokens?

1072

---

What is putchar() function?

1170

---

Why do we write return 0 in c?

1074

---

What are void pointers in c?

1004

---

What is the function of this pointer?

1349

---

Why functions are used in c?

1144

---

What is pre-emptive data structure and explain it with example?

3740

---

Is it possible to pass an entire structure to functions?

998

---

Is c is a procedural language?

1101

---

Write a program to swap two numbers without using third variable?

1316

---

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 a class c rental property?

1102

---