Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged optimal-search-tree
5
votes
1
answer
1
UGC NET CSE | December 2015 | Part 3 | Question: 21
Let $n=4$ and $(a_1, a_2, a_3, a_4)$=(do, if, int, while). Let $p(1:4)=\bigg (\dfrac{3}{8}, \dfrac{3}{8}, \dfrac{1}{8}, \dfrac{1}{8} \bigg)$ ... with which we search $a_i$ and the identifier $x$ being searched satisfy $a_i < x < a_{i+1}$ respectively. The optimal search tree is given by:
Let $n=4$ and $(a_1, a_2, a_3, a_4)$=(do, if, int, while). Let $p(1:4)=\bigg (\dfrac{3}{8}, \dfrac{3}{8}, \dfrac{1}{8}, \dfrac{1}{8} \bigg)$ and $q(1:4)=\bigg(\dfrac{2}{8...
go_editor
4.6k
views
go_editor
asked
Aug 9, 2016
Algorithms
ugcnetcse-dec2015-paper3
algorithms
optimal-search-tree
+
–
To see more, click for the
full list of questions
or
popular tags
.
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
