Where is the windows update database stored?

427

---

When should you increase copy latches? What parameters control copy latches?

290

---

Explain the responsibilities of a data analyst?

195

---

What is the difference between the sapscript texts, 'customer &kna1-kunnr&' and '&customer kna1-kunnr&'?

585

---

can u send me the supporting issues in oracle apps scm functional such as inventory,purchasing and order management

4296

---

---

What is Ajax? How it is related to your project?

612

---

Explain the types of linking function?

441

---

What are all the protocols supported by httpservlet?

640

---

What are the data providers?

479

---

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 }

2695

---

Explain about the constants which help in debugging?

836

---

What is toast notification?

500

---

Tell me what is the use of "ksort" in php?

547

---

What do you comprehend by the composition arrange?

174

---

How do you use pivot tables?

289

---