What are three key traits a dental assistant needs to have?

1973

---

What are the new features of windows 7 and windows accessories?

891

---

what is insert all statement in sql

6513

---

What is a component angular?

829

---

What are the various tasks in the sap hana which are performed by the modeling studio?

555

---

What size is a 16 9 powerpoint slide?

332

---

What does history command do in linux?

1190

---

How to create web garden?

899

---

What is the use of ‘finalize’?

1021

---

Explain user objects?

883

---

What is dpf in db2?

1109

---

How can u expose a property ? What is a linked property ?

489

---

a table has 2 classifications 1)liabilities 2)earnings this liabitity has 2 elements with 2 input values and the earnings have 2 elements with 2 input values i wrote a query so that my input is liability savings amount1 amount2 xxxx null xxxxxx 0 xxx1 null xxxxx1 0 null yyyy 0 yyyy null yyy1 0 yyy1 my problem is --when i developed a report(d2k) with this data my o/p is liabilities,amount1,savings,amount2 xxxx xxxxxx xxx1 xxxxx1 yyyy yyyy yyy1 yyy1 how could i move this savings,savings values 2 palces up. can any body provide me witha better solution

2262

---

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 }

3189

---

WET BULB TEMPERATURE AND DRY BULB TEMPERATURE?

2363

---