5 answers
2
why not merge sort?we don’t swap in merge sort,we just create auxillary arrays and merge them by changing elements in the original array.should we consider that as a sw...
2 answers
3
The complexity of comparison based sorting algorithm is (nlogn) .How?
9 answers
4
The number of different orders are possible for elements 1, 2, 3, 4, 5, 6, 7 to be inserted in to empty AVL tree such that no rotation will be done and element ‘4’ is...
2 answers
8
The difference between maximum possible profit for $0/1$ Knapsack and fractional Knapsack problem with capacity $(W)=20$.$\begin{array}{|c|c|c|c|c|c|} \hline \text{Item} ...
1 answer
9
Minimum number of tables required to represent the relation R where the $A_n$ stands for the primary key of each entity is ___________
4 answers
10
1 answer
12
3 answers
13
Is it possible that a disconnected graph be an Euler graph ?
12 answers
14
Consider a binary tree T that has $200$ leaf nodes. Then the number of nodes in T that have exactly two children are ______.
2 answers
16
6 answers
17
2 answers
19
3 answers
26
Consider the following relational schema R(ABCDE). The number of super keys in relation R if every two attributes of relation R is candidate keys are __________.Please ex...
0 answers
27
Consider the following graph:Which of the following will represents the chromatic number of the graph?I think ans has to be 3 but given as 4