Company Name Starts with ...
#  A  B  C  D  E   F  G  H  I  J   K  L  M  N  O   P  Q  R  S  T   U  V  W  X  Y  Z

TechBook Interview Questions
Questions Answers Views Company eMail

What is optical character recognition?

2382

Post New TechBook Interview Questions


TechBook Interview Questions


Un-Answered Questions

If you don’t declare a return value, what type of return value is assumed?

519


how many protocols are available and what are they?

1842


Explain how to compile using ant script?

48


Define silk fiber?

1


Difference between DELETE and TRUNCATE?

597






can u briefly explain aboutan aryton shunt multirange DC ammeter?

2277


How hydrate is forming along with API?

1779


Expand---------EDP

1984


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 }

2684


What is dml command?

527


What is the best html css editor?

380


Which containers use a flowlayout as their default layout in java programming?

483


Is it possible to restrict the premium payment for a lesser number of years than the duration of thepolicy? : insurance sales

324


Name the command line functions to import and export the DS jobs?

671


Purpose of "/" and "//" operator in python?

487