What is an NPA?

1212

---

How will you communicate between two components?

500

---

What is the function of ctrl e?

686

---

Hi Friends, 1) What precautions i should take as a BI Consultant when it is to UPGRADE the version of ECC (Eg: from R/3 to ECC 6.0)? 2) Will this upgradation affect BI system anyway?

4008

---

what sort of general awareness questions are asked in o.n.g.c entrance exam?????????????????

4690

---

Explain the concept of informed consent in data collection.

1

---

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 }

3236

---

why we are using digital signals for I/O & how to measure this signals is getting or not ?

2039

---

What is the use of member in pf?

1036

---

Why is my windows 10 computer so slow?

910

---

How many types of JDBC Drivers are present and what are they?

1272

---

How many tabs in a tabbed dialog do you consider appropriate?

2193

---

Whether sap consultant work on development server or testing server?

954

---

what is package level logging in log4j?

5

---

Explain the 'valuation area' concept in mm?

1168

---