CSC270 Homework 4 2016

From dftwiki3
Revision as of 11:51, 16 February 2016 by Thiebaut (talk | contribs) (Problem 1)
Jump to: navigation, search

--D. Thiebaut (talk) 10:50, 16 February 2016 (EST)


Problem 1


  • Using as few additional gates as possible, implement the function f(A, B, C, D) whose Karnaugh map is shown below, on the left, using th e multiplexer shown on the right.


MuxExercise1.png


  • Using as few additional gates as possible, implement the function g(A, B, C, D) whose Karnaugh map is shown below, on the left, using th e multiplexer shown on the right.


MuxExercise2.png