Register
Filter

Answers by rude

7 votes
81
Binary search algorithm employs the strategy of
Binary search algorithm employs the strategy of Divide and Conquer technique Dynamic Programming Branch & Bound technique Greedy Strategy
Binary search algorithm employs the strategy ofDivide and Conquer techniqueDynamic ProgrammingBranch & Bound techniqueGreedy Strategy
10 votes
82
UGC NET CSE | June 2013 | Part 2 | Question: 37
Which of the following connected graph has exactly one spanning tree? Complete graph Hamiltonian graph Euler graph None of the above
Which of the following connected graph has exactly one spanning tree? Complete graph Hamiltonian graph Euler graph None of the above
6 votes
84
Graph having every pair of vertices connected is called
Graph having every pair of vertices connected is called Cycle graph Complete graph Peterson graph Is a Tree
Graph having every pair of vertices connected is calledCycle graphComplete graphPeterson graphIs a Tree
4 votes
85
An undirected graph G has n vertices and n-1 edges then G is
An undirected graph G has n vertices and n-1 edges then G is A. Cyclic B. Addition of edge will make it cyclic C. Eulerian D. Is a Tree
An undirected graph G has n vertices and n-1 edges then G isA. CyclicB. Addition of edge will make it cyclicC. EulerianD. Is a Tree
3 votes
86
ISRO2014-3
What is the output of the following C program? #include<stdio.h> #define SQR(x) (x*x) int main() { int a; int b=4; a=SQR(b+2); printf("%d\n",a); return 0; } 14 36 18 20
What is the output of the following C program? #include<stdio.h #define SQR(x) (x*x) int main() { int a; int b=4; a=SQR(b+2); printf("%d\n",a); return 0; }14361820
23 votes
88
ISRO2008-13
If $N^2 = (7601)_8$ where $N$ is a positive integer, then the value of $N$ is $(241)_5$ $(143)_6$ $(165)_7$ $(39)_{16}$
If $N^2 = (7601)_8$ where $N$ is a positive integer, then the value of $N$ is$(241)_5$$(143)_6$$(165)_7$$(39)_{16}$
8 votes
89
Tree
If a tree is having only two nodes ( May be A and B). and its preorder and postorder is given, then is it possible to construct unique tree?
If a tree is having only two nodes ( May be A and B). and its preorder and postorder is given, then is it possible to construct unique tree?
9 votes
91
UGC NET CSE | September 2013 | Part 2 | Question: 11
The min. number of nodes in a binary tree of depth d (root at level 0) is $(2^d + 1)$ $(2^{(d+1)} - 1)$ $d$ $d + 1$
The min. number of nodes in a binary tree of depth d (root at level 0) is$(2^d + 1)$$(2^{(d+1)} - 1)$$d$$d + 1$
5 votes
92
Splay Tree
The amortized time complexity to perform ______ operation(s) in Splay trees is $O(\log n)$. Search Search and Insert Search and Delete Search, insert and delete
The amortized time complexity to perform ______ operation(s) in Splay trees is $O(\log n)$.SearchSearch and Insert Search and DeleteSearch, insert and delete
3 votes
93
GATE CSE 2005 | Question: 2
An Abstract Data Type (ADT) is: same as an abstract class a data type that cannot be instantiated a data type for which only the operations defined on it can be used, but none else all of the above
An Abstract Data Type (ADT) is:same as an abstract classa data type that cannot be instantiateda data type for which only the operations defined on it can be used, but no...
3 votes
94
relations
1. If she is my friend and you are her friend, then we are friends. Given this, the friend relationship in this context is ________________. (i) Commutative (ii) transitive (iii) implicative (iv) equivalence (A) (i) and (ii) (B) (iii) (C) (i),(ii),(iii) and (iv) (D) None of these
1. If she is my friend and you are her friend, then we are friends. Given this, the friend relationship in this context is ________________.(i) Commutative (ii) transitiv...
4 votes
95
er diagram
The E-R model is expressed in term of I. Entities II. The relationship among entities. III. The attributes of the entities. IV. Functional relationship. (A) I, II (B) I, II, IV (C) II, II, IV (D) I, II, III
The E-R model is expressed in term of I. Entities II. The relationship among entities. III. The attributes of the entities. IV. Functional relationship. (A) I, II (B) I, ...
5 votes
96
physical data structure
Which one of the following is a physical data structure ? Array Linked lists Stacks Tables
Which one of the following is a physical data structure ?ArrayLinked listsStacksTables
6 votes
97
Consider the following function
int unknown(int n) { int i, j,k=0; for(i=n/2;i<=n;i++) for(j=2;j<=n;j=j*2) k=k+n/2; return(k); }
int unknown(int n){ int i, j,k=0;for(i=n/2;i<=n;i++) for(j=2;j<=n;j=j*2)k=k+n/2;return(k);}
6 votes
98
command line argument
What would be the output of the following program, if run from the command line as “myprog 1 2 3” ? main (int argc, char * argv[ ]) { int i ; i = argv[1] + argv[2] + argv[3] ; printf (“% d”, i) ; } 123 6 Error “123”
What would be the output of the following program, if run from the command line as “myprog 1 2 3” ?main (int argc, char * argv[ ]) { int i ; i = argv + argv + argv[...
6 votes
99
ISRO2014-41
Consider the following binary search tree T given below: Which node contains the fourth smallest element in T? Q V W X
Consider the following binary search tree T given below: Which node contains the fourth smallest element in T?QVWX
5 votes
100
Hash
13 votes
101
ISRO2007-01
The Boolean expression $\text{Y = (A}+\overline{\text{B}}+\overline{\text{A}}\text{B})\overline{\text{C}}$ is given by $\text{A}\overline{\text{C}}$ $\text{B}\overline{\text{C}}$ $\overline{\text{C}}$ $\text{AB}$
The Boolean expression $\text{Y = (A}+\overline{\text{B}}+\overline{\text{A}}\text{B})\overline{\text{C}}$ is given by$\text{A}\overline{\text{C}}$$\text{B}\overline{\tex...
8 votes
103
Time Complexity
Consider the following code . What should be the time complexity? j = n ; while (j >= 1){ for (i = 1 to j ) x = x + 1 ; j = n/2 ; } (A)O(logn) (B)O(n logn) (C)O(n ) (D)None of the above
Consider the following code . What should be the time complexity?j = n ;while (j >= 1){ for (i = 1 to j ) x = x + 1 ; j = n/2 ; } (A)O(logn)(B)O(n logn)(C...
5 votes
104
median of 5 elements
how to find median of 5 distinct values with only 6 comparisons?
how to find median of 5 distinct values with only 6 comparisons?
5 votes
105
Algorithms \ Hashing
5 votes
106
C \ predict the output
12 votes
108
Complexity of T(sqrt(N)) + log N
9 votes
109
Regular Expression
Prove that : Let $r_1$, $r_2$, and $r_3$ be regular expressions. L(($r_1$ + $r_2$) . $r_3$) = L($r_1$ . $r_3$ + $r_2$ . $r_3$).
Prove that : Let $r_1$, $r_2$, and $r_3$ be regular expressions. L(($r_1$ + $r_2$) . $r_3$) = L($r_1$ . $r_3$ + $r_2$ . $r_3$).
6 votes
110
Regular expression
Give a regular expression for the language L over Σ = {a, b} of words that contain exectly 2 b's?
Give a regular expression for the language L over Σ = {a, b} of words that contain exectly 2 b's?
Page: