Computer Science 1011A/B Lecture Notes - Lecture 8: Computer File, Floppy Disk, Baudot Code
8 Oct 2018
School
Department
Course
Professor
Document Summary
1 bit won"t do it (only 0 and 1) 2 bit (01, 10, 11, 00) for any value, 2^n = k ex. least number of bits for 36. **give k, what is least number of bits k+36. What the computer sees as on and off for 0 and 1, we will be able to see what they actually represent (i. e. john lennon) 2^2 = 0-3 (that is the range of numbers it represents) I. e. 256 (2^8) bit patterns of length 8 are interpreted as the numbers 0 to 255 (2^8 1) Make the on"s and off"s (1"s and 0"s) mean something. Develop a code that uses 1s and 0s. The concept of bit patterns to represent characters . Morse code is called a hoffman code (doesn"t work because it doesn"t represent all characters) Baudot code: uses 5 bits to represent all the characters 2^5 = 32. American standard code for information interchange (ascii) 1966.
