Bissoy.com
Doctors Medicines MCQs Q&A

Related Questions

Consider a binary memoryless channel characterized by the transition probability diagram shown in the figure. The channel is
Information Theory and Coding mcq question image
Match List I with List II List I List II A. Selective coding I. To discover the most significant or frequent initial code that makes the most analytical sense B. Initial coding II. The procedure of selecting the core category, Systematically relating it to other categories, validating their relationships, and filling in categories that need further refinement and development C. Focused coding III. It specifies possible relationships between categories, these are integrative D. Theoretical coding IV. Comparing data with data, staying close to and remain open to exploring what is happening in data, construct and keep the code short, simple, precise and active. Choose the correct answer from the options given below:
Which of the following is/are correct about a strictly binary tree? A. A binary tree is called strictly binary tree if every non-­leaf node of it has non empty left and right sub tree B. In strictly binary tree can have two children or no child C. A strictly binary tree with n leaves always contact 2n­-1 nodes
what is the time complexity of Huffman Coding?
In Huffman coding, data in a tree always occur?
Huffman coding technique is adopted for constructing the source code with . . . . . . . . redundancy.
We create a binary search tree B1 by inserting the numbers 1, 2, 3, 4, 5 into an empty binary search tree. We create another binary search tree B2 by inserting the numbers into an empty binary search tree in the reverse order. What is the difference between the right-most element of B1 and the left-most element of B2?
A source produces binary data at the rate of 10 kbps. The binary symbols are represented as shown in the figure.
Digital Communication mcq question image
The source output is transmitted using two modulation schemes, namely Binary PSK (BPSK) and Quadrature PSK (QPSK). Let and B2 be the bandwidth requirements of BPSK and QPSK respectively. Assuming that the bandwidth of the above rectangular pulses is 10 kHz, B1 and B2 are
Consider a full binary tree with n internal nodes, internal path length i, and external path length e. The internal path length of a full binary tree is the sum, taken over all nodes of the tree, of the depth of each node. Similarly, the external path length is the sum, taken over all leaves of the tree, of the depth of each leaf. Which of the following is correct for the full binary tree?
Which of the following statements is/are true: Let * be a binary operation on a non-empty set A such that a * b = a - b - ab If A = Z then * is a binary operation on Z. If A = N then * is a binary operation on N.