Scribd
Upload
4 views8 pages

ECE Homework 5: Binary & Boolean Problems

This document is a homework assignment for an Introduction to Electrical and Computer Engineering course for Semester 1 (2024-2025). It includes various problems related to binary and hexadecimal conversions, truth tables, Boolean functions, circuit implementations, and algebraic manipulations. Each problem requires students to demonstrate their understanding of fundamental concepts in digital logic design and Boolean algebra.

Uploaded by

cokhaitruong
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
4 views8 pages

ECE Homework 5: Binary & Boolean Problems

This document is a homework assignment for an Introduction to Electrical and Computer Engineering course for Semester 1 (2024-2025). It includes various problems related to binary and hexadecimal conversions, truth tables, Boolean functions, circuit implementations, and algebraic manipulations. Each problem requires students to demonstrate their understanding of fundamental concepts in digital logic design and Boolean algebra.

Uploaded by

cokhaitruong
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

INTRO TO ECE – HW Assignment 5

Semester 1 (2024−2025)

Student’s Name: Signature:


Student ID Number:
Problem 1. Convert to binary and then to hexadecimal

a. 12310

b. 160310

c. 757.2510

Problem 2. Convert 3C0A16 to decimal

a. From binary

b. From Hexa

1
Problem 3. Convert 1101000111012 to hexa

a. From binary

b. From decimal

Problem 4. Find radix r such that

241r = 618

Problem 5. Find X and Y such that

3X2Y4 = 222003

2
Problem 6. Find the truth table for F

Problem 7. Find the truth table for F

3
Problem 8. For the Boolean functions E and F, as given in the following truth table:

a. Express E and F in sum-of-minterms (Canonical S.O.P) algebraic form.

b. Simplify E and F to expressions with a minimum of connections.

4
Problem 9. Implement the following Boolean function with exclusive-OR and AND
gates, using a minimum number of gate inputs:
̅ 𝑫 + 𝑨𝑫
𝑭(𝑨, 𝑩, 𝑪, 𝑫) = 𝑨𝑩𝑪 ̅ +𝑨
̅𝑫

Problem 10. Draw a circuit to realize the function:


̅ 𝑩𝑪 + 𝑨𝑩
𝑭(𝑨, 𝑩, 𝑪) = 𝑨𝑩𝑪 + 𝑨 ̅ 𝑪 + 𝑨𝑩𝑪
̅

a. Using one OR gate and three AND gates. The AND gates should have two inputs.

5
b. Using two OR gates and two AND gates. All of the gates should have two inputs.

c. Using NAND gates only.

d. Using NAND gates only. All of the NAND gates should have two inputs.

6
Problem 11. Prove the identity of each of the following Boolean equations, using algebraic
manipulation
̅ 𝒁 + 𝒀𝒁 = 𝑿𝒀 + 𝑿
a. 𝑿𝒀 + 𝑿 ̅𝒁

̅∙𝒀
b. 𝑿 ̅+𝑿
̅ 𝒀 + 𝑿𝒀 = 𝑿
̅+𝒀

̅𝑩 + 𝑩
c. 𝑨 ̅∙𝑪
̅ + 𝑨𝑩 + 𝑩
̅𝑪 = 𝟏

̅ 𝒁 + 𝑿𝒀
d. 𝒀 + 𝑿 ̅ = 𝑿+𝒀+𝒁

7
̅∙𝒀
e. 𝑿 ̅+𝒀
̅ 𝒁 + 𝑿𝒁 + 𝑿𝒀 + 𝒀𝒁
̅=𝑿
̅ ∙𝒀
̅ + 𝑿𝒁 + 𝒀𝒁
̅

̅+𝑨
f. 𝑨𝑫 ̅𝑩 + 𝑪
̅𝑫 + 𝑩
̅ 𝑪 = (𝑨
̅+𝑩
̅+𝑪
̅+𝑫
̅ )(𝑨 + 𝑩 + 𝑪 + 𝑫)

Problem 12. Given that 𝐀 ∙ 𝐁 = 𝟎 and 𝐀 + 𝐁 = 𝟏, use algebraic manipulation to prove that
̅ + 𝑩)(𝑩 + 𝑪) = 𝑩𝑪
(𝑨 + 𝑪)(𝑨

You might also like