Recent posts tagged iiits-ms

1
Option A is correct because height $5$ means level $6$ so maximum node $= 2^l -1 =2^6 -1=63$and for minimum, at each level only single node so total $6$.
2
$2(n-1)$ the spanning tree will traverse adjacent edges since they contain the least weight.
3
In a round-robin tournament with m players, every two players play one game in which one player wins and the other loses. We want to find conditions on positive integers ...
To see more, click for the full list of questions or popular tags.