Computer Science 308-250B
Midterm, Feb 20, 2002, 18:30-19:30.
SOLUTIONS
Computer Science 308-250B
Midterm, Feb 20, 2002, 18:30-19:30. O P E N B O O K S / O P E N N O T E S
1) Show the following (and justify your steps) a) n1000 is O(nn) For n>1000000 we h
CRYPTOGRAPHY
Secrecy Ciphers Secret Key Cryptography Key Exchange Public Key Cryptography Digital Signatures Internet applications
Cryptography
1
Secrecy
Alice wants to send a message (plaintext p) to Bob The communication channel is insecure and can be
COMP 250 - Homework #3
Mathieu Blanchette
Question 3. (15 points)
Consider the following recurrence:
T(n) = 1
2 * T(n - 1) + n + 1
if n = 1
if n > 1
a) (10 points) Obtain an explicit formula for the following recurrence using one of the techniques
seen in
COMP 250 Winter 2016
2 binary representations
Jan. 19, 2016
Binary numbers
The reason humans represent numbers using decimal (the ten digits 0,1, . ,9) is that we have ten
fingers. There is no other reason than that. There is nothing special otherwise abo