Answer Posted /

What is java sql driver?

535

---

What is the limit set for the characters or number for adwords ad?

3

---

How is WMLScript is differ from JavaScript?

1125

---

Is wordpress blog free?

121

---

Differentiate between managed and unmanaged code?

604

---

---

how service tax work.

1952

---

How do I create a hotkey in windows?

305

---

Please, i am a final year student in nigeria and i have a project on pension fund administration and i need help in starting.

1865

---

In gridview in editmode if we want to display information in one combobox based on

1811

---

Scott connection is used for A 3-phase to 2-phase conversion B to achieve higher effciency C to save copper D to reduce harmonics

1859

---

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 }

2702

---

write test case for ecomerce shopping

2282

---

What is the difference between sum and count in sql?

512

---

what are the two types of licensing options available for using amazon rds for oracle?

100

---

How to Select a cell in a DBGrid ?

1635

---