IT - Practice part

Descripción

Information Theory Test sobre IT - Practice part, creado por Csse 1502 el 14/05/2018.
Csse 1502
Test por Csse 1502, actualizado hace más de 1 año
Csse 1502
Creado por Csse 1502 hace más de 6 años
1728
2

Resumen del Recurso

Pregunta 1

Pregunta
A card is drawn from a pack of 52 cards. The probability of getting a king of heart is
Respuesta
  • 1/26
  • 1/52
  • 1/13
  • 2/13

Pregunta 2

Pregunta
A card is drawn from a pack of 52 cards. The probability of getting a queen or a king of heart is
Respuesta
  • 1/52
  • 1/26
  • 1/13
  • 2/13

Pregunta 3

Pregunta
A code has two allowable combinations 101 and 010. What is the allowable combination for the error combination 001?
Respuesta
  • 101
  • 010
  • 001
  • None

Pregunta 4

Pregunta
A code has two allowable combinations 101 and 010. What is the allowable combination for the error combinat
Respuesta
  • 101
  • 01
  • 100
  • None

Pregunta 5

Pregunta
A code has two allowable combinations 101 and 010. What is the allowable combination for the error combination 000?
Respuesta
  • 010
  • 101
  • 000
  • None

Pregunta 6

Pregunta
51. Code has dmin = 9. How many errors can be corrected by this code?
Respuesta
  • 5
  • 7
  • 4
  • 8

Pregunta 7

Pregunta
A code has two allowable combinations 101 and 010. What is the allowable combination for the error combination 111?
Respuesta
  • 101
  • 010
  • 111
  • None

Pregunta 8

Pregunta
52. Code has dmin = 9. How many errors can be detected by this code?
Respuesta
  • 7
  • 9
  • 8
  • 4

Pregunta 9

Pregunta
57. Determine the Hamming distance for code that can detect 3 errors and correct 2 errors.
Respuesta
  • 6
  • 5
  • 7
  • 9

Pregunta 10

Pregunta
A code has two allowable combinations 101 and 010. What is the allowable combination for the error combination 011?
Respuesta
  • 010
  • 101
  • 011
  • None

Pregunta 11

Pregunta
58. Determine the Hamming distance for code that can detect 3 errors and correct 1 errors.
Respuesta
  • 5
  • 4
  • 6
  • 8

Pregunta 12

Pregunta
A code has two allowable combinations 101 and 010. What is the allowable combination for the error combination 110?
Respuesta
  • 010
  • 101
  • 110
  • None

Pregunta 13

Pregunta
59. Determine the Hamming distance for code that can detect 5 errors and correct 3 errors.
Respuesta
  • 9
  • 8
  • 10
  • 14

Pregunta 14

Pregunta
A fair coin is tossed four times, the probability of getting four heads is
Respuesta
  • 1/4
  • 1/16
  • 1
  • 1/2

Pregunta 15

Pregunta
A Huffman code is a = 1, b = 000, c = 001, d = 01. Probabilities are p(a) = 0.4, p(b) = 0.1, p(c) = 0.2, p(d) = 0.3. The average length of codewords q is
Respuesta
  • 2.1 bit
  • 1.9 bit
  • 2.0 bit
  • 8.0 bit

Pregunta 16

Pregunta
60. Encode a string "0000" with Hamming (7,4) code using the following structure (i1, i2, i3, i4, r1, r2, r3)
Respuesta
  • 0000001
  • 0000111
  • 0000000
  • 0000101

Pregunta 17

Pregunta
An alphabet consist of the letters a, b, c and d. The probability of occurrence is \n p(a) = 0.4, p(b) = 0.1, p(c) = 0.2 and p(d) = 0.3. The Huffman code is
Respuesta
  • a=0,b=111,c=11,d=101
  • a=0,b=110,c=111,d=10
  • a=0,b=11,c=10,d=111
  • a=01,b=111,c=110,d=10

Pregunta 18

Pregunta
61. Encode a string "0001" with Hamming (7,4) code using the following structure (i1, i2, i3, i4, r1, r2, r3)
Respuesta
  • 0001010
  • 0001001
  • 0001011
  • 0001111

Pregunta 19

Pregunta
Bag contain 10 black and 20 white balls, One ball is drawn at random. What is the probability that ball is white
Respuesta
  • 1
  • 2/3
  • 1/3
  • 4/3

Pregunta 20

Pregunta
62. Encode a string "0010" with Hamming (7,4) code using the following structure (i1, i2, i3, i4, r1, r2, r3)
Respuesta
  • 0010010
  • 0010111
  • 0010110
  • 0010100

Pregunta 21

Pregunta
Calculate the code rate for Hamming (15,11) code
Respuesta
  • 1
  • 0,73
  • 0,571
  • 0,839

Pregunta 22

Pregunta
63. Encode a string "0011" with Hamming (7,4) code using the following structure (i1, i2, i3, i4, r1, r2, r3)
Respuesta
  • 0011100
  • 0011001
  • 0011101
  • 0011111

Pregunta 23

Pregunta
64. Encode a string "0100" with Hamming (7,4) code using the following structure (i1, i2, i3, i4, r1, r2, r3)
Respuesta
  • 0100011
  • 0100110
  • 0100111
  • 0100101

Pregunta 24

Pregunta
Calculate the code rate for Hamming (31,26) code
Respuesta
  • 1
  • 0,839
  • 0,733
  • 0,571

Pregunta 25

Pregunta
65. Encode a string "0101" with Hamming (7,4) code using the following structure (i1, i2, i3, i4, r1, r2, r3)
Respuesta
  • 0101101
  • 0101000
  • 0101100
  • 0101110

Pregunta 26

Pregunta
Calculate the code rate for Hamming (7,4) code
Respuesta
  • 1
  • 0,571
  • 0,733
  • 0,839

Pregunta 27

Pregunta
Calculate the efficiency of the language if it has 32 letters and its I average is 1 bit.
Respuesta
  • 0,8
  • 0,2
  • 5
  • 1

Pregunta 28

Pregunta
66. Encode a string "0110" with Hamming (7,4) code using the following structure (i1, i2, i3, i4, r1, r2, r3)
Respuesta
  • 0110101
  • 0110011
  • 0110001
  • 0110000

Pregunta 29

Pregunta
Calculate the redundancy of the language if it has 32 letters and its I average is 1 bit.
Respuesta
  • 0,8
  • 0,2
  • 5
  • 1

Pregunta 30

Pregunta
Code has dmin = 1. How many errors can be corrected by this code?
Respuesta
  • 2
  • 3
  • 0
  • 1

Pregunta 31

Pregunta
67. Encode a string "0111" with Hamming (7,4) code using the following structure (i1, i2, i3, i4, r1, r2, r3)
Respuesta
  • 0111110
  • 0111000
  • 0111010
  • 0111011

Pregunta 32

Pregunta
Code has dmin = 1. How many errors can be detected by this code?
Respuesta
  • 2
  • 3
  • 0
  • 1

Pregunta 33

Pregunta
68. Encode a string "1000" with Hamming (7,4) code using the following structure (i1, i2, i3, i4, r1, r2, r3)
Respuesta
  • 1000111
  • 1000100
  • 1000101
  • 1000001

Pregunta 34

Pregunta
Code has dmin = 10. How many errors can be detected by this code?
Respuesta
  • 4
  • 8
  • 9
  • 10

Pregunta 35

Pregunta
Code has dmin = 11. How many errors can be corrected by this code?
Respuesta
  • 11
  • 7
  • 5
  • 10

Pregunta 36

Pregunta
69. Encode a string "1001" with Hamming (7,4) code using the following structure (i1, i2, i3, i4, r1, r2, r3)
Respuesta
  • 1001111
  • 1001010
  • 1001110
  • 1001100

Pregunta 37

Pregunta
70. Encode a string "1010" with Hamming (7,4) code using the following structure (i1, i2, i3, i4, r1, r2, r3)
Respuesta
  • 1010111
  • 1010001
  • 1010011
  • 1010010

Pregunta 38

Pregunta
71. Encode a string "1011" with Hamming (7,4) code using the following structure (i1, i2, i3, i4, r1, r2, r3)
Respuesta
  • 1011100
  • 1011010
  • 1011000
  • 1011001

Pregunta 39

Pregunta
72. Encode a string "1100" with Hamming (7,4) code using the following structure (i1, i2, i3, i4, r1, r2, r3)
Respuesta
  • 1100110
  • 1100000
  • 1100010
  • 1100011

Pregunta 40

Pregunta
73. Encode a string "1101" with Hamming (7,4) code using the following structure (i1, i2, i3, i4, r1, r2, r3)
Respuesta
  • 1101101
  • 1101011
  • 1101001
  • 1101000

Pregunta 41

Pregunta
74. Encode a string "1110" with Hamming (7,4) code using the following structure (i1, i2, i3, i4, r1, r2, r3)
Respuesta
  • 1110000
  • 1110101
  • 1110100
  • 1110110

Pregunta 42

Pregunta
75. Encode a string "1111" with Hamming (7,4) code using the following structure (i1, i2, i3, i4, r1, r2, r3)
Respuesta
  • 1111110
  • 1111011
  • 1111111
  • 1111101

Pregunta 43

Pregunta
76. Find the information amount of a symbol from the language with total number of symbols n = 18.
Respuesta
  • I = log218
  • I = log182
  • I = 18 * log218
  • I = 18 * log182

Pregunta 44

Pregunta
83. If a card is chosen from a pack of 52 cards, what is the probability of getting a five or a seven?
Respuesta
  • 4/52
  • 8/52
  • 1/26
  • 1/169

Pregunta 45

Pregunta
84. In a box, there are 8 red, 7 blue and 6 green balls. One ball is picked up randomly. What is the probability that it is neither blue nor green?
Respuesta
  • 2/3
  • 8/21
  • 3/7
  • 9/22

Pregunta 46

Pregunta
87. In a throw of dice what is the probability of getting number greater than 5.
Respuesta
  • 1/3
  • 1/6
  • 1/5
  • 1

Pregunta 47

Pregunta
96. Specify the error position in the string "0000110", if the initial string was encoded with Hamming (7,4) code using the following structure (i1, i2, i3, i4, r1, r2, r3)
Respuesta
  • i1
  • i2
  • i3
  • i4

Pregunta 48

Pregunta
97. Specify the error position in the string "0001110", if the initial string was encoded with Hamming (7,4) code using the following structure (i1, i2, i3, i4, r1, r2, r3)
Respuesta
  • i4
  • i1
  • i2
  • r2

Pregunta 49

Pregunta
98. Specify the error position in the string "0011001", if the initial string was encoded with Hamming (7,4) code using the following structure (i1, i2, i3, i4, r1, r2, r3)
Respuesta
  • r2
  • r1
  • r3
  • i3

Pregunta 50

Pregunta
99. Specify the error position in the string "0101011", if the initial string was encoded with Hamming (7,4) code using the following structure (i1, i2, i3, i4, r1, r2, r3)
Respuesta
  • i1
  • i2
  • i3
  • i4

Pregunta 51

Pregunta
100. Specify the error position in the string "0101110", if the initial string was encoded with Hamming (7,4) code using the following structure (i1, i2, i3, i4, r1,
Respuesta
  • r3
  • r2
  • r1
  • no error
Mostrar resumen completo Ocultar resumen completo

Similar

Resumen sobre Los Reyes Católicos
maya velasquez
Test de Matemáticas para el GMAT (en Inglés)
Diego Santos
¿Qué sabes de Roma antígua? - EDUpunto.com
EDUpunto Por: Ernesto De Frías
Sistema Endocrino
Grupo de Ciencia
Historia del Arte Universal
maya velasquez
Anatomia Aparato Reproductor Femenino
Luz MoOr
Periféricos de Entrada
karol Olague
Mapa mental inteligencia emocional
Alexandra A
Simple present tense (Tiempo presente simple)
Luis Venegas
Palabras primitivas y derivadas
abraham marquez robles