ECE 198 Lecture Notes - Karnaugh Map, If And Only If, Implicant
4 Jun 2014
School
Department
Course
Professor
Document Summary
Ece 198 worksheet 5: riddles for combinational logic design. Once upon a time a farmer went to market and purchased a fox, a goose, and a bag of beans. On his way home, the farmer needed to cross a river, so he rented a small boat. When crossing the river by boat, the farmer can carry himself and only one of his purchases - the fox, the goose, or the bag of beans. If left alone, the fox will eat the goose. If left alone, the goose will eat the beans. The farmer"s challenge is to get himself and all of his purchases over to the other side of the river without anything getting eaten. Be sure to specify what the variables mean for the values 0 and 1. [hint: you do not need more than 5 variables] E (f,x,g,b) = 1 iff something has not been eaten: create a karnaugh map that indicates which conditions are allowable.
