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

Nokia Oracle Errors Interview Questions
Questions Answers Views Company eMail

RMAN-20000: abnormal termination of job step

1 2042

Post New Nokia Oracle Errors Interview Questions




Nokia Oracle Errors Interview Questions


Un-Answered Questions

Is apache nifi an etl tool?

79


Have you developed custom transaction software?

87


What is a benefit of using a style sheet?

15


Why star delta starter is preferred with induction motor?

131


State the difference between union and union all?

103






Can I learn python without knowing html?

67


Is donut a version of android os?

81


What are local static variables? How can you use them?

110


How can we do validation of the fields in a project?

117


What command is used to refresh dependencies?

1


Explain the data records in idocs?

98


Why do we need ajax?

75


what is meant by shear center?????

1522


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 }

2201


What does method list of soap consists of?

81