closed by
207 views

Related questions

3.8k
views
2 answers
3 votes
gatecse asked Dec 17, 2017
3,834 views
//Consider the program void function(int n) { int i,j,count=0; for(i=n/2;i<=n;i++) for(j=1;j<=n;j=j*2) count++; }The complexity of the program is$O(\log n)$O(n^2)$O(n^2 \log n)$O(n \log n)$
1.6k
views
2 answers
3 votes
makhdoom ghaya asked Aug 23, 2016
1,639 views
A transaction can include following basic database access operations :Read_item(X)Write_item(X)Both (A) and (B)None of these
2.2k
views
1 answers
2 votes
makhdoom ghaya asked Aug 16, 2016
2,173 views
The post order traversal of a binary tree is DEBFCA. Find out the preorder traversal.ABFCDEADBFECABDECFABDCEF
608
views
1 answers
1 votes
makhdoom ghaya asked Dec 9, 2015
608 views
The derivative of the function$\int_{0}^{\sqrt{x}} e^{-t^{2}}dt$at $x = 1$ is $e^{-1}$ .