{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

# HW5 - Ryan Zanski ECE 2504 Introduction to Computer...

This preview shows pages 1–3. Sign up to view the full content.

Ryan Zanski ECE 2504 Introduction to Computer Engineering, Summer I 2010 Homework 5 Due date: 7 Jun 10, 11:55pm Show all work. Use LogicWorks to draw circuit diagrams. 1. (20 pts) Determine the minimal SOP and POS forms for the following Boolean expressions using Karnaugh maps. a. f(a,b,c) = ab'c + a'bc + a'b'c + abc' b. g(a,b,c,d) = (a+b'+c+d)(a'+b'+c'+d)(a'+b+c+d)(a+b'+c'+d)(a+b+c+d) =(a’bc’d’)’(abcd’)’(ab’c’d’)’(a’bcd’)’(a’b’c’d’)’ = ((a’bc’d’)+(abcd’)+(ab’c’d’)+(a’bcd’)+ (a’b’c’d’))’ c. h(w,x,y,z) = wx'y'z' + w'xy'z + wx'yz' + wxy'z' + wx'y'z + w'xy'z' 1

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
2. (15 pts) Determine a minimal SOP and POS expression for the following Boolean functions together with the don’t care conditions d using a four variable map. Note that don’t care conditions can be set to one value for the SOP solution and the other for the POS solution. a. F(w,x,y,z) =
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 10

HW5 - Ryan Zanski ECE 2504 Introduction to Computer...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online