What is Independent Testing?

2068

Define a triglyceride?

1000

How to Compare Sockets to Pipes?

1353

What command would you use to create an index?

1047

Any details about secatt apart from SAPSecurity online.com?

2305

How many web config files can be created for an application?

853

What are different types of information views?

79

What is the difference between user and versatile user?

1063

What is difference between investment order, internal order and accrual orders? : cost center accounting

1107

What are testing techniques? What is difference between general and specific?

2228

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 }

3180

What is meant by a fully declarative workflow?

770

Name the two most abundant elements in the universe?

959

What are negative indexes?

873

Is it advisable to cool a fin fan by spraying demineralized water on it?

1175