Skip to content
Related Articles

Related Articles

UGC-NET | UGC NET CS 2015 Dec – III | Question 21
  • Difficulty Level : Expert
  • Last Updated : 08 May, 2018

Let n = 4 and (a1, a2, a3, a4) = (do, if, int, while).Let p(1 : 4) = (3 / 8, 3 / 8, 1 /8, 1 / 8) and Let q(1 : 4) = (2 / 8, 3 / 8, 1 / 8, 1 / 8, 1 / 8) where p(i) and q(i) denotes the probability with which we search a and the identifier x being searched satisfy ai < x < ai + 1 respectively. The optimal search tree is given by:
(1)
22 (4)
(2)
22 (5)
(3)
22 (6)
(4)
22 (7)

(A) (1)
(B) (2)
(C) (3)
(D) (3)


Answer: (B)

Explanation:

Quiz of this Question

My Personal Notes arrow_drop_up
Recommended Articles
Page :