![]() Thus, this result of bitwise AND-ing can be Yields a value in the third bit position exactly equal to the thirdīit position of the original number. The third bit position from the left has a positional value of 25) Notice this scheme of bitwise AND-ing a mask value of 32 (25, since Illustrated below to bitwise AND with the original number in order to "Suppose we wish to look at the third bit from the left. Basically what I have to do is turn a regular number into a binary number, and, assuming that 1 means the switch is open and 0 means it's closed, go through each digit in the binary number and print whether it's open or closed. I've been trying this project in Blue Pelican Java for over an hour, and I'm not quite sure why it's not working.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |