what is 3 tire architecture and how does SAP utilizes this architecture. and how do netweaver came into picture?

941

---

aplitue questions will be based on wich type ?

1231

---

all details of DG UPS HVAC

638

---

pls. tell all the commands for configure cisco router 1900 series.

1516

---



943

---

---

Can share warrants issued by the company be considered as potential equity shares? If yes, then will it be considered for calculating dilutive EPS?

579

---

in a table is b in column k (manikanta,sivananda,muralidhar) i want result like (mnikanta,sivnanda,murlidhar) please slove it

255

---

What is Gradient-based procedure?

431

---

In OC-n why n X 51.84 Mbps??? How 51.84 Mbps is come it is a limit of STS-1 or something else.???

678

---

How to easily move a Window control at runtime?

705

---

why the neutral line is not giving shock to us if we touch it ?

488

---

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 }

1810

---

Why different Pressure switch used in marine boiler water circulation system

390

---

where ESI applicable in Industrial area , WC can be taken from general insurance companies, if so will it be valid ?

394

---

What is the difference between spreading and striking ?

925

---