CS1800 Discrete Structures Fall 2017 October 25, CS1800 Discrete Structures Midterm Version B

Transcription

1 CS1800 Discrete Structures Fall 2017 October 25, 2017 Instructions: CS1800 Discrete Structures Midterm Version B 1. The exam is closed book and closed notes. You may not use a calculator or any other electronic device. 2. The exam is worth 100 total points. The points for each problem are given in the problem statement and in the table below. 3. You should write your answers in the space provided; use the back sides of these sheets, if necessary. 4. You have two hours to complete the exam. Section Title Points Section 1[14 points] Binary, Octal, and Hexadecimal Section 2 [12 points] Logic Section 3 [14 points] Modular Arithmetic & Algorithms Section 4 [12 points] Modular Cryptosystems Section 5 [6 points] Sets Section 6 [12 points] Counting Section 7 [15 points] Permutations and Combinations Section 8 [15 points] Proofs Total Name: Instructor: NU ID#: 1

2 Section 1 [14 pts (6, 3, 2, 3)]: Binary, Octal, and Hexadecimal 1. Convert the base 2 number to (a) decimal, (b) hexadecimal, (c) octal (base 8). Solution: (a) = 43. (b) 2B (by converting binary 10 and 1011). (c) 53 (by converting binary 101 and 011). 2. Find the 8-bit two s complement representation of 37. Solution: Flip to , add 1 to get the answer: Assuming we are using an 8-bit two s complement representation, name the smallest positive value that would produce overflow when added to the number 4. Solution: Suppose we add the decimal numbers 119 and 13 using 8-bit two s complement arithmetic. What is the result (expressed in decimal notation)? Solution: = , which is two s complement for

3 Section 2 [12 pts (4, 4, 4)]: Logic 1. Simplify the expression (a b) (a ( b a)) Solution: a 2. Draw a logical circuit with three inputs that evaluates to true exactly when at least two of its three inputs are true. Solution: 3. Rewrite the expression a b c using only (or) and (not) operators instead of (and). Solution: ( a b c) 3

4 Section 3 [14 pts (5,3,3,3)]: Modular Arithmetic and Algorithms 1. (a) Use fast exponentiation (repeated squaring) to compute 4 16 mod 11. Solution: 4 2 = 16 = = 5 2 = 25 = = 3 2 = = 9 2 = 81 = 4 (b) Use your work from the previous problem to compute 4 22 mod 11. Solution: This is (4 16 )(4 4 )(4 2 ) mod 11 = (4 3 5) mod 11 = 60 mod 11 = Find the GCD of 8100 and 1800, using whatever method you prefer. Solution: One is 9*9*100 and the other is 2*9*100, so: Use Euclid s algorithm to find gcd(253, 175). Show all steps. Solution: gcd(253, 175) = gcd(175,78) = gcd(78,19) = gcd(19,2) = gcd(2,1) = 1 4. How many integers between 1 and 128 are relatively prime to 128? Solution: 64 4

5 Section 4 [12 pts (5, 4, 3)]: Modular Cryptosystems 1. Find coefficients a and b for the decryption function x = ay + b mod 26 of the linear cipher y = 5x + 15 mod 26. Solution: a = 21, b = Suppose that the RSA public key (7, 33) has been used to produce ciphertext 2. (a) What is the private key? Solution: 3 (b) Decrypt the message. Solution: 2 3 = 8 5

6 Section 5 [6 pts (2,2,2)]: Sets If our universe is the integers Z, and O represents all odd integers, and S represents the set of integers divisible by 7, describe the following sets using union, intersection, and complement. 1. The set of all odd integers divisible by 7. Solution: O S 2. The set of all even integers. Solution: O 3. The set of all integers that are even or divisible by 7. Solution: O S 6

7 Section 6 [12 pts (4, 4, 4)]: Counting For this section and the next, you can leave your answer unsimplified, but at least give the numbers to multiply. 1. A movie theater has three showtimes this Saturday: morning, afternoon, and evening and 20 movies to choose from. (a) In how many ways can it select a different movie for each time slot? Solution: P(20,3) = 20!/17! = 20*19*18 = (b) In how many ways can it select a movie for each time slot, possibly with repetition, so that not all movies are the same? Solution: = Suppose that the movie theater sold 700 tickets last Saturday. How many people, at least, attended the most popular of the three shows? Solution: ceiling(700/3) = 234 7

8 Section 7 [15 pts (3, 3, 4, 5)]: Permutations and Combinations In this section as well, you need not multiply out your answer. In a certain country, license plates consist of three vowels (from A, E, I, O, U) and three digits (from 0, 1,..., 9). 1. How many license plates are possible if the three vowels must precede the three digits and repetitions are allowed? For example, AAU577 is a valid license plate but A5AU77 is not. Solution: How many license plates are possible if the three vowels must precede the three digits and repetitions are not allowed? For example, AEU579 is a valid license plate but A5EU79 is not. Solution: P(5,3)*P(10,3) = 5*4*3*10*9*8 3. How many license plates are possible if the three vowels may be anywhere and repetitions are allowed? For example, 57A7AU is a valid license plate. Solution: ( 6 3 ) = (6 5 4/3 2) How many license plates are possible if the three vowels may be anywhere and repetitions aren t allowed? For example, 57A9EU is a valid license plate. Solution: C(6, 3)P (5, 3)P (10, 3) = (6 5 4/3 2)

9 Section 8 [15 pts (7,8)]: Proofs 1. Prove that if p divides n, then φ(n) (n n/p). Do not use any formulas for φ(n). Solution: φ(n) is the number of integers in [1,n) that are relatively prime to n. The numbers p, 2p,..., (n/p)p are not relatively prime to n since they share a factor of p. Since there are (n/p) of these, subtracting these from n gives the bound; there might be fewer relatively prime numbers, but there aren t more. 2. Prove that for all odd n, the sum of ( n i) for 0 i n/2 is 2 n 1. Solution: The sum of ( n i) for 0 i n is 2 n, since this is the number of possible subsets of n for any size, and the individual terms are the sizes of subsets of specific sizes. For odd n, there are an even number of such terms: 0 plus 1... n. And we know binomial coefficients are symmetric from the fact that ( n r total sum of all ( n i), thus 2 n 1. ) ( = n n r). Thus these coefficients must be worth half the 9