What is set operator oracle?

560

What is the difference between folder and directory?

532

how to view item configuration of install base?

1316

What WebSphere Application Server proprietary extensions provide for J2EEâ„¢ security?

496

Mention some important features of spm in cassandra?

83

In si units, one ton of refrigeration is equal to ?

735

If income and expense both are equal then what it depicts

1560

What Kinds of Testing should be followed for an web application while Manual Testing . Ie., Regression , Integration , Alpha , Beta , Performance , Stress ,Load , Back End(database)...etc What is the serial way to follow the above Testing Kinds in manual testing of any application. Plz clear my doubt.

1566

Is it possible to use two instances of UFT on the same machine? If not why?

636

WHERE CAN I GET THE PREVIOUS QUESTION PAPERS OF Govt Polytechnic in deee 2nd year papers

2347

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 }

2746

Is BCNF better than 2NF & 3NF? Why?

649

What is the difference between pct and fct?

684

Have you heard of ban duplicate classes maven enforcer plugin? What is its use?

192

What is the use of an evaluation path?

582