![]() Then for two bits, if you claim that the number of states is four, then they must be $00, 01, 10, 11$ (another option would be just two states, $00$ and $11$, or - why not - setting the bits from left to right, $00,10,11$, for three states.) I am afraid that you did not think much about this issue.Ĭlearly, a single bit encodes two states, $0$ and $1$. Let me tell you that If you want to know the largest number you can store in a byte, it is good to know that it is 255! not 256 not even 512. One more point, I can guess you have one more confusion. Similarly for 4 bits, you can replicate the same rule. Using various combination of each bit you can show the following values Let me explain why do you need to use power function (2^3) instead of multiply (2*3) to find the number of values to show using 3 bits.You have multiplied 2*8 which is incorrect. You have multiplied 2*7 which is incorrect.Įight bits = 16 values -> 2^8=256, Your answer is incorrect. Seven bits = 14 values -> 2^7=128, Your answer is incorrect. You have multiplied 2*6 which is incorrect. Six bits = 12 values -> 2^6=64, Your answer is incorrect. You have multiplied 2*5 which is incorrect. You have multiplied 2*4 which is incorrect.įive bits = 10 values -> 2^5=32, Your answer is incorrect. You have multiplied 2*3 which is incorrect.įour bits = 8 values - > 2^4 = 16 Your answer is incorrect. Three bits = 6 values -> 2^3=8*, Your answer is incorrect. So your calculations should become like these:ġ Bit = 2 values -> 1^2 =2, Your answer is correct ![]() Your misunderstanding and confusion comes from very basic point that you should not multiply 2 into the number of bits. I just want to know how increasing factors of two is multiplied by (seemingly) powers thereof. NOTE: This doesn't have to just apply to adders circuits with transistors and logic gates, but to the pits and lands on an optic disc, the platter representation of data on a disk drive, flash drive binary storage, RAM, anything. How would it get 128? Could anyone clarify this confusion? In a four bit adder, we'd have something like this: How would it make sense that one byte can hold 256 different values in a circuit? In total, I get a sum of sixteen values multiplying the factors by two for every increasing bit. So if one bit is two possible states, multiplication factors yield that by two: Forgive this seemingly "troll-ish" question, but I must lack the ability to understand how one byte (two nibbles, eight bits, however you wish to describe it) can hold 256 different states, possibilities, values or such.įirst of all, one bit would look like this:Īny way of being able to input two states (in the poor example above, two separate circuits at different voltages can be treated logically as "yes" or "no").
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |