Recent posts tagged iiits-ms

F1 =(logn)! F2=(log(n!)) F3 = (logn)^logn Just one query n! would be a constant rght , so in F1 we are taking factorial of a constant while in second one we are taking lo...

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(n-1)$ the spanning tree will traverse adjacent edges since they contain the least weight.

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 ...