1 answer
1
Let G be an undirected graph on n nodes. Any two of the following statements implies the third. Is it true or False?1. G is connected.2. G doesn't have cycles.3. G contai...
2 answers
2
Let T be a MST of G.Suppose that we decreased the weight of one of the edge present in G but not in T.How much time will it take to construct MST for modified graph G.
0 answers
8
Database table (R) consist 1000 records. The number of minimum B+ tree index blocks required to build dense B+tree index for relation (R) are _________. Assume order of B...
1 answer
10
0 answers
12
Made easy says answer is option C but i doubt it. Can somebody confirm ?
1 answer
13
if two entities A and B are connected using total participation with relation R then minimum number of tables required in relational model is?
1 answer
14
1 answer
15
Which of the following languages over the alphabet Σ = {a, b, 0} is regular ?
0 answers
17
Can somebody confirm whether below given solution is correct or not? I also got answer 12 but not by following below given method.
1 answer
18
The maximum size of operator stack, when converting the following infix expression to postfix expression? Assume that has the highest precedence and follows right associ...
2 answers
19
0 answers
24
1 answer
27
Consider the following C program segment:struct nodeWhat is the output of above C program when it runs on a root node of a binary tree?prints nodes at K distance from roo...
0 answers
28
Consider we have an algorithm which generate preorder of any tree in Ο(log n) time, we have to create a Binary Search Tree with n distinct element. What will be the wors...
1 answer
30
​​15, 20, 25, 3015, 20, 15, 2015, 15, 15, 15None of these