Engineering Homework Help

I need help with an engineering project from my Computer Engineering 101 Highschool class. We have learned: binary, 1st law, 2nd law, nodes, equation solving for nodes, circuits, k-maps, binary chart to K-map to simplest form equations (ex: yz”x+ywx) in which this project will have AT MOST 10 QUESTIONS on. Please also review the notes taken below for the topic we are being asked in the project. I will send the questions at 11:00am Eastern US time today.

Once I send the questions you have 45 minutes to complete them. Since that’s the time limit I have to finish it. ALL WORK MUST BE WRITTEN OUT ON PAPER OR GRAPHED ON A DOC.

*THESE ARE NOT THE QUESTIONS*

*I NEED HELP WITH*

Example questions from my last project:

1. (6 pts) Convert the following unsigned binary number to the indicated number base.

(a) (1111010.101)₂ to hexadecimal

(b) (101101.01)₂ to decimal

2. (8 pts) Add the following set of numbers, (0110010)₂ + (37)₁₀ + (2AF)₁₆ = ( )₁₆. Express your answer in the based that is indicated.

3. (9 pts) Convert the following decimal numbers to 1 Byte (8-bit) 2’s complements.

a. 15

b. -32

c. -51

4. You are given the following Boolean expression, xy + (x’ + y + z’)’

a. (8 pts) Construct a truth table.

b. (8 pts) Reduce the Boolean expression as much as possible using Boolean algebra.

c. (5 pts) Use the Karnaugh map (K-map) method to simplify the Boolean expression and draw the circuit diagram.

5. (6 pts) Find the simplest Boolean function using K-map.