Question 1

For the code C = {000000,111111}, how many errors would have to occur during transmission for a received word to be encoded incorrectly?

Accepted Answer

A)  2 
B)  3 
C)  4 
D)  5 
A)  2 
B)  3 
C)  4 
D)  5

Question 2

For the code C = {00000,11111}, how many errors would have to occur during transmission for a received word to be encoded incorrectly?

Accepted Answer

A)  2 
B)  3 
C)  4 
D)  5 
A)  2 
B)  3 
C)  4 
D)  5

Question 3

Use the Venn diagram method to determine the code word of the message 1010.

Accepted Answer

A)  1010110 
B)  1010111 
C)  1010001 
D)  1010011 
A)  1010110 
B)  1010111 
C)  1010001 
D)  1010011

Question 4

Determine the value of s so that 11s = 1 mod 13.

Accepted Answer

The answer of Determine the value of s so that...

Question 5

Use the Venn diagram method to determine the code word of the message 0111.

Accepted Answer

A)  0111011 
B)  0111001 
C)  0111010 
D)  0111110 
A)  0111011 
B)  0111001 
C)  0111010 
D)  0111110

Question 6

Create a binary linear code with eight possible code words that can detect and correct any single-digit error.

Accepted Answer

For example, {111000000, 00011

Question 7

Use the Vigenère cipher with the key word SPRING to encrypt the message APRIL SHOWERS.

Accepted Answer

The answer of Use the Vigenère cipher with the key...

Question 8

Given that the following numbers were encoded using the delta function, which of the following is not an original number? 95 -11 8 -8 -3 9 2

Accepted Answer

A)  81 
B)  84 
C)  90 
D)  93 
A)  81 
B)  84 
C)  90 
D)  93

Question 9

You propose a code in which each three-digit binary message word a1 a2 a3 has appended two parity-check digits c1 = a1 + a2 and c2 = a2 + a3. Which of the following is a true statement?

Accepted Answer

A)  The code can detect and correct any single-digit error. 
B)  The code can detect any single-digit error and correct some but not all single-digit errors. 
C)  The code can detect any single-digit error, but it cannot correct any single-digit error. 
D)  The code can detect some but not all single-digit errors. 
A)  The code can detect and correct any single-digit error. 
B)  The code can detect any single-digit error and correct some but not all single-digit errors. 
C)  The code can detect any single-digit error, but it cannot correct any single-digit error. 
D)  The code can detect some but not all single-digit errors.

Question 10

How does the weight of a code compare with the number of errors that can be corrected?

Accepted Answer

If a code has weight t, then i

Question 11

Suppose you create a binary code by appending to each message word a1 a2 a3 a4 three parity-check digits c1 = a1 + a2 + a4, c2 = a2 + a3 + a4, and c3 = a2 + a3 + a4. Will the resulting code detect and correct all single-digit errors?

Accepted Answer

It detects

Question 12

Using modular arithmetic, determine 127 mod 53.

Accepted Answer

Question 13

Answer the Questions using the following frequency list for a set of five different symbols. $$\begin{array} { | c | c | } 
\hline \text { Symbol } & \text { Frequency } \
\hline A & 20 \
\hline B & 35 \
\hline C & 40 \
\hline D & 25 \
\hline E & 10 \
\hline
\end{array}$$
-What is the Huffman code for the symbol C?

Accepted Answer

A)  010 
B)  011 
C)  10 
D)  11 
A)  010 
B)  011 
C)  10 
D)  11

Question 14

Given that TROUT was used as the key word to encrypt ZFBY YBJVCGZ with the Vigenère cipher, decrypt the message.

Accepted Answer

The answer of Given that TROUT was used as the...

Question 15

You propose a code in which each two-digit binary message word a1 a2 has appended a parity-check digit c1 = a1 + a2. Which of the following is a true statement?

Accepted Answer

A)  The code can detect and correct any single-digit error. 
B)  The code can detect any single-digit error and correct some but not all single-digit errors. 
C)  The code can detect any single-digit error, but it cannot correct any single-digit error. 
D)  The code can detect some but not all single-digit errors. 
A)  The code can detect and correct any single-digit error. 
B)  The code can detect any single-digit error and correct some but not all single-digit errors. 
C)  The code can detect any single-digit error, but it cannot correct any single-digit error. 
D)  The code can detect some but not all single-digit errors.

Question 16

Using modular arithmetic, 133 mod 34 is equal to:

Accepted Answer

A)  13. 
B)  21. 
C)  30. 
D)  another number. 
A)  13. 
B)  21. 
C)  30. 
D)  another number.

Question 17

Use the encoding scheme A F1F1F1S1F1F1F10 0, B F1F1F1S1F1F1F10 10, C F1F1F1S1F1F1F10 11 to decode the sequence 0101101011.

Accepted Answer

A)  ABCABC 
B)  ABACABAC 
C)  ABCBCB 
D)  another sequence 
A)  ABCABC 
B)  ABACABAC 
C)  ABCBCB 
D)  another sequence

Question 18

Using modular arithmetic, 177 mod 17 is equal to:

Accepted Answer

A)  0. 
B)  1. 
C)  2. 
D)  another number. 
A)  0. 
B)  1. 
C)  2. 
D)  another number.

Question 19

Given that PLEASE was used as the key word to encrypt QCMNY JDZH with the Vigenère cipher, decrypt the message.

Accepted Answer

A)  BRING CASH 
B)  BRING FOOD 
C)  BRING FISH 
D)  BRING MORE 
A)  BRING CASH 
B)  BRING FOOD 
C)  BRING FISH 
D)  BRING MORE

Question 20

What is the distance between received words 0111011 and 0101001?

Accepted Answer

A)  1 
B)  2 
C)  3 
D)  4 
A)  1 
B)  2 
C)  3 
D)  4

Exam 17: Information Science

For the code C = {000000,111111}, how many errors would have to occur during transmission for a received word to be encoded incorrectly?

For the code C = {00000,11111}, how many errors would have to occur during transmission for a received word to be encoded incorrectly?

Use the Venn diagram method to determine the code word of the message 1010.

Determine the value of s so that 11s = 1 mod 13.

Use the Venn diagram method to determine the code word of the message 0111.

Create a binary linear code with eight possible code words that can detect and correct any single-digit error.

Use the Vigenère cipher with the key word SPRING to encrypt the message APRIL SHOWERS.

Given that the following numbers were encoded using the delta function, which of the following is not an original number? 95 -11 8 -8 -3 9 2

You propose a code in which each three-digit binary message word a1 a2 a3 has appended two parity-check digits c1 = a1 + a2 and c2 = a2 + a3. Which of the following is a true statement?

How does the weight of a code compare with the number of errors that can be corrected?

Suppose you create a binary code by appending to each message word a1 a2 a3 a4 three parity-check digits c1 = a1 + a2 + a4, c2 = a2 + a3 + a4, and c3 = a2 + a3 + a4. Will the resulting code detect and correct all single-digit errors?

Using modular arithmetic, determine 127 mod 53.

Answer the Questions using the following frequency list for a set of five different symbols. Symbol Frequency A 20 B 35 C 40 D 25 E 10 -What is the Huffman code for the symbol C?

Given that TROUT was used as the key word to encrypt ZFBY YBJVCGZ with the Vigenère cipher, decrypt the message.

You propose a code in which each two-digit binary message word a1 a2 has appended a parity-check digit c1 = a1 + a2. Which of the following is a true statement?

Using modular arithmetic, 133 mod 34 is equal to:

Use the encoding scheme A  0, B  10, C  11 to decode the sequence 0101101011.

Using modular arithmetic, 177 mod 17 is equal to:

Given that PLEASE was used as the key word to encrypt QCMNY JDZH with the Vigenère cipher, decrypt the message.

What is the distance between received words 0111011 and 0101001?

Urban Services

Business Efficiency

Planning and Scheduling

Linear Programming

Exploring Data: Distributions

Exploring Data: Relationships

Data for Decisions

Probability: the Mathematics of Chance

Social Choice: the Impossible Dream

The Manipulability of Voting Systems

Weighted Voting Systems

Electing the President

Fair Division

Apportionment

Game Theory: the Mathematics of Competition

Identification Numbers

Growth and Form

Symmetry and Patterns

Tilings

Savings Models

Borrowing Models

The Economics of Resources

Filters

You propose a code in which each three-digit binary message word a₁ a₂ a₃ has appended two parity-check digits c₁ = a₁ + a₂ and c₂ = a₂ + a₃. Which of the following is a true statement?

Suppose you create a binary code by appending to each message word a₁ a₂ a₃ a₄three parity-check digits c₁= a₁ + a₂+ a₄, c₂= a₂ + a₃ + a₄, and c₃= a₂+a₃ + a₄. Will the resulting code detect and correct all single-digit errors?

Using modular arithmetic, determine 12⁷ mod 53.

You propose a code in which each two-digit binary message word a₁ a₂ has appended a parity-check digit c₁ = a₁ + a₂. Which of the following is a true statement?

Using modular arithmetic, 13³ mod 34 is equal to:

Using modular arithmetic, 17⁷ mod 17 is equal to: