Practice Problem Set #1

Practice Problem Set #1 - for each of the following: (a)...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
ECE 301 – Digital Electronics Practice Problem Set #1 Solutions will be posted on Thursday, March 1, 2012 Do NOT submit this assignment. This assignment will NOT be graded. These are practice problems associated with the material covered in class this past week. These problems are similar to those that I can ask you on the exam. Use these problems to prepare for the exam. The solutions will be posted 2 days after this assignment is posted. Always read the associated sections of the textbook before attempting the homework problems! 1. (a) Plot the following function on a Karnaugh Map. (Do not expand before plotting). F(A,B,C,D) = A'B' + CD' + ABC + A'B'CD' + ABCD' (b) Find the minimum Sum of Products (SOP) expression. (c) Find the minimum Product of Sums (POS) expression. 2. Find the minimum Sum of Products (SOP) and minimum Product of Sums (POS) expressions for each of the following: (a) F(A,B,C,D) = Σ m(0, 2, 3, 4, 7, 8, 14) (b) F(A,B,C,D) = Π M(1, 2, 3, 4, 9, 15) 3. Find the minimum Sum of Products (SOP) and minimum Product of Sums (POS) expressions
Background image of page 1

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

View Full DocumentRight Arrow Icon
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: for each of the following: (a) F(A,B,C,D) = m(0, 2, 6, 9, 13, 14) + d(3, 8, 10) (b) F(A,B,C,D) = M(0, 2, 6, 7, 9, 12, 13) . D(1, 3, 5) 1 of 2 Spring 2012 ECE 301 Digital Electronics 4. Roth & Kinney problem 5.19. 5. Roth & Kinney problem 2.13, part (d). Determine the Boolean expression that represents the given logic circuit. Use Boolean algebra to simplify the Boolean expression Draw the corresponding simplified logic circuit. 6. Roth & Kinney problem 3.13, parts (b) and (c). 7. Roth & Kinney problem 3.25, part (d). 8. Roth & Kinney problem 4.7. 9. Determine the minterm and maxterm expansions for the logic functions given below. Specify the minterm expansion using little-m notation. Specify the maxterm expansion using big-M notation. (a) F(A,B,C,D) = AB + A'CD (b) F(A,B,C,D) = (A + B + D').(A' + C).(C + D) 2 of 2 Spring 2012...
View Full Document

Page1 / 2

Practice Problem Set #1 - for each of the following: (a)...

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online