Given the following two statements :
S1: If L1 and L2 are recursively enumerable languages over Σ, then L1 ⋃ L2 and L1 ⌒ L2 are also recursively enumerable.
S2: The set of recursively enumerable languages is countable.
Which of the following is correct?
| A. | S1 is correct and S2 is not correct |
| B. | S1 is not correct and S2 is correct |
| C. | Both S1 and S2 are not correct |
| D. | Both S1 and S2 are correct |
|
Option: D Explanation : Click on Discuss to view users comments. |
Given the symbols A, B, C, D, E, F, G and H with the probabilities 
. The average Huffman code size in bits per symbol is:
| A. |
|
| B. |
|
| C. |
|
| D. |
|
|
Option: C Explanation : Click on Discuss to view users comments. |
The redundancy in images stems from :
| A. | pixel decorrelation |
| B. | pixel correlation |
| C. | pixel quantization |
| D. | image size |
|
Option: B Explanation : Click on Discuss to view users comments. |
In a binary Hamming Code the number of check digits is r then number of message digits is equal to :
| A. | 2r – 1 |
| B. | 2r – r – 1 |
| C. | 2r – r + 1 |
| D. | 2r + r – 1 |
|
Option: B Explanation : Click on Discuss to view users comments. |
In the Hungarian method for solving assignment problem, an optimal assignment requires that the maximum number of lines that can be drawn through squares with zero opportunity cost be equal to the number of :
| A. | rows or columns |
| B. | rows + columns |
| C. | rows + columns – 1 |
| D. | rows + columns + 1 |
|
Option: A Explanation : Click on Discuss to view users comments. |
