CMSC 198: Computer Science: A Hands off Approach

Summer 2014 HOMEPAGE

Syllabus

HOMEWORKS

hw01.PDF,

hw02.PDF,

hw03.PDF,

hw04.PDF,

ANSWER TO PROBLEMS 4,5,6,7

hw05.PDF,

hw06.PDF,

hw07.PDF,

hw08.PDF,

hw09.PDF

HANDOUTS

1. CIPHERS.PDF, These are notes on everything we did on ciphers the first two days, except Vigenere. It also contains what we will be doing the third day (if you want to look ahead).
2. BABY.PDF, Notes on the baby-step/giant-step algorithm for discrete log (July 17 lecture.)
3. CARDS.PDF, Notes on the baby-step/giant-step algorithm for Secret Sharing with Cards. (July 18 lecture.)
4. NIM.PDF Nim games- you can skip the proofs (July 21, 22 lecture.)
5. FINDING INVERSES.PDF
6. ERROR DETECTION.PDF Using mods for error detection.
7. SECRET SHARING Secret Sharing.
8. Huffman Coding: Just type ``Huffman Coding'' into Google and you'll get plenty of things to look at. The important ones are examples of how to form a Huffman Coding.
9. Coin problems: Read the first 4 pages of my paper: CHANGE (On right hand side close to top click on PDF)