Convert the decimal number (- 22 )10 into signed binary number using Signed Magnitude form, 1's Complement form and 2's complement form

Q1. Convert following numbers in given radix system: a. (697)10 into Octal and Hexa decimal b. (2D9)16 into Decimal and Octal Q2. Using two's complement representation, solve: a. 101110001 – 1111111001 b. 1010101010 – 1010010101 Q3. Perform following arithmetic operations: a. (6767)10 + (3592)10 using BCD b. (C7C)16 - (B0E)16 using 16's complement Q4. A code 1011011 needs to be sent to the receiver. Using, hamming code find out the code- word and the mechanism to check the corrected data when error occurred at 4th bit. (Assumptions: Right to Left with Odd Parity) Q5. (a) Convert the following logic gate circuit into a Boolean expression, writing Boolean sub-expressions next to each gate output in the diagram: A (b) Realise Ex-OR gate using universal gate? Q6. Implement and simplify f (A, B, C, D) = E(1,3,5,8,9,11,13,15) using K-map?

Best choice

Decimal Ex Binary Addition Addition (C 3+5 0011 + 0101 4 + 1 8 + 3 2+4 0010 + 0100 0 +7 0000 + 0111 8 +7 9 +9 **

Convert the following decimal numbers using binary numbers: 55 +55 -55

Perform the following subtractions of the SIGNED numbers in the 2's complement form: (Show all your work and verify your calculation in decimal.) perform the subtraction 10001000 - 11100010

Please solve

Convert the decimal numbers into signed 10-bit numbers. Signed and magnitude number 2's complement number Decimal l's complement number number 203 -77

I just need the count up range for this question. Example:0-7 or 0-5 it's asking what is the numbers it can display on a digital display.

1.2 Convert to octal. Convert to hexadecimal. Then convert both of your answers to decimal, and verify that they are the same. 111010110001.011, (b) 10110011101.112