Question 1

Using modular arithmetic, (13·21) mod 12 is equal to:

Accepted Answer

A)  3. 
B)  9. 
C)  10. 
D)  another number. 
A)  3. 
B)  9. 
C)  10. 
D)  another number.

Question 2

When using the Venn diagram for determining length seven binary code words for length four messages, what is the minimum distance between two code words?

Accepted Answer

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

Question 3

Using modular arithmetic, 153 mod 41 is equal to:

Accepted Answer

A)  0. 
B)  13. 
C)  31. 
D)  another number. 
A)  0. 
B)  13. 
C)  31. 
D)  another number.

Question 4

What is the distance between received words 1101000 and 1100110?

Accepted Answer

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

Question 5

Using modular arithmetic, 25 mod 15 is equal to:

Accepted Answer

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

Question 6

Given that the following numbers were encoded using the delta function, which of the following is not an original number? 1130 -14 6 -4 12 -2 -22

Accepted Answer

A)  1106 
B)  1116 
C)  1124 
D)  1128 
A)  1106 
B)  1116 
C)  1124 
D)  1128

Question 7

Using modular arithmetic, determine (42·17) mod 23.

Accepted Answer

The answer of Using modular arithmetic, determine (42·17) mod 23....

Question 8

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

Accepted Answer

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

Question 9

When using the Venn diagram for determining length seven binary code words for length four messages, which of the following are true statements? 
I: Every code word has an even number of 1s. 
II: Every possible string of seven binary digits is a code word.
III: Every possible string of seven binary digits can be read as a code word or a code word with a single-digit error.

Accepted Answer

A)  I only 
B)  I and III only 
C)  II only 
D)  III only 
A)  I only 
B)  I and III only 
C)  II only 
D)  III only

Question 10

Use the Caesar cipher to encrypt the message ABANDON HOPE.

Accepted Answer

The answer of Use the Caesar cipher to encrypt the...

Question 11

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

Accepted Answer

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

Question 12

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

Accepted Answer

A)  1101011 
B)  1101001 
C)  1101000 
D)  1101110 
A)  1101011 
B)  1101001 
C)  1101000 
D)  1101110

Question 13

Suppose the Venn diagram message 1110 is received as 1110001. Will the original message be recovered?

Accepted Answer

A) True 
 B)False

Question 14

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

Accepted Answer

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

Question 15

Use the Caesar cipher to decrypt the message ZHVW.

Accepted Answer

A)  WEST 
B)  EAST 
C)  REST 
D)  another message 
A)  WEST 
B)  EAST 
C)  REST 
D)  another message

Question 16

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

Accepted Answer

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

Question 17

What is the name of the method that decodes a received message as the code word that agrees with the message in the most positions?

Accepted Answer

nearest-ne

Question 18

Add the pair of binary sequences 1001010 and 1010010.

Accepted Answer

The answer of Add the pair of binary sequences 1001010...

Question 19

Which of the following are true statements? 
I: Morse code is a variable-length code.
II: Morse code is an example of a data compression code.

Accepted Answer

A)  I only 
B)  II only 
C)  both I and II 
D)  neither I nor II 
A)  I only 
B)  II only 
C)  both I and II 
D)  neither I nor II

Question 20

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

Accepted Answer

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

Exam 17: Information Science

Using modular arithmetic, (13·21) mod 12 is equal to:

When using the Venn diagram for determining length seven binary code words for length four messages, what is the minimum distance between two code words?

Using modular arithmetic, 153 mod 41 is equal to:

What is the distance between received words 1101000 and 1100110?

Using modular arithmetic, 25 mod 15 is equal to:

Given that the following numbers were encoded using the delta function, which of the following is not an original number? 1130 -14 6 -4 12 -2 -22

Using modular arithmetic, determine (42·17) mod 23.

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

Use the Caesar cipher to encrypt the message ABANDON HOPE.

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

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

Suppose the Venn diagram message 1110 is received as 1110001. Will the original message be recovered?

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

Use the Caesar cipher to decrypt the message ZHVW.

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

What is the name of the method that decodes a received message as the code word that agrees with the message in the most positions?

Add the pair of binary sequences 1001010 and 1010010.

Which of the following are true statements? I: Morse code is a variable-length code. II: Morse code is an example of a data compression code.

Suppose aaa mod 7 is equal to 0. 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, 15³ mod 41 is equal to:

Using modular arithmetic, 2⁵ mod 15 is equal to:

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