Turn in the last set of discussions of your choice of three articles from the provided list in the areas of encoding, probability, and game theory. Although we did not cover any probability you may still select one of those articles if you wish (the game theory ones are probably more interesting though). Just a reminder that the goal is NOT to summarize the article (although some description of the topic will be necessary) but to provide some of your own original thoughts on the subject of the article.
Due – Friday, May 21
To be checked:
- What move in each of the three following games of Nim would put you in a winning position?
- What number of items in the last box would be a losing position for you?
Quiz – Monday, May 17
1st period – Monday 3rd period – Wednesday. Covering all the coding material described in the “Coding Notes” in the Blogroll. Only one page of notes allowed (both sides). Calculator required.
- Be familiar with or be able to give examples of terminology covered in the notes
- Analog vs. Digital, Binary vs. Decimal, Bit vs. Byte, Octal vs. Hexadecimal
- Parity Bit vs. Check Digit vs. Hamming Code vs. Hash Sum
- Congruent Modulo vs. Prime vs. Coprime vs. gcd
- Symmetric vs. Asymmetric key, Substitution vs. Transposition cipher
- Be able to give examples of applications of data formats, ID numbers, bar codes, hash sums, or encryption.
- Convert a decimal number to a different base or convert another base to decimal
- Interpret or create a bar code
- Calculate a check digit using some modulo
- Perform general modular arithmetic and solve a modular congruence (requires “division”).
- Solve a Chinese Remainder Problem
- Find a gcd with Euclids Algorithm
- Find a modular inverse with Extended Euclids Algorithm
- Calculate a modular exponential by squaring
- Demonstrate a Diffie-Hellman key exchange
- Create a public and private key for RSA and perform encryption/decryption
