Questions and published explanations below are available without starting a test. Some questions may not have a published solution yet.
0 / 17 published solutions
Question 95 NAT · 3.0 marks
Consider a binary search tree consisting of 15 elements. Let m be the maximum height possible
for a given binary search tree, and n be the minimum height possible for a given binary search
tree.
What will be the value of m − n ?
A published solution is not available for this question yet.
Let G = (V, E) be an undirected graph having distinct positive edge weights. Let V be partitioned
into two non-empty sets X and Y. Let e = (s, t) be the minimum cost edge, with s belonging to X and
t belonging to Y. Which of the following statement(s) is/are true?
1. The edge e must belong to each path from s to t.
2. The edge e must belong to the minimum cost spanning tree of G.
A.
Only 1
B.
Only 2
C.
Both 1 and 2
D.
Neither 1 nor 2
A published solution is not available for this question yet.
A binary search tree is used to locate the number 43. Which of the following probe sequences of
compared elements from the root to 43 is/are not possible?
A.
2, 3, 50, 40, 60, 43
B.
61, 52, 14, 17, 40, 43
C.
10, 65, 31, 48, 37, 43
D.
17, 77, 27, 66, 18, 43
A published solution is not available for this question yet.
Consider the following statements and choose the correct ones.
A.B.C.D.
**AppDev1**
**Section Id :** 64065348506
**Section Number :** 8
**Section type :** Online
**Mandatory or Optional :** Mandatory
**Number of Questions :** 15
**Number of Questions to be attempted :** 15
**Section Marks :** 50
**Display Number Panel :** Yes
**Group All Questions :** No
**Enable Mark as Answered Mark for Review and**
Yes
**Clear Response :**
**Maximum Instruction Time :** 0
A published solution is not available for this question yet.