Explain the difference between domain and data element? What are aggregate object?

1046

---

Hello Can anyone please share the interview details for QA positions in Tribal Fusion, Noida. Much Thanks

2489

---

How to update the gui from another thread in c#?

961

---

When load balancing to a real server, which server will be accessed first?

949

---

What is parsing? Mention which class can you use for parsing of xml in iphone?

1

---

how is a server running windows server 2008 configured as a domain controller, such as the domain controller for the root domain or a child domain? : Windows server 2008

307

---

How would you compensate for the lack of experience you have for this position

1120

---

Why we use struts in java?

893

---

Where is teradata rdbms used?

1055

---

Why is my excel file opening blank?

614

---

Explain how can chasm trap be solved?

875

---

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 }

3149

---

Tell me about some macroeconomic trends going on in the world today.

1074

---

Explain what are the types of messages?

910

---

What are the different features of spring framework?

355

---