Register
Filter

Answers by venkat_sirvisetti

1 votes
1
Cominatroics
There are 12 copies of Mathematics, 7 copies of Engineering, 3 different books on Medicine and 2 different books on Economics. Find the number of ways in which one or more than one book can be selected? A. 3421 B. 3111 C. 3327 D. 3201
There are 12 copies of Mathematics, 7 copies of Engineering, 3 different books on Medicine and 2 different books on Economics. Find the number of ways in which one or mor...
1 votes
2
Percentage
In an election involving two candidates ,68 votes were declare invalid .the wining candidate secure 52 % and wins by 98 votes.the total no. of vote polled is.anyone can help me?
In an election involving two candidates ,68 votes were declare invalid .the wining candidate secure 52 % and wins by 98 votes.the total no. of vote polled is.anyone can h...
0 votes
3
UGC NET CSE | January 2017 | Part 3 | Question: 33
Red-black trees are one of many search tree schemes that are “balanced” in order to guarantee that basic dynamic-set operations take _____ time in the worst case. $O(1)$ $O( \lg n)$ $O(n)$ $O(n \lg n)$
Red-black trees are one of many search tree schemes that are “balanced” in order to guarantee that basic dynamic-set operations take _____ time in the worst case.$O(1...
7 votes
6
Join Number of Tuples
Suppose you are given relations r(A, B) and s(A, C). Suppose that r has 10000 tuples, and s has 5000 tuples. Suppose attribute r.A has 1001 distinct values, and s.A also has 1001 distinct values. The maximum possible size of the join result is
Suppose you are given relations r(A, B) and s(A, C). Suppose that r has 10000 tuples, and s has 5000 tuples. Suppose attribute r.A has 1001 distinct values, and s.A also ...
1 votes
8
ISRO2017-62
What will be the output of the following C code? #include <stdio.h> main() { int i; for(i=0;i<5;i++) { int i=10; printf("%d" , i); i++; } return 0; } 10 11 12 13 14 10 10 10 10 10 0 1 2 3 4 Compilation error
What will be the output of the following C code?#include <stdio.h main() { int i; for(i=0;i<5;i++) { int i=10; printf("%d" , i); i++; } return 0; }10 11 12 13 1410 10 10 ...
0 votes
9
Combination
For a game in which 2 partners oppose 2 other partners, six men are available. If every possible pair must play against every other pair, the number of games to be played is 9a) 36 (b) 45 (c) 42 (d) 90
For a game in which 2 partners oppose 2 other partners, six men are available. If every possible pair must play against every other pair, the number of games to be played...