Given the 21-bit even-parity Hamming code: 0 1010 0111 0011 0000
0101
and assuming there is one incorrect bit.
a. Which bit is incorrect?
My educated guess for what the incorrect bit maybe has me
thinking it is the '1' bit at the end of the '0111' byte, but I
have no full proof as to why it is that specific bit. Am I in the
right area to think that?
b. After the error is corrected, what decimal number...
Design a regular expression to filter out those numbers that are
stored in the standard format “+00-0-0000-0000”.
Examples of valid results are:
+61-3-9214-4980 and +61-3-9285-7706
1) What are the hexadecimal, and octal equivalents for the
unsigned binary value 0111 0000 1101? (note the spaces in the
binary are for readability (like a comma in a decimal value; there
is only a single 12 bit binary value)
PLEASE EXPLAIN IT IN DETAIL
Calculate A+B, A-B, AxB, and A/B for each of the following pairs
of binary numbers. (Assume the first number in each pair = A and
the second number =B). Append all numbers to 8 bits. Subtraction is
not2’s complement.
a.1010101, 011010
b.101101, 10101
c.11001, 1100
d.1010101, 1110
Develop a python program to convert two decimal numbers (A and
B) to binary numbers. You should generate B complement signal (flip
all the bits of Input B,
1.convert the following numbers from decimal to binary assuming
seven-bit twe's complement binary representation:
a)49 b) -27 c)0 d) -64 e) -1 f) -2
g) what is the range for this computer as written in binary and
in decimal?
2.convert the following numbers from decimal to binary assuming
nine-bit twe's complement binary representation:
a)51 b) -29 c) -2 d)0 e) -256 f) -1
g ) what is the range for this computer as written in binary and
in decimal?
Design a system which can add two 2-digit binary numbers (no
carry in). Use a truth table approach and use karnaugh-map
Write a Boolean equation for each output and draw circuit.