What kind of mvc is struts 2?

561

---

what is the difference between jsp and servlets ?

570

---

Define the term thrift

98

---

What is the use of the invocable method annotation ?

238

---

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 }

2720

---

---

Is there structure in c++?

594

---

Explain how does voip work?

576

---

What is pragma in sql?

624

---

Why do we need Sessions?

586

---

Explain about dynamic diagrams?

569

---

Hi friends ineed finacial analyst interview question Pls share it

1532

---

Do you know SQL? I know SQL but i don't have any experience...that's it..No more questions ...simply he said " you can leave for the day" ...guys prepare SQL Quires before attending interview in bank of america...

1324

---

What are differences between Testing in Uncontrolled Environment and Abnormal Environment?

2378

---

I'm looking for a mnaual set for a Teradyne J750. Softcopy would be preferred but I'll take what I can get.

1759

---

How many ways are there to do 'remove duplicate records in informatica'?

589

---