Question 1

Let C be the code {101010, 010101, 111111, 000000}. What is the weight of this code?

Accepted Answer

A)  0 
B)  1 
C)  3 
D)  6 
A)  0 
B)  1 
C)  3 
D)  6

Question 2

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 A?

Accepted Answer

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

Question 3

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

Accepted Answer

For example, {111111

Question 4

Let C be the code {1100, 1010, 1001, 0110, 0101, 0011}. 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 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 cannot correct any single-digit error. 
D)  The code can detect some but not all single-digit errors.

Question 5

Given that the following numbers were encoded using the delta function, which of the following is not an original number? 89 0 9  - 6 - 6 -16  10

Accepted Answer

A)  82 
B)  88 
C)  92 
D)  98 
A)  82 
B)  88 
C)  92 
D)  98

Question 6

If the weight of a code is 8, how many errors can be corrected?

Accepted Answer

The answer of If the weight of a code is...

Question 7

GIF encoding returns compressed data to its exact original form.

Accepted Answer

A) True 
 B)False

Question 8

Use the Vigenère cipher with the key word HANK to encrypt the message HOME RUN.

Accepted Answer

A)  OOZO YUA 
B)  OOZL RHU 
C)  HZMR RFN 
D)  PPAP ZVB 
A)  OOZO YUA 
B)  OOZL RHU 
C)  HZMR RFN 
D)  PPAP ZVB

Question 9

Using modular arithmetic, determine 177 mod 41.

Accepted Answer

Question 10

Determine the value of s so that 9s = 1 mod 17.

Accepted Answer

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

Question 11

If the weight of a code is 5, how many errors can be corrected?

Accepted Answer

The answer of If the weight of a code is...

Question 12

Use the Caesar cipher to encrypt the message PICNIC.

Accepted Answer

A)  TMGRMG 
B)  SLFQLF 
C)  IBVGBV 
D)  RKEPKE 
A)  TMGRMG 
B)  SLFQLF 
C)  IBVGBV 
D)  RKEPKE

Question 13

What is the minimum number of 1s that occur among all nonzero code words of that code called?

Accepted Answer

the weight

Question 14

Construct a code for five-digit binary message words that has three parity-check digits. Can it detect and correct single-digit errors?

Accepted Answer

For example, c₁ = a₁ + a₂ + a₃; c₂

Question 15

You propose a code in which each digit of the message word is repeated to form the code word. For example, 101 is coded as 110011. Which of the following is a true statement?

Accepted Answer

A)  The code can detect and correct any single-digit error and any double error. 
B)  The code can detect and correct any single-digit error and detect any double error, but cannot correct every double error. 
C)  The code can detect and correct any single-digit error, but it cannot detect every double error. 
D)  The code can detect any single-digit error, but it cannot correct every single-digit error. 
A)  The code can detect and correct any single-digit error and any double error. 
B)  The code can detect and correct any single-digit error and detect any double error, but cannot correct every double error. 
C)  The code can detect and correct any single-digit error, but it cannot detect every double error. 
D)  The code can detect any single-digit error, but it cannot correct every single-digit error.

Question 16

If two binary sequences that each have an even number of 1s are added, the sum:

Accepted Answer

A)  will always have an even number of 1s. 
B)  will sometimes have an even number of 1s. 
C)  will always have an odd number of 1s. 
A)  will always have an even number of 1s. 
B)  will sometimes have an even number of 1s. 
C)  will always have an odd number of 1s.

Question 17

For the message word a1 a2 a3 a4, append four check digits c1 = a1, c2 = a2, c3 = a3 and c4 = a4. Will the resulting code detect and correct all single-digit errors? Can double errors be detected and corrected?

Accepted Answer

It detects all singl

Question 18

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

Accepted Answer

A)  010011010 
B)  01011010 
C)  01001101 
D)  another sequence 
A)  010011010 
B)  01011010 
C)  01001101 
D)  another sequence

Question 19

Using modular arithmetic, 43 mod 10 is equal to:

Accepted Answer

A)  2. 
B)  4. 
C)  6. 
D)  another number. 
A)  2. 
B)  4. 
C)  6. 
D)  another number.

Question 20

Suppose $a$ mod 7 is equal to 2. Find $a ^ { 3 }$ mod 7.

Accepted Answer

The answer of Suppose $a$ mod 7 is equal to...

Exam 17: Information Science

Let C be the code {101010, 010101, 111111, 000000}. What is the weight of this code?

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 A?

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

Let C be the code {1100, 1010, 1001, 0110, 0101, 0011}. Which of the following is a true statement?

Given that the following numbers were encoded using the delta function, which of the following is not an original number? 89 0 9 - 6 - 6 -16 10

If the weight of a code is 8, how many errors can be corrected?

GIF encoding returns compressed data to its exact original form.

Use the Vigenère cipher with the key word HANK to encrypt the message HOME RUN.

Using modular arithmetic, determine 177 mod 41.

Determine the value of s so that 9s = 1 mod 17.

If the weight of a code is 5, how many errors can be corrected?

Use the Caesar cipher to encrypt the message PICNIC.

What is the minimum number of 1s that occur among all nonzero code words of that code called?

Construct a code for five-digit binary message words that has three parity-check digits. Can it detect and correct single-digit errors?

You propose a code in which each digit of the message word is repeated to form the code word. For example, 101 is coded as 110011. Which of the following is a true statement?

If two binary sequences that each have an even number of 1s are added, the sum:

For the message word a1 a2 a3 a4, append four check digits c1 = a1, c2 = a2, c3 = a3 and c4 = a4. Will the resulting code detect and correct all single-digit errors? Can double errors be detected and corrected?

Use the encoding scheme A  0, B  10, C  11 to encode the sequence ABACAB.

Using modular arithmetic, 43 mod 10 is equal to:

Suppose aaa mod 7 is equal to 2. Find a3a ^ { 3 }a3 mod 7.

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

Using modular arithmetic, determine 17⁷ mod 41.

For the message word a₁ a₂ a₃ a₄, append four check digits c₁= a₁, c_{2 =}a₂, c₃= a₃ and c₄= a₄. Will the resulting code detect and correct all single-digit errors? Can double errors be detected and corrected?

Using modular arithmetic, 4³ mod 10 is equal to:

Suppose $a$ mod 7 is equal to 2. Find $a ^ { 3 }$ mod 7.