Answer Posted / vamshi krishna

write a code that checks area of triangle formula i.e
x1(y3-y2)+x2(y1-y3)+x3(y2-y1)=0.

if zero points lie on same line

Why malloc is faster than calloc?

1014

---

Why n++ execute faster than n+1 ?

2844

---

What is difference between structure and union with example?

989

---

what do u mean by Direct access files? then can u explain about Direct Access Files?

2031

---

difference between Low, Middle, High Level languages in c ?

2024

---

I need a sort of an approximate strcmp routine?

986

---

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 }

3127

---

Explain what is a static function?

1047

---

Is fortran still used today?

1041

---

Give me the code of in-order recursive and non-recursive.

1320

---

Define the scope of static variables.

1064

---

What does the c in ctime mean?

1018

---

What is a struct c#?

998

---

how to print the character with maximum occurence and print that number of occurence too in a string given ?

2412

---

What are the uses of a pointer?

1101

---