Why mongodb logging so many “connection accepted” events?

5

---

Can you differentiate between hybrid cloud and public cloud?

663

---

Can two jms servers share the same persistent store? : BEA Weblogic

944

---

Is java an api?

967

---

Is hashmap synchronized?

1061

---

Explain what is mr and what information does mr consists of?

1362

---

If my browser does not support cookie, and my server sends a cookie instance what will happen?

1141

---

How are unit tests for your app started in sap web ide?

574

---

What is the use of super bom?

489

---

Why was the decision made to make padding apply outside of the width of a 'box', rather than inside, which would seem to make more sense?

657

---

What is a farm account?

812

---

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 }

3230

---

What are css counters?

692

---

What do you know about THP-1 cell line ?

1889

---

Which is better Oracle or MS SQL? Why?

5025

---