What can I use instead of microsoft access?

431

what are the basic production planning problems?

1594

Are there any linux phones?

442

What are your salary requirements at Aflac?

730

Which java collection class can be used to maintain the entries in the order in which they were last accessed?

558

Explain the advantages of django?

216

Explain the difference between Viewbag and Viewdata in ASP.NET MVC?

567

What is sql rdbms?

533

Mention what is the use of the default route {resource}.axd/{*pathinfo} ?

1

What are the functions of database management system?

457

How to handle exceptions that are raised in a component?

586

Explain the different kinds of frameworks in automation?

486

Which is the latest Selenium tool?

591

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 }

2710

How do I automatically color code in excel?

307