cs281-hw3 - For problems 1~3, use the procedures of K-Map...

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

View Full Document Right Arrow Icon
CS281 Introduction to Computer Architecture Homework 3 Due date: Wednesday, October 1, 2008. Note: Your homework must either be typed or clearly written. I will not grade the homework if it is unreadable. AIM : To understand Karnaugh-Map and Quine-McCluskey (Tabulation) method; to know how to use K-Map and Tabulation method to simplify Boolean functions;
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: For problems 1~3, use the procedures of K-Map we discussed in class to simplify the given functions. 1. F = xz+yz+xz 2. F = wyz+xyz+wyz+xyz 3. F = ) 15 , 14 , 13 , 9 , 8 , 5 , 4 , 1 , ( 4. (Use Tabulation method) F = ) 15 , 13 , 11 , 10 , 5 , 2 , ( 5. (Use Tabulation method) F = wxyz+wxz+xyz+wy...
View Full Document

This note was uploaded on 09/22/2008 for the course CS 281 taught by Professor Tong during the Spring '08 term at University of Missouri-Kansas City .

Ask a homework question - tutors are online