Explain how to uninstall the libraries in linux?

480

---

How do you do a presentation?

110

---

What is the advantage of using frames?

487

---

Explain currency filter?

448

---

Explain insurance project modules,and what we need to test on which functionality?

597

---

---

Is microsoft access being discontinued?

459

---

What does jdbc do?

518

---

What is a runtime error on a website?

450

---

How is inline positioning different from the normal positioning of components inside joomla?

66

---

Can you instantiate an abstract class c#?

497

---

On which version of apache you have worked?

497

---

When should I use selenium grid?

556

---

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 }

2696

---

Mention some open source cloud computing platform databases?

311

---

I have qtp 9.5 demo ver,I am not able to record the yahoo broeser.so anyone can tell me what setting i have to do in QTP for yahoo brower recording. why its not recognise the object of yahoo browser????

2139

---