What is bit-pair algorithm for multiplication in hardware?
99892
Its a method to speed up your multiplication. Doesn't always speed up the operation.\n------\nTry googling it. \nU may also want to google - 'Booth Algorithm'
460346
You can try multiplication since it is the inverse property of division.
975105
Computers are based in transistors, which are electronic devices that can hold only two states: let electric current pass, or stop the current, and most importantly, we can controls these states at will using small electrical currents.\n\nTo one of these states we have assigned a 0 and to the other a 1.\n\nNow, with 0s and 1s you can represent numbers, any number, if you stick to a set of rules.\n\nFor example, if you agree that digits have different values depending on their position, then you can represent any integer number:\n\n0: 0\n1: 1\n2: 10  (the first before last position is multiplied by 2)\n3: 11\n4: 100 (the second before last position digit has a value multiplied by 4).\n5: 101\n6: 110\n7: 111\n\nand so on.\n\nOnce you have a high enough number of numbers in this odd binary language (lets say 256) then you could decide that each digit represents a mathematical operation of some kind, for example:\n\n0 could be an addition.\n1 could be a substraction\n\nand do on.\n\nSo in synthesis you have operations described with 1s and 0s and you can also represent numbers with 1s and 0s. So you have the rudiments of a language you can use, using the examples above, you could say:\n\n0001   \n0000\n0010\n\nwhich could mean 1+2 (using a convention where the second group of digits represents an operation, in this case addition as sugested previously)\n\nall using only 0s and 1s.\n\nYou can extend these principles as much as you want, by doing do you would be creating a computer language.\n\nNow, how does the computer interpret this?\n\nWith  transistors you can also create electronic circuits that behave like small logical machines.\n\nThese logical machines (called logical gates) can be put together in order to perform arithmethic or logical operations.\n\nSo if you feed the series of 0s and 1s of your computer program  to a different circuit behaving like logical/ arithmetic machine (and this is done prety much by wiring the cables as needed), you have the principle of a computer system which is reading a computer program with complex meanings.
83100
If you are only going with 4 bit then, yes. If you were useing 8 bit it would be doubled to FFFFFFFF and then doubled accordingly as you go up in bit numbers.
751280
multiplication\n\n\nDoug
278213
To understand bitwise operators, you have to play with them a bit. Take 32-bit values and start to AND, OR, XOR, NOT them. When you will see what had happened, you immediately will inderstand the matter and you will start to "think in bitwise operators"!
21504
Its 2^0+2^1+2^2+2^3+....+2^63.\nThe sum of powers of 2 till 64. \n\nthe speed of a 64bit processor?
1119021
Assuming an 8-bit register:\n\n00111000 - 01111011 = 10111101\n\nIt may appear at first that the difference as expressed is the positive number 189, but it is actually the 2s-compliment form of expressing a negative number.  As such, the solution may be extended for any sufficiently large register size, e.g. 16-bit:\n\n1111111110111101
522254
do multiplication retart
160575
if it 2 numbers... you multiply msb by 10D and add to your answer the lsb... and youl get the number in hex!
163804
Continuously divide the decimal number by 16 and stack up the remainders at each stage, until you finally reach a divisor that is less than 16. Of course, you have to write the remainders above 9 in the alphabetical form - 10=A, 11=B and so on till 15=F. Finally, string the final divisor followed by the stack of remainders read backwards to obtain your hex number.\n\nAlternately, if you are good at converting between decimal and binary, do that and then read off the binary bits from the end in groups of four in the equivalent hex. For example, if after decimal-to-binary conversion, you were to get\n11100011010101, then group them as\n(0011)(1000)(1101)(0101). Now, this is equivalently 38D5 in hex.
397669
8 bits is a byte... 4 bits is a byte... whether your binary looks like 10011000, 11111111, or 00000001 or 00000000, it's all a byte. If you have 1001, the machine will automatically make it 00001001. It will just add zero's in front of it to make it a byte.
6928
When both operands are numeric, ^ in Java is a bitwise exclusive OR (otherwise known as XOR).  In binary terms, 2^4 is the same as 00000010 XOR 00000100 which results in 00000110 (6).  This is unless the ^ operator is overloaded in which case you'd have to refer to the overloaded method for XOR.  If you are not familiar with XOR, XOR returns TRUE when both operands are not equal, and FALSE when both are equal.
1009555
Unsigned: 2 power 6, that is 64(0-63).\nSigned: 2 power (6-1), that is 32(0-31) /* 1 bit for sign */.
409800
Generaly, becouse bit numbers are on a boundy of an exponet of 2, we can calculate like this:\n\n1024 bits in 1 kilobit\n1024 kilobits in a megabit\nthus: 1024 * 1024 = 1,048,576 bits
160354
- Its called Binary.\n- The binary consists of 0's and 1's\n- At basic level of hardware, whenever you pass a command to the computer, the operating system translates this to machine language.\n- The machine language interprets as 0's and 1's which means create some electronic signals.\n- Computer hardware is consists of thousands of Transsistors.\n- A '0' generation means the transistor produces the 'Negative' signal and '1' genaration means a 'positive' signal.\n- This how a computer's base system works and so the binary called 0 and 1.\n- Its a broad topic and so i can suggest you to search in Googe for more elaborated results.\n- all the best.\n--------------
149299
The truth table is easy:\n\nABC . . . OUT\n000 . . . . 0\n001 . . . . 0\n010 . . . . 0\n011 . . . . 0\n100 . . . . 1\n101 . . . . 0\n110 . . . . 0\n111 . . . . 0\n\nConstructing the circuitry from logic gates would be a bit more work.