common characteristics of parrot, platybus and kangaroo

2309

actually what is the working of a call center? what is the method of process and how do they get source?

1899

When is the python decorator used?

437

Which key is used to execute a command?

498

how can i text accracy of ETL migration? i am very new to data warehousing. we are writing ETL scripts using SCRIPELLA tool. how can i test the correctness of data. and we are generating reports using pentaho . is there any easy way to test the pentaho. how can test these ETL scripts written in scriptella? thanks in advance

2041

How can I improve my c++ skills?

549

What is uri in laravel?

401

What are filegroups in sql server?

572

What will the ?getdate() function returns in PHP?

639

Explain transformation in rdd. How is lazy evaluation helpful in reducing the complexity of the system?

209

What are good ado.net object to replace to ado recordset object.

560

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 }

2702

What are the vital features of sybase?

465

What we use buffer class in node.js?

231

explain normalization concept? : Sql dba

577