I need the following problems worked out (show work). Thee answers are provided, I just need the work explained briefly for each one.
4 - What is the decimal representation of each of the following unsigned binary integers?
a. 00110101 (53)
b. 10010110 (150)
c. 11001100 (204)
6 - What is the sum of each pair of binary numbers?
a. 10101111 + 11011011 (110001010)
b. 10010111 + 11111111 (110010110)
c. 01110101 + 10101100 (100100001)
8 - How many bits are used by each of the following data types?
a. word (8)
b. doubleword (32)
c. quadword (64)
10 - What is the minimum number of binary bits needed to represent each of the following unsigned decimal integers?
a. 4095 (12)
b. 65534 (16)
c. 42319 (16)
12 - What is the hexadecimal representation of each of the following binary numbers?
a. 0011 0101 1101 1010 (35DA)
b. 1100 1110 1010 0011 (CEA3)
c. 1111 1110 1101 1011 (FEDB)
14 - What is the binary representation of the following hexadecimal numbers?
a. 0126F9D4 (0000 0001 0010 0110 1111 1001 1101 0100)
b. 6ACDFA95 (0110 1010 1100 1101 1111 1010 1001 0101)
c. F69BDC2A (1111 0110 1001 1011 1101 1100 0010 1010)
22 - What is the decimal representation of each of the following signed binary numbers?
a. 10000000 (−128)
b. 11001100 (-52)
c. 10110111 (-73)
24 - What is the 8-bit binary (two's-complement) representation of each of the following signed decimal integers?
a. -72 (10111000)
b. -98 (10011110)
c. -26 (11100110)
26 - What are the hexadecimal and decimal representations of the ascii character capital M?
hexidecimal - 4d
decimal - 77
28 - What is the largest value you can represent using a 256-bit unsigned integer?
(2^256)-1 or two to the two-hundred fifty-sixth power minus one.
4) For this question we will be converting Binary to decimal using the formula = (dn)*(2)n where n is position of binary digit in number
I am attaching images for solution.


I need the following problems worked out (show work). Thee answers are provided, I just need...
3. What is the hexadecimal representation of each of the following binary numbers in signed 2’s complement? 0010 0101 0100 0011 0001 1011 0010 0100 1111 0110 1101 1001
Perform two’s complement addition on the following pairs of numbers. In each case, indicate whether an overflow has occurred. a. 1001 1101 + 1111 1110 b. 0111 1110 + 0110 0111 c. 1000 0011 + 1000 0010 d. 1010 1000 + 0010 1100
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...
We have learned a famous shift cipher called Caesar Cipher. Now if we are given a plain test: THE ART OF WARAnd key = 3 (a shift by 3 letters), please give the ciphertext Given an 8 bit block P = 10101111 and a key K = 01101011, please give the result of bitwise XOR between P and K Please give the left 2 shift of the 8 bit text 01100101 Use the given a permutation table 23614857 to define...
I think you are actually doing binary to hex. please
do this without loops and you can use recursion. please write a
working C code. Thanks
Write a loop-less function to convert from Hex to Binary. (HINT: Use a helper function/recursion) binHex[16] [5] {"0000", "O001","0010","0011","0100" ,"0101", "0110", "0111", "1000", "1001" , "1010", "1011", "1100", "1101", "1110" 1 const char = s char hexToBinary ...) 7
binary conversions. please help. thank you!
Convert the following Binary number to Base 8 4. 1111 1001 0110 0001 1001 0101 1101 1010 1110 0010 0101 Convert the following Base 8 number to binary 5. 200076524, Convert the following Base 8 number to Base 16 6. 1177662231
Unsigned representation vs. 2's complement Order the next two sequences of numbers in ascending order twice. First, assume that the numbers are written in 8-bit unsigned and then in 8-bit 2's complement representation. Remember the different notations for binary, decimal and hexadecimal numbers. 0111 1100, 0101 1010, xDD, xEA x71, x8B, 1001 0110, 0110 1001
Convert each of the following 32 IEEE 754 single precision bit patterns to its corresponding decimal value (the bits are separated into groups of 4 to make interpretation easier). Show all of your work and include a few comments as to what you are doing at each step. 1100 0100 1011 1010 0100 1000 0000 0000 a. b. 0100 0101 1110 0010 0110 1101 0000 0000
Convert each of the following 32 IEEE 754 single precision bit patterns to its...
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...
We want to compute the Checksum of the following four 16-bit words. 1000 0110 0101 1110 1000 1100 0110 1000 0111 1001 0010 0010 1000 1001 1011 1101 Explain the algorithm and implement the checksum computation in a programming language (e.g., C, C++ or Python) with the above input header.