Register

Recent questions tagged tbb-algorithms-2

0 votes
1 answer
1
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...
User Avatar
2 votes
2 answers
3
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...
User Avatar
1 votes
2 answers
4
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 ______.
User Avatar
0 votes
1 answer
5
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 ...
User Avatar
0 votes
1 answer
6
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...
User Avatar
0 votes
3 answers
7
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...
User Avatar
1 votes
1 answer
10
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$
User Avatar
2 votes
1 answer
11
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 _________ .
User Avatar
0 votes
1 answer
12
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...
User Avatar
1 votes
1 answer
14
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) ...
User Avatar
0 votes
1 answer
15
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...
User Avatar
0 votes
2 answers
16
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 __________.
User Avatar
2 votes
2 answers
17
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...
User Avatar
1 votes
2 answers
18
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$
User Avatar
0 votes
1 answer
19
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(...
User Avatar
1 votes
2 answers
21
Test by Bikram | Algorithms | Test 2 | Question: 10
In Strassen's Matrix Multiplication, what is the number of additions and multiplications done to get a better complexity than the normal matrix multiplication? $7$ and $16$ $18$ and $7$ $10$ and $8$ $7$ and $7$
In Strassen's Matrix Multiplication, what is the number of additions and multiplications done to get a better complexity than the normal matrix multiplication?$7$ and $16...
User Avatar
0 votes
1 answer
22
Test by Bikram | Algorithms | Test 2 | Question: 9
Linked Lists are not suitable for : Binary Search Polynomial Manipulation Insertion Radix Sort
Linked Lists are not suitable for :Binary SearchPolynomial ManipulationInsertionRadix Sort
User Avatar
0 votes
2 answers
25
Test by Bikram | Algorithms | Test 2 | Question: 6
$O(n^k)$ is complexity of the best method that finds longest Palindrome Substring in a word. For example, in the word "Atatb", the longest palindrome string is "tat". Then, the value of $10^*K$ is __________.
$O(n^k)$ is complexity of the best method that finds longest Palindrome Substring in a word. For example, in the word "Atatb", the longest palindrome string is "tat". The...
User Avatar
0 votes
1 answer
26
Test by Bikram | Algorithms | Test 2 | Question: 5
A problem called Boolean Parenthesis Matching (match all parenthesis in an expression) can be solved by: Greedy Approach Recursion Dynamic Approach Both [B] and [C]
A problem called Boolean Parenthesis Matching (match all parenthesis in an expression) can be solved by:Greedy ApproachRecursionDynamic ApproachBoth [B] and [C]
User Avatar
0 votes
1 answer
28
Test by Bikram | Algorithms | Test 2 | Question: 3
Which of the following algorithms CANNOT be designed without recursion? Tower of Hanoi Fibonacci Series Tree Traversal None of the above
Which of the following algorithms CANNOT be designed without recursion?Tower of HanoiFibonacci SeriesTree TraversalNone of the above
User Avatar
0 votes
3 answers
29
Test by Bikram | Algorithms | Test 2 | Question: 2
Find the time complexity of the function function( int n) { int i=1; while( i<n) { int j=n; while( j>0) j=j/2; i=2*i; } } $O(\log n)$ $O(n^2 \log n )$ $O(\log 2 n)$ $O( \log n^2 )$
Find the time complexity of the functionfunction( int n) { int i=1; while( i<n) { int j=n; while( j>0) j=j/2; i=2*i; } }$O(\log n)$$O(n^2 \log n )$$O(\log 2 n)$$O( \log n...
User Avatar
1 votes
2 answers
30
Test by Bikram | Algorithms | Test 2 | Question: 1
Which of the following theorems can solve all Recurrence Relations? Mater Tehorem Akra-Bazzi Theorem Both [A] and [B] Akra-Bazzi can be applied to some cases but not for all.
Which of the following theorems can solve all Recurrence Relations?Mater TehoremAkra-Bazzi TheoremBoth [A] and [B]Akra-Bazzi can be applied to some cases but not for all....
User Avatar
To see more, click for the full list of questions or popular tags.