Answer Posted / amit kamble

POINTER HOLDS THE ADRESS OF THE OTHER VARIABLE;

What is graph in c?

1010

---

Is calloc better than malloc?

976

---

Do you have any idea about the use of "auto" keyword?

1052

---

Explain zero based addressing.

968

---

Write a program with dynamically allocation of variable.

1071

---

the process of defining something in terms of itself is called (or) in C it is possible for the functions to call themselves. A function called a) nested function b) void function c) recursive function d) indifinite function

1266

---

Write a program in c to replace any vowel in a string with z?

1078

---

What are predefined functions in c?

1024

---

What is the difference between c &c++?

1090

---

What is #error and use of it?

1201

---

What are volatile variables in c?

893

---

What is the use of bit field?

1120

---

What is volatile variable in c with example?

1000

---

What is ## preprocessor operator in c?

1026

---

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 }

3130

---