Register
Filter

Questions by Bikram

0 votes
1 answer
91
Test by Bikram | Algorithms | Test 2 | Question: 30
The cost of optimal binary search tree for the identifier set $(a1, a2, a3) =$ (do, if, while) with $p(1) = 0.3, \ p(2) = 0.2, $ $p(3) = 0.15, q (0) = 0.05, q(1) = 0.15, q(2)= 0.1, q(3) = 0.05$ is: $1.65$ $1.95$ $1.8$ $2.1$
The cost of optimal binary search tree for the identifier set $(a1, a2, a3) =$ (do, if, while) with $p(1) = 0.3, \ p(2) = 0.2, $ $p(3) = 0.15, q (0) = 0.05, q(1) = 0.15...
2 votes
2 answers
93
Test by Bikram | Algorithms | Test 2 | Question: 28
Assume Dijkstra's Algorithm is used to find the shortest paths from node G in the above graph. The total number of edges which are not included in any of the shortest paths from node G are _________.
Assume Dijkstra's Algorithm is used to find the shortest paths from node G in the above graph. The total number of edges which are not included in any of the shortest pat...
1 votes
2 answers
94
Test by Bikram | Algorithms | Test 2 | Question: 27
The total number of LCS (Longest Common Subsequences) of $P = abcd123$ and $Q= badc321$ that can be formed are ______.
The total number of LCS (Longest Common Subsequences) of $P = abcd123$ and $Q= badc321$ that can be formed are ______.
0 votes
1 answer
95
Test by Bikram | Algorithms | Test 2 | Question: 26
Consider the following instance of the knapsack problem : ... above weights and benefits of items, if we need an optimal solution of fractional knapsack problem, the value of maximum benefit will be ______.
Consider the following instance of the knapsack problem :$\begin{array}{|c|c|c|c|c|c|} \hline \text{Item} & a & b & c & d & e \\ \hline \text{Benefit} & 15 & 12 & 9 & 16 ...
0 votes
1 answer
96
Test by Bikram | Algorithms | Test 2 | Question: 25
Let $T$ be a rooted ternary tree where each internal node of $T$ has a maximum of $3$ children. If root is at depth $0$, then maximum total number of vertices $T$ can have with depth $3$ is ______.
Let $T$ be a rooted ternary tree where each internal node of $T$ has a maximum of $3$ children. If root is at depth $0$, then maximum total number of vertices $T$ can hav...
0 votes
3 answers
97
Test by Bikram | Algorithms | Test 2 | Question: 24
Given $n$ number of linearly ordered distinct elements, what will be the worst case time complexity to find $p$-th smallest element $(1 \leq p \leq n)$ from these $n$ elements when $n > 50$? $O(n \log n)$ $O(n^2)$ $O(n)$ $O(\log n)$
Given $n$ number of linearly ordered distinct elements, what will be the worst case time complexity to find$p$-th smallest element $(1 \leq p \leq n)$ from these $n$ elem...
1 votes
1 answer
100
Test by Bikram | Algorithms | Test 2 | Question: 21
The number of comparisons required to find the maximum and minimum element in an array $A[n]$ using Divide and Conquer method is: $(3n/2)+ 2$ $(3n/2) - 2$ $3n$ $3n/2$
The number of comparisons required to find the maximum and minimum element in an array $A[n]$ using Divide and Conquer method is:$(3n/2)+ 2$$(3n/2) - 2$$3n$$3n/2$
2 votes
1 answer
101
Test by Bikram | Algorithms | Test 2 | Question: 20
Consider the following Graph G: The number of minimum cost spanning trees using Kruskal's Algorithm is _________ .
Consider the following Graph G: The number of minimum cost spanning trees using Kruskal's Algorithm is _________ .
0 votes
1 answer
102
Test by Bikram | Algorithms | Test 2 | Question: 19
A hash table of length $7$ uses open addressing with hash function $h(k) = k \text{mod }7$ ... table ? $49,35,75,89,28,16$ $49,28,35,16,75,89$ $75,49,35,89,28,16$ $49,35,28,75,16,89$
A hash table of length $7$ uses open addressing with hash function $h(k) = k \text{mod }7$ and linear probing to resolve collisions.After inserting 6 values in an empty h...
0 votes
3 answers
103
Test by Bikram | Algorithms | Test 2 | Question: 18
The following elements are inserted in sequence to create an AVL tree: $31, 36, 40, 19, 14, 24, 50$ What is the pre-order traversal of the created AVL tree? $36, 19, 14, 31, 24, 40, 50$ $36, 14, 19, 31, 24, 40, 50$ $31, 19, 14, 24, 40, 36, 50$ $31, 19, 14, 24, 36, 40, 50$
The following elements are inserted in sequence to create an AVL tree: $31, 36, 40, 19, 14, 24, 50$What is the pre-order traversal of the created AVL tree?$36, 19, 14, 31...
1 votes
1 answer
104
Test by Bikram | Algorithms | Test 2 | Question: 17
Which of the following are TRUE? $n! = \theta ((n + 1)!)$ $\log4 n = \theta ( \log2 n )$ $\sqrt{\log n} = O(\log \log n)$ (i) & (iii) only (i) & (ii) only (ii) only (i),(ii) and (iii)
Which of the following are TRUE?$n! = \theta ((n + 1)!)$$\log4 n = \theta ( \log2 n )$$\sqrt{\log n} = O(\log \log n)$(i) & (iii) only(i) & (ii) only(ii) only(i),(ii) ...
0 votes
1 answer
105
Test by Bikram | Algorithms | Test 2 | Question: 16
Consider the following max-heap as given below : 9 / \ 6 8 / \ / \ 3 4 5 7 The number of swaps required to convert the given max-heap into min-heap is ______.
Consider the following max-heap as given below : 9 / \ 6 8 / \ / \3 4 5 7The number of swaps required to convert the given max-hea...
0 votes
2 answers
106
Test by Bikram | Algorithms | Test 2 | Question: 15
The length of the longest common subsequence of $L = ( 1,0,0,1,0,1,0,1 )$ and $K =( 0,1,0,1,1,0,1,1,0 )$ is __________.
The length of the longest common subsequence of $L = ( 1,0,0,1,0,1,0,1 )$ and $K =( 0,1,0,1,1,0,1,1,0 )$ is __________.
2 votes
2 answers
107
Test by Bikram | Algorithms | Test 2 | Question: 14
Match the following: ... S 1 - S, 2 - R, 3 - Q, 4- R, 5 - S 1 - S, 2 - P, 3 - Q, 4- R, 5 - S
Match the following:$\begin{array}{|l|l|l|l|} \hline (1) & \text{Multistage graph} & (P) & \text{Divide and conquer}\\ \hline (2) & \text{Convex hull } & (Q) & \text{Dept...
1 votes
2 answers
108
Test by Bikram | Algorithms | Test 2 | Question: 13
Which one of the following is a topological sort for the above graph? $1, 6, 2, 5, 3, 4$ $4, 5, 6, 3, 2, 1$ $2, 4, 5, 6, 3, 1$ $6, 4, 5, 2, 1, 3$
Which one of the following is a topological sort for the above graph?$1, 6, 2, 5, 3, 4$$4, 5, 6, 3, 2, 1$$2, 4, 5, 6, 3, 1$$6, 4, 5, 2, 1, 3$
0 votes
1 answer
109
Test by Bikram | Algorithms | Test 2 | Question: 12
The time complexity of the function mentioned below is: void f(int k[], int n) { int i; printf("%d",n); for(i=0; i<n; i++) { printf("%d",k[i]); } printf("n"); } $O(n^2)$ $O(n \log n)$ $O(n)$ $O(n^3)$
The time complexity of the function mentioned below is:void f(int k[], int n) { int i; printf("%d",n); for(i=0; i<n; i++) { printf("%d",k[i]); } printf("n"); }$O(n^2)$$O(...
Page: