math questions with booth's algorithm, convert number in binary, logic circuit and logic function questions
Budget: $2 – $8 USD
Need assistants with answering approximately 12 questions within 1 hour.
I. PROBLEM SOLVING. Perform the required operations. Show your solutions. No solutions
1. Convert the following numbers in binary (2’s complement)
a. -123
b. -43
c. -1022
d. -11 2.
2. Perform Booth’s Algorithm for the following:
a. 6 x 4
b. 6 x -4
3. Draw the logic circuit for the following:
a. xy + xy’ + x’z
b. (A + B)(B + C)(C’ + A’)
c. A’B’C’D + AB’C’D + ABC’D + ABCD
4. Given the logic function of F(A, B, C, O) = ∑(1, 3, 5, 9, 10), simplify using K-map
5. Given the logic function of F(A, B, C, D) = ∑m(0, 1, 3, 4, 5, 7, 8, 10, 12, 14, 15)
a. Show the truth table
b. Write the SOP form
c. Simplify by Karnaugh Mapping
I. PROBLEM SOLVING. Perform the required operations. Show your solutions. No solutions
1. Convert the following numbers in binary (2’s complement)
a. -123
b. -43
c. -1022
d. -11 2.
2. Perform Booth’s Algorithm for the following:
a. 6 x 4
b. 6 x -4
3. Draw the logic circuit for the following:
a. xy + xy’ + x’z
b. (A + B)(B + C)(C’ + A’)
c. A’B’C’D + AB’C’D + ABC’D + ABCD
4. Given the logic function of F(A, B, C, O) = ∑(1, 3, 5, 9, 10), simplify using K-map
5. Given the logic function of F(A, B, C, D) = ∑m(0, 1, 3, 4, 5, 7, 8, 10, 12, 14, 15)
a. Show the truth table
b. Write the SOP form
c. Simplify by Karnaugh Mapping