Quoting Corey Osgood <[EMAIL PROTECTED]>: > Peter Stuge wrote: >> On Tue, Jun 19, 2007 at 12:34:51PM -0400, Corey Osgood wrote: >> >>> No. The binary and is kinda weird, if you have, say, 11100011 and >>> 01010101, the binary and will give an answer of which bits are the >>> same between the two, >>> >> >> Not quite, that's XOR+NOT, exclusive or with inversion. >> >> The truth table for AND is: >> a b y >> 0 0 0 >> 0 1 0 >> 1 0 0 >> 1 1 1 >> >> The result is 1 only when both input bits are 1. The result is 0 >> otherwise. >> >> >> >>> so 01000001. >>> >> >> This is correct however. >> >> >> 11100011 >> & 01010101 >> -------- >> 01000001 >> >> (use a fixed width font) >> >> >> //Peter > > Thanks, that was a much better explanation than mine. > > -Corey > Thanks Peter and Corey, That makes perfect sense.
Thanks - Joe -- linuxbios mailing list [email protected] http://www.linuxbios.org/mailman/listinfo/linuxbios
