Week 4 Lecture Notes

Week 4 Lecture Notes - January 28: Lecture 10 Announcements...

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

View Full Document Right Arrow Icon
January 28: Lecture 10 Announcements Finish reading Chapter 2 if you have not done so yet Begin reading Chapter 6 *Big keywords reduce multiple occurrences of certain group of letters grouped together. One-time Pad Ciphers : hard to do because you need to travel to the other person and give them the key before-hand so they can read the ciphertext Book Cipher : encode a secret message where the letter encoded is the first letter of each word and the words are numbered from 1 on in like a newspaper or book and the ciphertext is just the numbers that represent the word that has that specific number in the article; each letter could also be numbered in the text instead of each word EX : 110, 73, 24, 807, 65, 86 (word in the article) A, R, E, Y, O, U (first letter of that wrd) Computers Binary #’s 0’s and 1’s (~“bits”) Base 10 : we make numbers using only 10 symbols: 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 Base 2 : what computers use: 0, 1 ~ 0, 1, 10, 11, 100, 101… Base 10 : 734
Background image of page 1

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

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

This note was uploaded on 04/03/2008 for the course LIGN 17 taught by Professor Kehler during the Winter '08 term at UCSD.

Page1 / 4

Week 4 Lecture Notes - January 28: Lecture 10 Announcements...

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