Digital logic and desgin

You are asked to complete the following table by converting the decimal numbers to their

corresponding forms. Use the minimum number of digits, and without using calculators.

Complete the following table with equivalent numbers using conversion techniques (without calculators). Indicate all solution steps for each item.

Using the method of repeatedly dividing by 2, find the equivalent 8-bit signed binary number of each of the following decimal numbers. Include all solution steps.

Consider the three following 2s complement 8-bit signed binary numbers: X = 1000 0011, Y = 1001 0000, and Z = 0101 0001.

It is required to compute the addition F = X + Y and the subtraction E = X Z using only 2s complement binary forms (without any conversion to decimal and without using calculators).

a) Compute F showing your solution steps. Does an overflow occur? b) ComputeEshowingyoursolutionsteps.Doesanoverflowoccur?

Simplify the following functions, and implement them with two-level NAND gate circuits: F(A, B, C) = (A + C + D) (A + C) (C + D)

2 of 3 Question 1 LOL (1 pts.) You are asked to complete the following table by converting the decimal numbers to their corresponding forms. Use the minimum number of digits, and without using calculators Dec Hex Oct Bin 0 1 2 3 + 5 6 7 9 10 11 12 13 14 15 16 Question_02 (1 pts) Complete the following table with equivalent numbers using conversion techniques (without calculators). Indicate all solution steps for each item. Number Binary 10001110000010110011101001000110010 11110000111101110010110110010101 Da (29.375), D10 101101101 (199), Question 03 CLOL (1 pts.) Using the method of repeatedly dividing by 2, find the equivalent 8-bit signed binary number of cach of the following decimal numbers. Include all solution steps. Decimal Number 8-bit Signed Risary Number 8-bit Signed Binary Number S-bit Signed Binary Number in signed-magnitude form lal's complement form in 2's complement form +69 -84 -109 10101000 Question 04 CLON pts.) Consider the three following 2's complement 8-bit signed binary numbers X = 10000011, Y = 1001 0000, and Z 01010001 It is required to compute the addition F - X + Y and the subtraction E - X - Z using only 2's complement binary forms (without any conversion to decimal and without using calculators). .) Compute F showing your solution steps. Does an overflow occur? b) Compute E showing your solution steps. Does an overflow occur? Question 05 CLO24 (1 pts.) Simplify the following functions, and implement them with two-level NAND gate circuits: F(A,B,C)-(N+C+D)(A+C)(C+D") You are asked to complete the following table by converting the decimal numbers to their corresponding forms. Use the minimum number of digits, and without using calculators. Dec Hex Oct Bin 0 1 2 3 4 5 6 7 8 9 10 Complete the following table with equivalent numbers using conversion techniques (without calculators). Indicate all solution steps for each item. Binary 10001110000010110011101001000110010 11110000111101110010110110010101 Number 16 ( ( 8 (29.375) 10 101101101 ( 010 (199)10 Question 03 CL01 (1 pts.) Using the method of repeatedly dividing by 2, find the equivalent 8-bit signed binary number of each of the following decimal numbers. Include all solution steps. Decimal 8-bit Signed Binary Number 8-bit Signed Binary Number 8-bit Signed Binary Number in signed-magnitude form in 1's complement form in 2's complement form Number +69 -84 -109 10101000 Question 04 CLO1 Consider the three following 2's complement 8-bit signed binary numbers: X = 1000 0011, Y = 1001 0000, and Z=0101 0001. It is required to compute the addition F = X + Y and the subtraction E = X - Z complement binary forms (without any conversion to decimal and without using c a) Compute F showing your solution steps. Does an overflow occur? b) Compute E showing your solution steps. Does an overflow occur? Onestion 05 CL) 24 Question 05 CLO 2,4 (1 pt Simplify the following functions, and implement them with two-level NAND gate circuits: F(A, B, C) = (A' + C'+D') (A' + C') (C'+D')