Re: bitwise operators
Post 5, truth tables can be expressed as regular row-column tables. I think Wikipedia has a nice entry on truth tables you can read. On the web, they can usually be represented in standard HTML tables. These are simple tables that have headers such as, x, y, x&y, x|y, x^y, etc. Then, for each row, you have the different combination of bits that x and y can take on. I would show you an example, but not sure if you can make tables in BB code or whatever this forum system uses. That, and I am kinda in a hurry. lol A quick example of using bitwise operators to do arithmetic is by using AND operator on bits for carry bit, and XOR on the two bits to add, shift left 1 position to the left, and add. There is a very interesting implementation here: https://www.geeksforgeeks.org/add-two-n … operators/ . It uses a recursive technique, which is not very efficient, but it gets the point across. Also, a good article to read on Wikipedia is on the adder circuit. Keep in mind that at a circuit level, the ALU only has logic gates available to it. A good intro to digital logic or computer architecture might be really useful. Hope some of this is helpful and it doesn't go over your head. Users of higher-level programming languages don't usually have to concern themselves with these things, but bitwise operations and registers and all that fun stuff is essential to how programming languages can do what they do so easily. If you take a computer science cirriculum, much of this is covered in an Intro to Digital Logic course, or Computer Organization course. And the real fun stuff is if you dive into Electrical Engineering and you get to play with FPGAs and microprocessors, not to be confused with microcontrollers.
-- Audiogames-reflector mailing list Audiogames-reflector@sabahattin-gucukoglu.com https://sabahattin-gucukoglu.com/cgi-bin/mailman/listinfo/audiogames-reflector
