What is boxing and unboxing? Does it occure automaatically or you need to write code to box and unbox?

980

How soon openstack releases happens?

254

What are functions in database?

960

Explain (in simple ) - root mean square. whats its role in electrical fundamandal.where its used

2406

Do you personally involved with Major incident process ? If yes, how do you manage it in your present organization ? explain with real scenario !

1807

Is it possible to provide multiple input to Hadoop? If yes then how?

508

what's query optimization and without use of IN AND Exist can we get another way data from query

2151

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 }

3194

Why do the pop ups in my wysiwyg editor not work or show gibberish?

98

What are the rules for naming an array?

1072

Which is better — UDP or TCP and why?

1154

Where can I purchase search engine visibility?

794

What is jsp and its architecture?

906

Is not null in php?

959

What are the steps you would take to transfer employee's salary from hr to fi?

965