Register
Filter

Questions by User007

0 votes
1 answer
1
GRAPH THEORY
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 contain n-1 edges.
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...
0 votes
0 answers
2
MADE EASY TEST SERIES
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+ tree root node atleast 1 key atmost 12 key and other nodes of B+ tree order atleast 6 keys and atmost 12 keys.
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...
0 votes
1 answer
4
MADE EASY TEST SERIES
0 votes
0 answers
5
MADE EASY TEST SERIES
Made easy says answer is option C but i doubt it. Can somebody confirm ?
Made easy says answer is option C but i doubt it. Can somebody confirm ?
0 votes
1 answer
6
MADE EASY TEST SERIES
Which of the following languages over the alphabet Σ = {a, b, 0} is regular ?
Which of the following languages over the alphabet Σ = {a, b, 0} is regular ?
1 votes
0 answers
8
MADE EASY TEST SERIES
Can somebody confirm whether below given solution is correct or not? I also got answer 12 but not by following below given method.
Can somebody confirm whether below given solution is correct or not? I also got answer 12 but not by following below given method.
2 votes
1 answer
9
MADE EASY TEST SERIES
The maximum size of operator stack, when converting the following infix expression to postfix expression? Assume that has the highest precedence and follows right associativity is _______. Infix:
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 votes
2 answers
11
MADE EASY TEST SERIES
Consider languages L1 and L2 over alphabet Σ = {a, b}. L1 is known to be a context-free language. L2 = {w|w is prefix of w' ∈ L1} Which of the following is true ? A> L2 need not be CFL B> L2 will be regular ​​​​​​​C> L2 will be CFL D> None of the above
Consider languages L1 and L2 over alphabet Σ = {a, b}. L1 is known to be a context-free language. L2 = {w|w is prefix of w' ∈ L1}Which of the following is true ?A L2 ...
1 votes
0 answers
12
MADE EASY TEST SERIES
Consider the following schedule Consider the following statements : S1 : Schedule(S) is conflict serializable schedule. S2 : Schedule(S) is allowed by 2PL. S3 : Schedule(S) is strict recoverable schedule. S4 : Schedule(S) is allowed by strict 2PL. How many above statements true about schedule(S) ?
Consider the following scheduleConsider the following statements :S1 : Schedule(S) is conflict serializable schedule.S2 : Schedule(S) is allowed by 2PL.S3 : Schedule(S) i...
0 votes
0 answers
13
MADE EASY TEST SERIES
Consider the following schedule Consider the following statements : S1 : Schedule(S) is conflict serializable schedule. S2 : Schedule(S) is allowed by 2PL. S3 : Schedule(S) is strict recoverable schedule. S4 : Schedule(S) is allowed by strict 2PL. How many above statements true about schedule(S) ?
Consider the following scheduleConsider the following statements :S1 : Schedule(S) is conflict serializable schedule.S2 : Schedule(S) is allowed by 2PL.S3 : Schedule(S) i...
1 votes
1 answer
17
MADE EASY TEST SERIES
Consider the following C program segment: struct node What is the output of above C program when it runs on a root node of a binary tree? prints nodes at K distance from root node. print nodes of Kth level of binary tree. Both (a) and (b) None of these
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 votes
0 answers
18
MADE EASY TEST SERIES
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 worst case time complexity?
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...
0 votes
1 answer
20
MADE EASY TEST SERIES
​​ 15, 20, 25, 30 15, 20, 15, 20 15, 15, 15, 15 None of these
​​15, 20, 25, 3015, 20, 15, 2015, 15, 15, 15None of these
Page: