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.

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
100%

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 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 , Ζ)-XY + Ζ
F(X, Y, Z) = Y + Zx
F(X, Y, Z) = Z + YX
F(X, Y, Z) = ZY + X
X
Y
1
1
1
1
1
1
1
1
1
1
1
1
1
NO
Transcribed Image Text: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 , Ζ)-XY + Ζ F(X, Y, Z) = Y + Zx F(X, Y, Z) = Z + YX F(X, Y, Z) = ZY + X X Y 1 1 1 1 1 1 1 1 1 1 1 1 1 NO
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.
Transcribed Image Text: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.
Expert Solution
Step 1

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.

  1. 1010101111001101
  2. 11111110001000010011
  3. 000101000111
  4. 0101000101
  5. 11001101
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 4 steps with 1 images

Blurred answer
Knowledge Booster
Binary numbers
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education