Answer Posted / vishnu

There is no non volatile key word in C.
we have volatile const
we have const
we have volatile key words.

Can math operations be performed on a void pointer?

1043

---

Explain what is the benefit of using const for declaring constants?

1031

---

Why does everyone say not to use scanf? What should I use instead?

1422

---

What is the right way to use errno?

1049

---

What is a far pointer in c?

1043

---

explain what is an endless loop?

1082

---

How do you convert a decimal number to its hexa-decimal equivalent.Give a C code to do the same

1098

---

What is include directive in c?

1154

---

Write the syntax and purpose of a switch statement in C.

1102

---

What is the use of sizeof () in c?

1048

---

What is nested structure with example?

1072

---

Is multithreading possible in c?

1011

---

Why malloc is faster than calloc?

1063

---

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 }

3185

---

Explain the Difference between the New and Malloc keyword.

1128

---