Register

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

• retagged by
944 views
0 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$

1 Answer

Voting & Accepting an answer helps improve the community
Answer:
← Previous · Test by Bikram | Alg...Next → · Discrete Mathematics...
← Previous in category · Test by Bikram | Alg...Next in category → · Gate Sample Practise...
Position:
Show:

Related questions

0 0 votes
2 answers 2 answers
783
783 views
Bikram asked May 26, 2017
783 views
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 __________.
0 0 votes
3 answers 3 answers
1.0k
1.0k views
Bikram asked May 26, 2017
1,048 views
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...
1 1 vote
2 answers 2 answers
993
993 views
Bikram asked May 26, 2017
993 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 ______.
0 0 votes
2 answers 2 answers
1.3k
1.3k views
Bikram asked May 26, 2017
1,271 views
Test by Bikram | Algorithms | Test 2 | Question: 23
Matrix multiplication is associative and MCS ( matrix chain multiplication ) uses the following matrices:$\begin{array} \text{M1} & 10^* 100 \\ M2 & 100^* 5 \\ M3 & 5^* ...