# HW9 - . Problems 5, 6, 7, and 8: Use Karnaugh maps to...

This preview shows page 1. Sign up to view the full content.

Sheet1 Page 1 CS2603 Applied Logic Homework 9 Due Apr 1, 3:00pm (bring your paper to class, and turn it in there) Late Homework will be not accepted Problem 1: Prove the commutative law of set-intersection. Problem 2: Prove the associative law of set-union. Problem 3: Prove that the difference between two sets is the intersection of one with the complement of the other. Figure out w Problem 4: Prove that intersection distributes over union.
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: . Problems 5, 6, 7, and 8: Use Karnaugh maps to minimize the sum-of-products representation of the following Boolean functio n abcd C H L M 0000 0 0 0 0 0001 0 0 1 0 0010 0 1 0 1 0011 0 1 1 1 0100 0 0 1 0 0101 0 1 0 1 0110 0 1 1 1 0111 1 0 0 0 1000 0 1 0 1 1001 0 1 1 1 1010 1 0 0 x 1011 1 0 1 0 1100 0 1 1 1 1101 1 0 0 0 1110 1 0 1 x 1111 1 0 0 0...
View Full Document

## This homework help was uploaded on 04/08/2008 for the course CS 2603 taught by Professor Rexpage during the Spring '08 term at The University of Oklahoma.

Ask a homework question - tutors are online