5(a)
(114)dec--->()oct
divide 114 by 8 therefore quotient 14 and remainder is 2
again divide 14 by 8 therefore quotient is 1 and remainder is 6
dividing 1 by 8 quotient is 0 and remainder is 1 and no more division can be done .So taking remainder in reverse order--162
therefore 114dec==162oct
5(b) (10011011.011)bin-->()dec
=(1x2^7)+(0x2^6)+(0x2^5)+(1x2^4)+(1x2^3)+(0x2^2)+(1x2^1)+(1x2^0)+(0x2^-1)+(1x2^-2)+(1x2^-3)==155.375
5(c) 10110101->8bit 2's comp-->()dec
first we have to calculate 2's complement of thenumber
therefore 10110101->01001010(1's)-->01001010+1==01001011(2's complement)
therefore (0x2^7)+(1x2^6)+(0x2^5)+(0x2^4)+(1x2^3)+(0x2^2)+(1x2^1)+(1x2^0)==75(ans)
5(d)
-39dec-->()8 bits 2's complement
39-->00100111
1's complement 11011000 which is equal to(-39)
therefore 2's complement in 8 bit ==11011000+1==11011001(ans)
5(e)1A2B.3C-->bin()
1-->0001
A-->1010
2-->0010
B-->1011
3-->0011
C-->1100
therefore in binary 1101000101011.001111(ans)
5(f)(1100101011.11011)bin-->oct()
split the binary number from left to right each of group 3 bits
001 100 101 011.110 110
1 4 5 3. 6 6 (corresponding decimal value expalined in 2nd bit)
therefore 1453.66(ans)
5(g) 21.2dec-->bin
10101.0(ans)
just divide the number by 2 as explained in the first bit of the question since we have convert it to binary therefore divide it by 2.and then write the remainders in reverse order .
for 21-->10101
and after decimal .2-->0010
5. Number conversion a. (114)dec → Doct b. (1001 1011.011)bin → ( )dec c. (1011 0101)8-bit...
Arduino. DEC HEX BIN(4-bits) Introducing ARDUINO 0 0 0000 1 1 0001 2 2 0010 3 3 0011 4 4 0100 5 5 0101 How many 1/0 of Port-D? How many usable 1/0 of Port-D, if Serial-Communication is in-used? What is the Arduino's pin assignment of ATMEL's PC5, PB3, & PD1*? What is the ATMEL's pin assignment of Arduino's D13*, D1, & D19? To complete the table about Number System Conversion (shown your step) 6 6 0110 7 7 0111...
Given the 8 - bit binary number: 1001 10 1 1 What decimal number does this represent if the computer uses: signed magnitude representation (a) signed 1's complement (b) (c) signed 2's complement Assuming 2's complement 8 - bit representation, consider the following: +70 010001 10 21 +80 010100000 10010110 Is this correct? Why or why not?
[Hamming algorithm] having problems understanding the step highlighted in bold. explain the part going over checking the parity bits (the problem question is listed below) 12+1+r<=2^r-->r=5 5+12=17 for bit length--> -->parity bits check positions are 1,2,4,8,16-->fill in the using BIN skipping over the 1,2,4,8,16 positions--> --> 1=1 2=2 3=1+2 4=4 5=1+4 6=2+4 7=1+2+4 8=8 9=1+8 10=2+8 11=1+2+8 12=4+8 13=1+4+8 14=2+4+8 15=1+2+4+8 16=4+4+8 from my understanding, you check over the parity bits 1,2,4,8,16. using above as a reference. for bit 1...
HW3: Problem 1: (first, study the example-1 in page-6) A computer uses 8-bit for FLP (1 bit for sign, 4 bit for exponent with excess-7 rep. (see table below), rest for magnitude). Assume 0000 and 1111 in exponent field are reserved for denormalization. 6 Decimal 0 Unsigned 0000 Excess-7 Reserved used as -6 in unnormalized 1 0001 -6 2 0010 -5 3 0011 -4 4 0100 -3 5 0101 -2 0110 -1 7 0111 0 9 Decimal 8 Unsigned 1000...
21. What is AA BA in 8-bit unsigned representation? [all numbers are given in hex] a. Overflow b. 10 1A C. d. A1 22. What is the 8-bit 2's complement representation of a number which is represented as 811s in 8-bit sign- magnitude integer representation? а. FF16 b. 1816 1116 C. d. Cannot be determined 23. What is 3B16 AB16 in 8-bit sign-magnitude representation? а. DB:6 b. 1016 2B16 C. d. Cannot be determined 24. What is 1100 - 0001...
6. Convert .3710 to a binary fraction of 10 binary digits. 7. Use two's compliment arithmetic to perform the following 8 bit binary operations. a. 0010 1110 + 0001 1011 b. 0101 1101 – 0011 1010 c. 1011 1000 – 1000 1011 d. 1000 1100 – 1111 0111 8. Convert 150.8476562510 to IEEE Floating Point Standard. 9. Simplify the following Boolean expressions. a. xy + xy + xz b. (w + x)(x + y)(w + x + y + z)...
5. Express (76) 10 and (-114)10 in 8-bit binary two's complement arithmetic and then add the numbers. What would be the representation (0)10 in 16-bit binary two's complement? (be sure to show your work). 6. Create two 16-bit 2's complement integer such that their sum causes an overflow. Why does the sum of a negative 2's complement number and a positive 2's complement number never generate an overflow? Discuss.
Please show work! 2. Now, give it a try by converting the binary number 01110110 to decimal by filling in the same table in step 1 r of 2 Pov 128 64 32 16 Cumulative Amount 4. Now, you give it a try by converting the decimal number 131 to binary by filling in the table Power of 2 128 32 16 Bit Amount Remaining 6. Use the binary to hexadecimal table to convert the binary number 01101111 to hexadecimal...
ints) The following questions pertain to machine numbers (a) (2 points) For an 8-bit unsigned integer, what is the decimal equivalent of 10010101? (b) (3 points) For an S-bit signed integer, what is the decimal equivalent for the 2's compliment of 11010101? (c) (5 points) Consider an 8-bit floating point number like the one in Homework A2 (one sign bit, three exponent bits, and four assignable mantissa bits), what is the floating point number that associates with 01101 1001? ints)...
Do the following number conversions assuming two's complement representation is used for binary numbers. Douto check your answers becauses mentioned in class.portul credt will not be please digit is wrong in your answer. Do not put any space between ages/bits in your answers a. (113710 - 02 (8-bit binary number) b. (-97)10 - 12 (8-bit binary number) C. (0101 11002 D10 (decimal number) d. (1010 00112 010 (decimal number e. (3C7B)16 12 (16-bit binary number) f. (0100 1011 1000 1110)2-(...