Register

Test by Bikram | Algorithms | Test 2 | Question: 30

• edited by
485 views
0 votes
0 votes

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. $1.65$
  2. $1.95$
  3. $1.8$
  4. $2.1$
• edited by
User Avatar

1 Answer

Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
2 answers
2
Bikram asked May 26, 2017
366 views
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
1 votes
2 answers
3
Bikram asked May 26, 2017
484 views
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
0 votes
1 answer
4
Bikram asked May 26, 2017
331 views
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
Link Copied!