Question Posted /

Answer Posted /

Is This Answer Correct ?    Yes No



Post New Answer       View All Answers


Please Help Members By Posting Answers For Below Questions

What is the beast way to write CTE in SQL Server ?

553

How to filter out the default route from outgoing bgp advertisements?

485

I have placed a PO for an item 100 qty Rs.10/Per qty , therefore total cost of the item is Rs. 1000, and this PO Is GR based invoice verification checked. Vendor is sending me 100 QTY but my store keeper doing GRN only for 98, because he is saying that he lost two quantity, so the GRN has been made for Rs 980. Now the vendor is sending me the invoice for total 100 Qty , which is coming to RS.1000 in total. Now you need to do invoice verification for this RS. 1000 to vendor. Will you able to do? If so how? If not why?

1057

how to ctrl motor by use of ac or dc drive.plz explain evdintly

1473

why are SRAMs used in small memory application and DRAMs used in large memory appllication

1617




What is the default scope of bean in spring framework?

166

What is the difference between cocoa and cocoa touch?

406

Explain about the techniques for processing xml files?

476

hi.... i need tamil nadu SI police modal question paper can an one help me my mailing id is kettaven46@gmail.com

1949

What are the functionalities provided by the context package to enhance the beanfactory functionality?

140

Your table has a large character field there are queries that use this field in their search clause what should you do?

495

How do you select multiple objects during merging the files?

680

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 }

2696

Who were the ancient indian astronomers?

81

How much ram do I need for data science?

85