What is YARN?

5

What is an Idoc status?

710

Which component is responsible for processing sql statements and selecting access paths?

641

Explain global assembly cache (gac)?

713

how to find number of run cable laying[LT side] for transformer & alternator secondary side? [above condition for getting output power transformer to main panel side] give the example.

1591

What is spritekit and what is scenekit?

437

How to estimate disk space needed for an export job?

550

which is the best mba specialization for b.tech cse students in marketing,finance,hr?

2605

What is the shortcut to convert number to words in word?

298

What is helper in c++?

559

QN1)Describe how talent warehouse provides a company with easy access to its talent pool? QN1)Describe how recruitment Portal provides requirement for different groups of candidates Tks:)

2503

Explain sessions. Explain how batches are used to combine executions?

581

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 }

2697

What are the only two values that are falsy?

5

Why does Apache send a cookie on every response?

1807