- Choose the most appropriate answer for each question.
- Question 1 :
Imagine a full binary tree in which the probability of getting from any parent node to one of its child nodes is 50%. _________ labels of '0' and '1' to the paths to the child nodes of each parent node. Then the probability of getting from the root to a leaf node is a negative power of 2, and the length of the path (from the root to that leaf node) is the negated base-2 logarithm of that probability. Now imagine a random bit stream in which each bit has an equal chance of being either 0 or 1. Think of the full binary tree as describing a Huffman encoding for a script whose characters are located at the leaf nodes of the said full binary tree. Each character decodes a string of bits whose length is the length of the path from the root node to the leaf node corresponding to that character. Now use "Huffman decoding" to convert the bit stream to a character stream (of the given script). The average compression ratio between the bit stream and the character stream can be seen to be equal to the information entropy of the character stream.
Another problem __________ with this nomenclature is that it did not take into account differences in virulence of identical isolates; a non-pathogenic isolate having an identical genetic sequence as a virulent one but differing only with two amino acids [16 ] would accordingly be excluded from list of IPNV. The purpose of the present study was to compare the mechanisms of cytopathogenesis between genetically and serologically identical and more distant isolates of aquabirnaviruses.