Hey guys! For those of you that were in today's (29/11) lecture, we had Saeed teaching us some magical mathemtical stooooooof. You know, this was stuff about binary and converting binary to decimal and vice versa.
First of all, Saeed taught us about taking the decimal and continuously dividing by two using the remainder values to find out our binary code. Example below:
As you should have realised by now, binary BITs go up in values of 2^n (n being the number of BITs). Also, BITs cannot be represented in single form, only in sets of four.
Therefore, the number 76 in 8 BIT would be shown like this:
As you can see, even though there is no value for the 8th BIT (128), we still show it as it is a direct representation of how the computer reads our inputs in binary form.
Lastly, for some (very specific) situations, there is a nice quick way to figure out what your line of binary code needs to be. If the number you are looking for is the value of a BIT minus one (example: 63), then all BITs up until you reach the BIT in question (For this case, 64) would be seen as 1s.
See below:
I Enjoyed this lecture , Because it was too easy :)
ReplyDeleteThis conversion method which Saeed gave us is helpful as it is easy to use. =]
ReplyDeleteYour diagrams are a really effective way to make the concept easier to grasp. Reading text and trying to understand it can be time consuming but a picture really is worth a thousand words!
ReplyDeleteI hate maths, I still don't see the point of it
ReplyDelete