Register
Filter

Recent activity by vijju532

6 answers
5
GATE CSE 2015 Set 2 | Question: 22
An unordered list contains $n$ distinct elements. The number of comparisons to find an element in this list that is neither maximum nor minimum is $\Theta(n \log n)$ $\Theta(n)$ $\Theta(\log n)$ $\Theta(1)$
An unordered list contains $n$ distinct elements. The number of comparisons to find an element in this list that is neither maximum nor minimum is$\Theta(n \log n)$$\Thet...
5 answers
11
MADE EASY TEST-SERIES
Consider R(A,B,C,D,E,F,G) be a relational schema with the following functional dependencies: AC->G, D->EG, BC->D, CG->BD, ACD->B, CE->AG The number of different minimal cover possible are___________?
Consider R(A,B,C,D,E,F,G) be a relational schema with the following functional dependencies:AC->G, D->EG, BC->D, CG->BD, ACD->B, CE->AGThe number of different minimal cov...
2 answers
13
Test by Bikram | Mock GATE | Test 3 | Question: 49
In a hospital $’X’$ births occur randomly at an average rate of $1.8$ births per hour. The probability that we observe $5$ births in a given interval of $2$ hours is ______.
In a hospital $’X’$ births occur randomly at an average rate of $1.8$ births per hour.The probability that we observe $5$ births in a given interval of $2$ hours is _...
7 answers
16
Searching
Q) Consider a sorted array of n numbers. What would be the time complexity of the best known algorithm to find a pair a and b such that |a-b| = k , k being a positive integer. a) O(logn) b) O(n) c)O(nlogn) d)O(n^2) Which of the option is Correct And Why?
Q) Consider a sorted array of n numbers. What would be the time complexity of the best known algorithm to find a pair a and b such that |a-b| = k , k being a positive int...
1 answer
20
DES Algorithm
0 answers
24
self doubt
I HAVE ONE DOUBT REGARDING THE STARVATION AND BOUNDED WAITING BOUNDED WAITING → ~STARVATION THEN USING THE CONCEPT OF CONTRAPOSITIVE IT CAN BE STARVATION → ~BOUNDED WAITING CAN THIS CONCEPT IS APPLICABLE HERE ?
I HAVE ONE DOUBT REGARDING THE STARVATION AND BOUNDED WAITING BOUNDED WAITING → ~STARVATION THEN USING THE CONCEPT OF CONTRAPOSITIVE IT CAN BE STARVATION → ~BOUNDED ...
9 answers
28
AVL tree
The number of different orders are possible for elements 1, 2, 3, 4, 5, 6, 7 to be inserted in to empty AVL tree such that no rotation will be done and element ‘4’ is root are ________.
The number of different orders are possible for elements 1, 2, 3, 4, 5, 6, 7 to be inserted in to empty AVL tree such that no rotation will be done and element ‘4’ is...
1 answer
29
Self doubt
http://faculty.simpson.edu/lydia.sinapova/www/cmsc365/LN365_Lewis/L03-ExampleDiagonal.htm Can someone explain with the diagonalizable table of first problem.viz; power set ??
http://faculty.simpson.edu/lydia.sinapova/www/cmsc365/LN365_Lewis/L03-ExampleDiagonal.htmCan someone explain with the diagonalizable table of first problem.viz; power set...