What is single server definition in weblogic server?

814

---

can test automation improve test effectiveness?

1957

---

How to make any rule as a favorite to your manager?

585

---

Why are view recycled?

941

---

Write the syntax for creating a collection and dropping a collection in mongodb.

1

---

What are st01 t-codes used for?

1144

---

How many number of actions possible in qtp?

1032

---

What is the use of temprature compensation?

1138

---

What is more important to you: the money or the work at Laura Ashley?

1106

---

What do you mean by DBMS?

953

---

Wt is the diff bw BPEngine and Integration engine?

2051

---

What are the uses of explode() function?

1030

---

How do I start mongodb in ubuntu?

1

---

why we use for testing of compression strength concrete the size of specimen 150x150x150. why we are not using another dimension like 100x150x100 uneven dimension.

1869

---

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 }

3172

---