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

Grasim Database Management Interview Questions
Questions Answers Views Company eMail

can Constraints cannot be exported through EXPORT command ?

2 7113

Post New Grasim Database Management Interview Questions






Un-Answered Questions

Describe Ajax With its Implementation Process ? Give an example?

129


Is there an outlook 2019?

1


How to override a dsn that is contained in a proc called by another proc? I need to do the override in the calling jcl?

108


How do you link a spreadsheet to a website?

67


State the difference between array and array collection?

1






Explain about the component buffer and data buffer?

74


Explain about ruby names?

1


What does a pl/sql package consist of?

77


What are the fictitious assets?

139


Do you have any idea about the recent changes taking place in the Banking Sector?

152


How to add javascript remoting to a vf page?

5


What is the pro & con of having 11kv & 33kv incoming, and what is the adv & disadv. of converting from 11kv to 33kv.

1737


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 }

2217


Is django easy to learn?

1


What is route in mvc?

1