Register

Design and analysis of algorithm, Algorithm

• edited by
401 views
0 votes
0 votes
What are dummies in Optimal binary Search Tree algorithm..?

And is Cost  calculated on the basis of Probability of Search keys only or  On the basis of value on Search Element (At last it has to build a binary tree so it need to check on Values of Search Elements Also then why do we only consider probability whiile calculating Cost )..??

At last
• edited by
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

1 votes
1 votes
1 answer
1
Rishav Kumar Singh asked Jul 26, 2018
423 views
UBC Intermediate Algorithm Design and Analysis (CPSC 320) Summer 2009
Analyze the runtime of the following piece of code. Give a bound using Θ notation. function Pesky(n) r ←0; for i ←1 to n do for j ←1 to i do for k ← j to i+j do r ←r + 1; return r;
Analyze the runtime of the following piece of code. Give a bound using Θ notation.function Pesky(n)r ←0;for i ←1 to ndo for j ←1 to ido for k ← j to i+jdo r ←r...
User Avatar
0 votes
0 votes
1 answer
3
Edwees asked Feb 6, 2017
1,906 views
Design and Analysis of Algorithm
We have a list of pairs [("Tariq",71),("Brinda",85),("Shweta",71),("Sunita",85),("Salma",72),("Uday",60)], where each pair consists of a student's name and his/her marks in a ... ,60),("Tariq",71),("Shweta",71),("Salma",72),("Sunita",85),("Brinda",85)]
We have a list of pairs [("Tariq",71),("Brinda",85),("Shweta",71),("Sunita",85),("Salma",72),("Uday",60)], where each pair consists of a student's name and his/her marks ...
User Avatar
Link Copied!