PocketMatrix

basically i have these two numbers in binary:

11010111 and 10001000

i did this: 11010111 - 10001000 and got: 01001111

now i need to CONVERT 10001000 to one's complement and repeat the 'subtraction' by doing one's-comp addition.

how do i do that?! i think converting 10001000 will give me 01110111 but after that i'm stumped. i also need to perform a side-check in nine's complement.

i need the answer within 2 hours of this post....

dammit. i just searched google again but this time i said "one's complement subtraction" instead of addition. i found this: http://courses.cs.vt.edu/~csonline/Numb ... omplement/ and its all sorted out!

now i gotta do the nine's comp check.

Nine's complement is the same technique but you just perform it on decimal instead of binary.

http://mathforum.org/library/drmath/view/55949.html

tada. coursework done. now i gotta print and hand in before 4. then i have to do systematic programming cwk for friday, write my presentation for the oral exam and revise everything for exams next week.

My girlfriend has third-year pharmacology exams next week, too. Good luck in the exams

bah, never wish someone good luck in exams. its like a jinx. besides, i shouldnt need luck, if i've revised properly but i havent, so uh... crap.

at least my tarantino box set arrived yesterday.... at my house... miles away. pfft.

Ah everyone making exams... except for the lucky bastards who had an exam period just before their vacation instead of immediately after :\

I have an exam on the theory of computation this friday. Number representations is a part of it aswell, albeit a very small part since every representation with a base higher than 1 is considered in the same class (because there's a constant factor between a number in one base and any other, bla bla bla). I'm so gonna fail it =[ hmm, what am i doing here... better go back to studying!