info@avatto.com
+91-9920808017
56. Let L = {0n1n|n ≥ 0} be a context free language. Which of the following is correct ?
L' is context free and Lk is not context free for any k ≥ 1.
L' is not context free and Lk is not context free for any k ≥ 1.
Both L' and Lk is for any k ≥ 1 are context free
Both L' and Lk is for any k ≥ 1 are not context free
Your email address will not be published. Required fields are marked *
Report
Name
Email
Website
Save my name, email, and website in this browser for the next time I comment.
Comment
57. Given a Turing Machine M = ({q0, q1, q2, q3}, {a, b}, {a, b, B}, δ, B, {q3}) Where δ is a transition function defined as δ(q0, a) = (q1, a, R) δ(q1, b) = (q2, b, R) δ(q2, a) = (q2, a, R) δ(q3, b) = (q3, b, R) The language L(M) accepted by the Turing Machine is given as:
aa*b
aba*b
aba*
58. Consider a discrete memoryless channel and assume that H(x) is the amount of information per symbol at the input of the channel; H(y) is the amount of information per symbol at the output of the channel; H(x|y) is the amount of uncertainty remaining on x knowing y; and I (x; y) is the information transmission. Which of the following does not define the channel capacity of a discrete memoryless channel?
max I (x; y) p(x)
max [H(y) – H(y|x)] p(x)
max [H(x) – H(x|y)] p(x)
max H(x|y) p(x)
59. Consider a source with symbols A, B, C, D with probabilities 1/2, 1/4, 1/8, 1/8 respectively. What is the average number of bits per symbol for the Huffman code generated from above information ?
2 bits per symbol
1.75 bits per symbol
1.50 bits per symbol
1.25 bits per symbol
60. Which of the following is used for the boundary representation of an image object?
Quad Tree
Projections
Run length coding
Chain codes
Login with Facebook
Login with Google
Forgot your password?
Lost your password? Please enter your email address. You will receive mail with link to set new password.
Back to login