Register
Filter

Recent activity by venkat_sirvisetti

1 answer
2
Pointer and Array
What is the output of the above program? Explanation: (*(*(*p)[1]-2)) = E (*(*(*p)[0]+1)) = A E - A = 4
What is the output of the above program?Explanation:(*(*(*p) -2)) = E (*(*(*p)[0]+1)) = A E - A = 4
2 answers
4
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...
12 answers
5
GATE CSE 2015 Set 2 | Question: 11
Consider the following C function. int fun(int n) { int x=1, k; if (n==1) return x; for (k=1; k<n; ++k) x = x + fun(k) * fun (n-k); return x; } The return value of $fun(5)$ is ______.
Consider the following C function.int fun(int n) { int x=1, k; if (n==1) return x; for (k=1; k<n; ++k) x = x + fun(k) * fun (n-k); return x; }The return value of $fun(5)$...
1 answer
7
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...
4 answers
9
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...
5 answers
12
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 ...
8 answers
15
ISRO2017-17
Which of the following data structure is useful in traversing a given graph by breadth first search? Stack Queue List None of the above
Which of the following data structure is useful in traversing a given graph by breadth first search?StackQueueListNone of the above
0 answers
16
#Database#B+Tree
A B+ tree of order 'd' is a tree in which each internal node has between 'd' and '2d' keys values. The root has between 1 and '2d' values. What is the maximum number of internal nodes in a B+ tree of order 4 with 52 leave??
A B+ tree of order 'd' is a tree in which each internal node has between 'd' and '2d' keys values. The root has between 1 and '2d' values. What is the maximum number of i...
4 answers
17
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 ...
3 answers
18
ISRO 2017-5
Which of the following concurrency control protocol ensures both conflict and free from deadlock? , Time stamp ordering 2 Phase locking Both (a) and (b) None of the above
Which of the following concurrency control protocol ensures both conflict and free from deadlock? ,Time stamp ordering2 Phase lockingBoth (a) and (b)None of the above
3 answers
21
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...