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

Edison Interview Questions
Questions Answers Views Company eMail

how we can calculate the transformer size.

21 62470

In case of any eventuality, who is your next of kin?

2 44933

As you achieve greater success with the company after some years, Will you like to be a shareholder in our company?

1 20970

why SCR use in power plant

1 1625

Post New Edison Interview Questions




Un-Answered Questions

What is pthread in linux?

437


What are cosmic rays?

639


What do you understand by “preset” during the installation process of bridge bearings?

650


With rpa, is it always necessary that an organization that needs to adopt this approach have to change its entire infrastructure? Why or why not?

1


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 }

2700






what are the other variables?

1481


What do you mean by replication strategy?

48


What velocity in scrum? How it is measured?

5


Write the components microstrategy metadata?

570


Explain what is the special meaning of _sleep and _wakeup?

84


Differentiate accounting and auditing?

645


What is high availability in hadoop?

378


Does the WIC support auto detection?

539


What are the advantages of inversion of control?

142


what’s a fourier transform?

73