I. S can launch a birthday attack to replace m with a fraudulent message.
II. A third party attacker can launch a birthday attack to replace m with a fraudulent
message.
III. R can launch a birthday attack to replace m with a fraudulent message.
Let $T$ be a binary search tree with 15 nodes. The minimum and maximum possible heights of $T$ are :
Note : The height of a tree with a single node is 0.
The $n$-bit fixed-point representation of an unsigned real number $X$ uses $f$ bits for the fraction part. Let $i=n-f$. The range of decimal values for $X$ in this representation is
Where $$A = \left[ {{a_1},.....,\,\,{a_n}} \right]$$ and $$b = \sum\limits_{i = 1}^n {{a_i}.} $$
The set of equations has
GATE CSE Papers
All year-wise previous year question papers