quizsol - N distinct objects by binary strings of length k...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
CS 346 Cryptography FALL 2009 Background Quiz - Solutions 1. What is the numeric value of log 2 (8 50 )? 150 2. Give a big-O estimate for each of the following functions: A. 2 n 3 + n 2 log n = O ( n 3 ) B. ( n 2 + 8)( n + 1) = O ( n 3 ) C. n ! + 2 n = O ( n !) 3. An integer is chosen at random from the first 300 positive integers. What is the probability that the integer chosen is divisible by 2 or by 3? Let E denote the event that the integer chosen is divisible by 2, and let F denote the event that the integer chosen is divisible by 3. Then P ( E ) = 150 / 300 = 1 / 2 and P ( F ) = 100 / 300 = 1 / 3. We are looking for the probability P ( E F ). We know that P ( E F ) = P ( E ) + P ( F ) - P ( E F ). P ( E F ) = 50 / 300 = 1 / 6, thus P ( E F ) = 1 / 2 + 1 / 3 - 1 / 6 = 2 / 3. 4. What is the greatest common divisor of the following pair of integers: 2 2 · 7 and 5 3 · 13? 1 5. What is the number of different binary strings of length n ? 2 n 6. You want to represent
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: N distinct objects by binary strings of length k , such that dierent objects are represented by dierent strings. How large k has to be? d log 2 N e 7. What is the number of dierent subsets of size k of an n element set? n k 8. Prove that n i =0 n i = 2 n . (HINT: there is a simple argument, without formal calculations.) We have seen before that the number of dierent binary strings of length n is 2 n . We also know that the number of dierent binary strings that have exactly i 1s is n i . (Compare this with question 7.) Thus the number of dierent strings of length n is n i =0 n i . This proves that n i =0 n i = 2 n . 2...
View Full Document

This note was uploaded on 10/07/2010 for the course C S 52475 taught by Professor Gal during the Fall '10 term at University of Texas at Austin.

Page1 / 2

quizsol - N distinct objects by binary strings of length k...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online