problem5

pdf

School

University of California, Irvine *

*We aren’t endorsed by this school

Course

31

Subject

Electrical Engineering

Date

Apr 3, 2024

Type

pdf

Pages

4

Uploaded by MegaOctopus3913

Report
Introduction to Digital Systems EECS 31 Suggested Problems Week 5 Some of the problems are from Digital Design and Computer Architecture ARM Edition, chapter two Problem 1 write a Boolean equation in sum-of-products canonical form for each of the truth tables.
Problem 2 write a Boolean equation in sum-of-products canonical form for each of the truth tables. Problem 3 write a Boolean equation in product-of-sums canonical form for each of the truth tables in problem1. Problem 4 write a Boolean equation in product-of-sums canonical form for each of the truth tables in problem2.
Problem 5 Using De Morgan equivalent gates and bubble pushing methods, redraw the circuit in Figure 2.84 so that you can find the Boolean equation by inspection. Write the Boolean equation. Problem 6 Simplify the following Boolean equations using K-map. (a) 𝑌 = ? ̅ ?? + ?? ̅ ̅̅̅̅ + ?? (b) 𝑌 = (? + ? + ?) ̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅ ? + ?? + ? (c) 𝑌 = ???? + ? ̅ ?? ̅ ? + (? ̅ + ?) ̅̅̅̅̅̅̅̅̅̅ ?
Your preview ends here
Eager to read complete document? Join bartleby learn and gain access to the full version
  • Access to all documents
  • Unlimited textbook solutions
  • 24/7 expert homework help
Problem 7 Find a minimal Boolean equation for the functions in Figure 2.85 and 2.86. Remember to take advantage of the don’t care entries. (Use K -map)