1.	Use the Venn diagram method to determine the code word of the message 1010.	
	A)  1010110    B)  1010111    C)  1010001    D)  1010011	

2.	Use the Venn diagram method to determine the code word of the message 1001.	
	A)  1001111    B)  1001101    C)  1001001    D)  1001010	

3.	Use the nearest-neighbor Venn diagram method to decode the received word 1101101.	
	A)  1001    B)  0100    C)  1101    D)  1011	

4.	Use the nearest-neighbor Venn diagram method to decode the received word 1011001.	
	A)  1011    B)  1010    C)  1001    D)  0010	

5.	Suppose the Venn diagram message 1110 is received as 1110001.  Will the original message be recovered?	
	A)  Yes    B)  No	

6.	Suppose the Venn diagram coded message 1110 is received as 1110110.  Will the original message be recovered?	
	A)  Yes    B)  No	

7.	What is the distance between received words 1100101 and 1101010?	
	A)  1    B)  2    C)  3    D)  4	

8.	What is the distance between received words 1001010 and 1010010?	
	A)  1    B)  2    C)  3    D)  4	

9.	Add the binary sequences 1001010 and 1010010.  How many 1s digits are in the sum?	
	A)  2    B)  3    C)  4    D)  Another answer	

10.	Add the binary sequences 0100110 and 1101010.  How many 1s digits are in the sum?	
	A)  1    B)  3    C)  5    D)  Another answer	

11.	If two binary sequences that each have an even number of 1s are added, the sum	
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.	

12.	Let C be the code {1100, 1010, 1001, 0110, 0101, 0011}.  Which of the following is a true statement?	
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.	

13.	Let C be the code {110, 101, 011, 000}.  Which of the following is a true statement?	
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.	

14.	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?	
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 cannot detect every double error.	
D)	The code can detect any single-digit error, but cannot correct every single-digit error.	

15.	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?	
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.	

16.	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?	
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.	

17.	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?	
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.	

18.	For the code C = {00000,11111} how many errors would have to occur during transmission for a received word to be encoded incorrectly?	
	A)  2    B)  3    C)  4    D)  5	

19.	For the code C = {000000,111111} how many errors would have to occur during transmission for a received word to be encoded incorrectly?	
	A)  2    B)  3    C)  4    D)  5	

20.	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?	
	A)  1    B)  2    C)  3    D)  6	

21.	Let C be the code {1010, 0101, 1111, 0000}.  What is the weight of this code?	
	A)  0    B)  1    C)  2    D)  4	

22.	Let C be the code {101010, 010101, 111111, 000000}.  What is the weight of this code?	
	A)  0    B)  1    C)  3    D)  6	

23.	Use the encoding scheme A ® 0, B ® 10, C ® 11 to encode the sequence ABACAB.	
	A)  010011010    B)  01011010    C)  01001101    D)  Another sequence	

24.	Use the encoding scheme A ® 0, B ® 10, C ® 11 to decode the sequence 0101101011.	
	A)  ABCABC    B)  ABACABAC    C)  ABCBCB    D)  Another sequence	

25.	Use the Caesar cipher to encrypt the message ROME BURNS.	
A)	URPH EXUQV	C)	HORU VQUXE	
B)	OLJB YROKP	D)	Another sequence	

26.	Use the Caesar cipher to decrypt the message ZHVW.	
	A)  WEST    B)  EAST    C)  REST    D)  Another message	

27.	Using modular arithmetic, (13·21) mod 10 is equal to	
	A)  2.    B)  3.    C)  7.    D)  another number.	

28.	Using modular arithmetic, (13·21) mod 12 is equal to	
	A)  3.    B)  9.    C)  10.    D)  another number.	

29.	Using modular arithmetic, 43 mod 10 is equal to	
	A)  2.    B)  4.    C)  6.    D)  another number.	

30.	Using modular arithmetic, 53 mod 11 is equal to	
	A)  0.    B)  4.    C)  7.    D)  another number.	

31.	Using modular arithmetic, 153 mod 41 is equal to	
	A)  0.    B)  13.    C)  31.    D)  another number.	

32.	Using modular arithmetic, 133 mod 34 is equal to	
	A)  13.    B)  21.    C)  30.    D)  another number.	

33.	For the RSA scheme with p = 5, q = 11, and r = 7, compute the value of m.	
	A)  10    B)  20    C)  40    D)  55	

34.	For the RSA scheme with p = 5, q = 19, and r = 7, compute the value of m.	
	A)  18    B)  36    C)  72    D)  95	

35.	For the RSA scheme with p = 17 and q = 23, which of the following could be chosen as a value for r?	
	A)  6    B)  4    C)  9    D)  16	

36.	For the RSA scheme with m = 8 and r = 5, what is the value of s?	
	A)  1    B)  2    C)  3    D)  5	

37.	For the RSA scheme with m = 9 and r = 5, what is the value of s?	
	A)  1    B)  2    C)  4    D)  5	

38.	Use the RSA scheme with n = 85 and r = 7 to determine the message sent for the string "14."	
	A)  11    B)  13    C)  59    D)  74	

39.	Use the RSA scheme with n = 85 and r = 7 to determine the message sent for the string "22."	
	A)  13    B)  30    C)  69    D)  78	

40.	Use the RSA scheme with n = 133 and r = 11 to determine the message sent for the string "8."	
	A)  8    B)  31    C)  50    D)  88	

41.	Use the RSA scheme with n = 133 and r = 11 to determine the message sent for the string "10."	
	A)  11    B)  33    C)  110    D)  121	

42.	Use the RSA scheme with n = 85 and s = 3 to decode the message "7."	
	A)  3    B)  21    C)  62    D)  63	

43.	Use the RSA scheme with n = 85 and s = 3 to decode the message "13."	
	A)  39    B)  46    C)  63    D)  72	

44.	Use the RSA scheme with n = 133 and s = 5 to decode the message "32."	
	A)  21    B)  27    C)  53    D)  128	

45.	Use the RSA scheme with n = 133 and s = 5 to decode the message "29."	
	A)  12    B)  15    C)  17    D)  22	

46.	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.	
	A)  I only    B)  I and III only    C)  II only    D)  III only	

47.	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?	
	A)  7    B)  3    C)  2    D)  1	

48.	When using the Venn diagram for determining length seven binary code words for length four messages, what is the weight of the code?	
	A)  7    B)  3    C)  2    D)  1	

49.	If a code is 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.	
	A)  I only    B)  II only    C)  Both I and II    D)  Neither I nor II	

50.	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.	
	A)  I only    B)  II only    C)  Both I and II    D)  Neither I nor II	

51.	Use the Caesar cipher to encrypt the message PICNIC.	
	A)  TMGRMG    B)  SLFQLF    C)  IBVGBV    D)  RKEPKE	

52.	Use the Vigenere cipher with the key word HANK to encrypt the message HOME RUN.	
	A)  OOZO YUA    B)  OOZL RHU    C)  HZMR RFN    D)  PPAP ZVB	

53.	Use the Vigenere cipher with the key word DRUID to encrypt the message INCOMING GIANT.	
A)	MFXXQMFB PMEFO	C)	LEWWPLEA OLDEN	
B)	ZHKRPZHO JLRHB	D)	HNTRLIEJ FIRQS	

54.	Given that BEST was used as the key word to encrypt with the Vigenere cipher, decrypt the message BTJBDSL.	
	A)  PATRIOT    B)  POPCORN    C)  AIRPORT    D)  APRICOT	

55.	Given that PLEASE was used as the key word to encrypt QCMNY JDZH with the Vigenere cipher, decrypt the message.	
	A)  BRING CASH    B)  BRING FOOD    C)  BRING FISH    D)  BRING MORE	

56.	What is the distance between received words 0111011 and 0101001?	
	A)  1    B)  2    C)  3    D)  4	

57.	What is the distance between received words 1101000 and 1100110?	
	A)  1    B)  2    C)  3    D)  4	

58.	Use the nearest-neighbor Venn diagram method to decode the received word 0100110.	
	A)  0110    B)  0010    C)  0111    D)  0101	

59.	Use the Venn diagram method to determine the code word of the message 0111.	
	A)  0111011    B)  0111001    C)  0111010    D)  0111110	

60.	Use the Venn diagram method to determine the code word of the message 1101.	
	A)  1101011    B)  1101001    C)  1101000    D)  1101110	

61.	The expression ¬(P Ù Q) is logically equivalent to	
	A)  P Ú Q    B)  ¬P Ú ¬Q    C)  ¬P Ù ¬Q    D)  ¬P Ú Q	

62.	The expression P Ù Q is called the __________ of P and Q.	
	A)  negation    B)  correlation    C)  conjunction    D)  disjunction	

63.	The expression P Ú Q is called the __________ of P and Q.	
	A)  negation    B)  correlation    C)  conjunction    D)  disjunction	

Answer Key

1.	C	
2.	B	
3.	A	
4.	B	
5.	B	
6.	A	
7.	D	
8.	B	
9.	A	
10.	B	
11.	A	
12.	C	
13.	C	
14.	D	
15.	C	
16.	C	
17.	C	
18.	B	
19.	B	
20.	B	
21.	C	
22.	C	
23.	A	
24.	A	
25.	A	
26.	A	
27.	B	
28.	B	
29.	B	
30.	B	
31.	B	
32.	B	
33.	B	
34.	B	
35.	C	
36.	D	
37.	B	
38.	D	
39.	D	
40.	C	
41.	B	
42.	A	
43.	D	
44.	D	
45.	D	
46.	D	
47.	B	
48.	B	
49.	C	
50.	C	
51.	B	
52.	A	
53.	C	
54.	D	
55.	B	
56.	B	
57.	C	
58.	D	
59.	B	
60.	C	
61.	B	
62.	C	
63.	D