Bit
01001000 01101001 00100001 00100000 01001100 01100101 01110100 00100000 01101101 01100101 00100000 01100111 01110101 01101001 01100100 01100101 00100000 01111001 01101111 01110101 00100000 01110100 01101000 01110010 01101111 01110101 01100111 01101000 00100000 01110100 01101000 01100101 00100000 01101000 01101001 01110011 01110100 01101111 01110010 01111001 00100000 01101111 01100110 00100000 01000011 01101111 01101101 01110000 01110101 01110100 01100101 01110010 01110011 00100001
Hi! Let me guide you through the history of Computers!
Function
Bit is a very simple and enthusiastic little guy. He is either 0 or 1, true or false, yes or no. In computers, he is always the former. Even with just two states, Bit can control everything in computers, especially when he is together with his friends. The more Bits there are, the more complex calculations a computer can do or the more data it can store. When Bit has gathered 7 more friends, they turn into his big brother Byte and venture off to do even more complex and awesome things. But what makes multiple Bits so powerful? He can only be 0 and 1, surely not much changes when there are multiple of him? The strength is in the combinations you can make with multiple bits. Here, have a look at this table:Number of Bits | Different Patterns |
---|---|
1 | 0 1 |
2 | 00 01 10 11 |
3 | 000 001 010 011 100 101 110 111 |
Come on, Bit! We are going on an adventure!
01010111 01101000 01100101 01100101 01100101 00100001
Wheee!