Question 1

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

Accepted Answer

The answer of Use the nearest-neighbor Venn diagram method to...

Question 2

Given that the following numbers were encoded using the delta function, which of the following is not an original number? 20437 547 -927 211 62 503 -826

Accepted Answer

A)  20007 
B)  20267 
C)  20330 
D)  20984 
A)  20007 
B)  20267 
C)  20330 
D)  20984

Question 3

Use the Vigenère cipher with the key word DRUID to encrypt the message INCOMING GIANT.

Accepted Answer

A)  MFXXQMFB PMEFO 
B)  ZHKRPZHO JLRHB 
C)  LEWWPLEA OLDEN 
D)  HNTRLIEJ FIRQS 
A)  MFXXQMFB PMEFO 
B)  ZHKRPZHO JLRHB 
C)  LEWWPLEA OLDEN 
D)  HNTRLIEJ FIRQS

Question 4

Give an example of a circumstance where the code C = {00000, 11111} could be of use.

Accepted Answer

It detects and corre

Question 5

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

Accepted Answer

A) True 
 B)False

Question 6

Let C be the code {1010, 0101, 1111, 0000}. What is the weight of this code?

Accepted Answer

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

Question 7

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

Accepted Answer

A)  1011 
B)  1010 
C)  1001 
D)  0010 
A)  1011 
B)  1010 
C)  1001 
D)  0010

Question 8

Add the binary sequences 0100110 and 1101010. How many 1s digits are in the sum?

Accepted Answer

A)  1 
B)  3 
C)  5 
D)  another answer 
A)  1 
B)  3 
C)  5 
D)  another answer

Question 9

Append a fourth check digit to each seven-digit code created by the Venn diagram method c4 = a1 + a2 + a3 + a4. With this additional check digit, can double errors be detected and corrected?

Accepted Answer

A) True 
 B)False

Question 10

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

Accepted Answer

A) True 
 B)False

Question 11

When using the Venn diagram for determining length seven binary code words for length four messages, what is the weight of the code?

Accepted Answer

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

Question 12

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

Accepted Answer

A)  1001 
B)  0100 
C)  1101 
D)  1011 
A)  1001 
B)  0100 
C)  1101 
D)  1011

Question 13

You propose a code in which each three-digit binary message word a1 a2 a3 has appended a parity-check digit c1 = a1 + 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 14

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

Accepted Answer

A)  1001111 
B)  1001101 
C)  1001001 
D)  1001010 
A)  1001111 
B)  1001101 
C)  1001001 
D)  1001010

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

Given that the following numbers were encoded using the delta function, which of the following is not an original number? 20437 547 -927 211 62 503 -826

Use the Vigenère cipher with the key word DRUID to encrypt the message INCOMING GIANT.

Give an example of a circumstance where the code C = {00000, 11111} could be of use.

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

Let C be the code {1010, 0101, 1111, 0000}. What is the weight of this code?

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

Add the binary sequences 0100110 and 1101010. How many 1s digits are in the sum?

Append a fourth check digit to each seven-digit code created by the Venn diagram method c₄= a₁ + a₂ + a₃ + a₄. With this additional check digit, can double errors be detected and corrected?

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

When using the Venn diagram for determining length seven binary code words for length four messages, what is the weight of the code?

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

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

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

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

Exam 17: Information Science

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

Given that the following numbers were encoded using the delta function, which of the following is not an original number? 20437 547 -927 211 62 503 -826

Use the Vigenère cipher with the key word DRUID to encrypt the message INCOMING GIANT.

Give an example of a circumstance where the code C = {00000, 11111} could be of use.

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

Let C be the code {1010, 0101, 1111, 0000}. What is the weight of this code?

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

Add the binary sequences 0100110 and 1101010. How many 1s digits are in the sum?

Append a fourth check digit to each seven-digit code created by the Venn diagram method c4 = a1 + a2 + a3 + a4. With this additional check digit, can double errors be detected and corrected?

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

When using the Venn diagram for determining length seven binary code words for length four messages, what is the weight of the code?

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

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

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

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

Append a fourth check digit to each seven-digit code created by the Venn diagram method c₄= a₁ + a₂ + a₃ + a₄. With this additional check digit, can double errors be detected and corrected?

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

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