Answer Posted / vinnothkumar

its compiler dependent

How can I delete a file?

1032

---

How can type-insensitive macros be created?

1148

---

Explain what is the difference between far and near ?

1063

---

Why array is used in c?

985

---

What language is lisp written in?

1201

---

Tell us two differences between new () and malloc ()?

1144

---

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 }

3150

---

What is a built-in function in C?

1549

---

how to introdu5ce my self in serco

1965

---

Why is a semicolon (;) put at the end of every program statement?

1051

---

What is pass by value in c?

1033

---

Why c is called procedure oriented language?

1011

---

Which is better oop or procedural?

1017

---

What is a lookup table in c?

1071

---

Is sizeof a keyword in c?

943

---