PROBLEM 1: HEXADECIMAL TABLE • Convert 1010101111001101 from unsigned binary to hexadecimal. • Convert 11111110001000010011 from unsigned binary to hexadecimal. • Convert 000101000111 from unsigned binary to hexadecimal. • Convert 0101000101 from unsigned binary to hexadecimal. • Convert 11001101 from unsigned binary to hexadecimal. [Short Answer] Why do we use the hexadecimal notation? What to put in your HW Write-Up: • Answer the five problems above. • Write at least a paragraph (3-5 sentences) in answering the short answer question above. If you use a reference, make sure to list your reference. PROBLEM 2: BOOLEAN ALGEBRA Remember: • The NOT operator has highest priority, followed by AND then OR. • XY means X AND Y, X + Y means X OR Y, X̅ means NOT X Create the truth tables for the below functions; where X, Y, Z equals the binary listed below: F(X, Y, Z) = XY + Z F(X, Y, Z) = Y + Z̅X F(X, Y, Z) = Z + YX̅ F(X, Y, Z) = ZY + X̅ X Y Z 0 1 0 1 1 0 1 1 1 0 0 0 1 1 1 1 0 1 1 0 1 0 0 0 What to put in your HW Write-Up: • Your truth tables for the above 4 problems. PROBLEM 3: LOGIC GATES This is the gate for OR This is the gate for AND This is NOT Draw the circuits for the below functions: F(X, Y, Z) = XY + Z F(X, Y, Z) = Y + Z̅X F(X, Y, Z) = Z + YX̅ F(X, Y, Z) = ZY + X̅ What to put in your HW Write-Up: • Your drawings for the above 4 problems.
PROBLEM 1: HEXADECIMAL TABLE • Convert 1010101111001101 from unsigned binary to hexadecimal. • Convert 11111110001000010011 from unsigned binary to hexadecimal. • Convert 000101000111 from unsigned binary to hexadecimal. • Convert 0101000101 from unsigned binary to hexadecimal. • Convert 11001101 from unsigned binary to hexadecimal. [Short Answer] Why do we use the hexadecimal notation? What to put in your HW Write-Up: • Answer the five problems above. • Write at least a paragraph (3-5 sentences) in answering the short answer question above. If you use a reference, make sure to list your reference. PROBLEM 2: BOOLEAN ALGEBRA Remember: • The NOT operator has highest priority, followed by AND then OR. • XY means X AND Y, X + Y means X OR Y, X̅ means NOT X Create the truth tables for the below functions; where X, Y, Z equals the binary listed below: F(X, Y, Z) = XY + Z F(X, Y, Z) = Y + Z̅X F(X, Y, Z) = Z + YX̅ F(X, Y, Z) = ZY + X̅ X Y Z 0 1 0 1 1 0 1 1 1 0 0 0 1 1 1 1 0 1 1 0 1 0 0 0 What to put in your HW Write-Up: • Your truth tables for the above 4 problems. PROBLEM 3: LOGIC GATES This is the gate for OR This is the gate for AND This is NOT Draw the circuits for the below functions: F(X, Y, Z) = XY + Z F(X, Y, Z) = Y + Z̅X F(X, Y, Z) = Z + YX̅ F(X, Y, Z) = ZY + X̅ What to put in your HW Write-Up: • Your drawings for the above 4 problems.
Hi, as there are multiple problems in this post, as per our policy, I'll answer the first problem. For answer to other questions, please post them separately. Thanks.
We need to convert the below unsigned binary numbers to hexadecimal.
- 1010101111001101
- 11111110001000010011
- 000101000111
- 0101000101
- 11001101
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 1 images