Question 1

Using modular arithmetic, 53 mod 11 is equal to:

Accepted Answer

A)  0. 
B)  4. 
C)  7. 
D)  another number. 
A)  0. 
B)  4. 
C)  7. 
D)  another number. B

Question 2

Let C be the code {110, 101, 011, 000}. 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 can 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 can 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. C

Question 3

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 message CAD?

Accepted Answer

A)  0001111 
B)  1101100 
C)  01001110 
D)  1110011 
A)  0001111 
B)  1101100 
C)  01001110 
D)  1110011 B

Question 4

What is the distance between received words 1001010 and 1010010?

Accepted Answer

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

Question 5

If a code is used to detect and correct single-digit errors, which of the following are true statements? I: Its weight should be at least 2.
II: The distance between any two code words should be at least 2.

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 6

What is the name of a cryptosystem that uses multiplication by a fixed value to shift each letter?

Accepted Answer

The answer of What is the name of a cryptosystem...

Question 7

Using modular arithmetic, determine (16·31) mod 41.

Accepted Answer

The answer of Using modular arithmetic, determine (16·31) mod 41....

Question 8

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

Accepted Answer

If a code has weight

Question 9

Use the Caesar cipher to decrypt the message DOO LV ZHOO.

Accepted Answer

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

Question 10

Given that BEST was used as the key word to encrypt with the Vigenère cipher, decrypt the message BTJBDSL.

Accepted Answer

A)  PATRIOT 
B)  POPCORN 
C)  AIRPORT 
D)  APRICOT 
A)  PATRIOT 
B)  POPCORN 
C)  AIRPORT 
D)  APRICOT

Question 11

Use the Caesar cipher to encrypt the message ROME BURNS.

Accepted Answer

A)  URPH EXUQV 
B)  OLJB YROKP 
C)  HORU VQUXE 
D)  another sequence 
A)  URPH EXUQV 
B)  OLJB YROKP 
C)  HORU VQUXE 
D)  another sequence

Question 12

What is the distance between two strings of equal length?

Accepted Answer

It is the number of

Question 13

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

Accepted Answer

A)  2. 
B)  3. 
C)  7. 
D)  another number. 
A)  2. 
B)  3. 
C)  7. 
D)  another number.

Question 14

What is the distance between received words 1100101 and 1101010?

Accepted Answer

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

Question 15

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

Accepted Answer

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

Question 16

JPEG encoding returns compressed data to its exact original form.

Accepted Answer

A) True 
 B)False

Question 17

Add the pair of binary sequences 1101001 and 1010011.

Accepted Answer

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

Question 18

Add the binary sequences 1001010 and 1010010. How many 1s digits are in the sum?

Accepted Answer

A)  2 
B)  3 
C)  4 
D)  another answer 
A)  2 
B)  3 
C)  4 
D)  another answer

Question 19

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

Accepted Answer

It detects

Question 20

Use the nearest-neighbor Venn diagram method to decode the received word 0100110.

Accepted Answer

A)  0110 
B)  0010 
C)  0100 
D)  0101 
A)  0110 
B)  0010 
C)  0100 
D)  0101

Exam 17: Information Science

Using modular arithmetic, 53 mod 11 is equal to:

Let C be the code {110, 101, 011, 000}. Which of the following is a true statement?

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 message CAD?

What is the distance between received words 1001010 and 1010010?

If a code is used to detect and correct single-digit errors, which of the following are true statements? I: Its weight should be at least 2. II: The distance between any two code words should be at least 2.

What is the name of a cryptosystem that uses multiplication by a fixed value to shift each letter?

Using modular arithmetic, determine (16·31) mod 41.

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

Use the Caesar cipher to decrypt the message DOO LV ZHOO.

Given that BEST was used as the key word to encrypt with the Vigenère cipher, decrypt the message BTJBDSL.

Use the Caesar cipher to encrypt the message ROME BURNS.

What is the distance between two strings of equal length?

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

What is the distance between received words 1100101 and 1101010?

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

JPEG encoding returns compressed data to its exact original form.

Add the pair of binary sequences 1101001 and 1010011.

Add the binary sequences 1001010 and 1010010. How many 1s digits are in the sum?

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

Use the nearest-neighbor Venn diagram method to decode the received word 0100110.

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, 5³ mod 11 is equal to:

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