What is the 2’s complement of 2610? (Type your binary number answer with no spaces or symbols using the 8 bits)

What is the 1’s complement of 2510? (Type your binary number answer with no spaces or symbols using the least number of bits)

What is the 1’s complement of 2610? (Type your binary number answer with no spaces or symbols using the least number of bits)

What is the 1’s complement of 2210? (Type your binary number answer with no spaces or symbols using the 8 bits)

What is the 2’s complement of 2410? (Type your binary number answer with no spaces or symbols using the 8 bits)

What is the 2’s complement of 1510? (Type your binary number answer with no spaces or symbols using the 8 bits)

Type the sum of product (SoP) expression for the following function where every minterm has all the inputs F(x, y, z) = x(y+z) + xy   

Consider the following Boolean function: G(a, b, c, d) = Σ m(0, 1, 3, 4, 5, 10, 11, 14, 15) Draw the proper truth table in order for this Boolean function. What should the output be in your Truth table and the corresponding square in your K-map at each minterm location? Draw and fill the proper k-map(s) (that matches the labels of the truth table and include all values).  Show the proper grouping in your k-map(s) to find the optimal (minimal) SoP Boolean expression. Write the resulting optimal (minimal) SoP Boolean expression. Draw the optimal SoP 2-level circuit and state the name of the 2-level circuit. Redraw the logic circuit as a 2-level logic circuit using NAND gates only. Write the Boolean expression of a 2-level logic circuit using NAND gates only.  

Consider the following Boolean function: G(a, b, c, d) = ∏ M(0, 1, 8, 9, 10, 11, 14) Draw the proper truth table in order for this Boolean function. What should the output be in your Truth table and the corresponding square in your K-map at each maxterm location? Draw and fill the proper k-map(s) (that matches the labels of the truth table and include all values).  Show the proper grouping in your k-map(s) to find the optimal (minimal) PoS Boolean expression. Write the resulting optimal (minimal) PoS Boolean expression. Draw the optimal PoS 2-level circuit and state the name of the 2-level circuit. Redraw the logic circuit as a 2-level logic circuit using NOR gates only. Write the Boolean expression of a 2-level logic circuit using NOR gates only.

What is the 2’s complement of 1810? (Type your binary number answer with no spaces or symbols using the least number of bits)