Register

# ace

300 views
–1 votes
–1 votes
Consider the following instance of OBST (Optimal Binary Search Tree) Problem.

n=4;<a1,a2,a3,a4>=<do,if,int,while>

P(1....4)=<3,3,1,1>;  Q(0....4)=<2,3,1,1,1>

The Cost of OBST(optimal binary search tree) is________
User Avatar

Please log in or register to answer this question.

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

Related questions

0 votes
0 votes
0 answers
1
LavTheRawkstar asked Sep 9, 2018
1,465 views
# Binomial tree # Binomial Heap
What is Binomial tree please explain in easy words. Construct the Binomial heap for the following sequence of numbers 7,2,4,17,1,11,6,8,15,10,20. Also apply the operation of extracting the minimum key in the resulting binomial Heap.
What is Binomial tree please explain in easy words.Construct the Binomial heap for the following sequence of numbers 7,2,4,17,1,11,6,8,15,10,20.Also apply the operation o...
User Avatar
1 votes
1 votes
0 answers
2
LavTheRawkstar asked Sep 9, 2018
663 views
# Backtracking
Find all the possible solution for sum of subset problem for the instance m=35 and S=<1,2,5,7,8,10,15,20,25> using Backtracking. I am totally confused hence please provide me the solution for it.
Find all the possible solution for sum of subset problem for the instance m=35 and S=<1,2,5,7,8,10,15,20,25 using Backtracking.I am totally confused hence please provide ...
User Avatar
0 votes
0 votes
0 answers
3
LavTheRawkstar asked Sep 9, 2018
530 views
# B Tree
Please Derive the Relation in between degree and the height of n keys B Tree. Insert the following information into an Empty B Tree with Degree t=3. F,S,Q,K,C,L,H,T,V,W,M,R,N,P,A,B,X,Y,D,Z,E
Please Derive the Relation in between degree and the height of n keys B Tree. Insert the following information into an Empty B Tree with Degree t=3.F,S,Q,K,C,L,H,T,V,W,M,...
User Avatar
1 votes
1 votes
1 answer
4
LavTheRawkstar asked Sep 9, 2018
1,071 views
# Heap sort
Sort The Following Sequence of input using Heap sort. { 10 , 2 , 1 , 5, 3 ,8 ,11,24 ,7 } Please show the output at every pass because i am getting confused.
Sort The Following Sequence of input using Heap sort.{ 10 , 2 , 1 , 5, 3 ,8 ,11,24 ,7 }Please show the output at every pass because i am getting confused.
User Avatar
Link Copied!