Prepare for your exams
Get points
Guidelines and tips

Prepare for your exams

Study with the several resources on Docsity

Earn points to download

Earn points by helping other students or get them with a premium plan

Guidelines and tips

Sell on Docsity

Prepare for your exams

Study with the several resources on Docsity

Find documents

Prepare for your exams with the study notes shared by other students like you on Docsity

Search Store documents

The best documents sold by students who completed their studies

Search through all study resources

Docsity AINEW

Summarize your documents, ask them questions, convert them into quizzes and concept maps

Explore questions

Clear up your doubts by reading the answers to questions asked by your fellow students

Earn points to download

Earn points by helping other students or get them with a premium plan

Share documents

20 Points

For each uploaded document

Answer questions

5 Points

For each given answer (max 1 per day)

All the ways to get free points

Get points immediately

Choose a premium plan with all the points you need

Study Opportunities

Search for study opportunitiesNEW

Connect with the world's best universities and choose your course of study

Community

Ask the community

Ask the community for help and clear up your study doubts

University Rankings

Discover the best universities in your country according to Docsity users

Free resources

Our save-the-student-ebooks!

Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors

From our blog

Exams and Study

Go to the blog

CS 266: Computer Architecture I - Homework 3 Solutions - Prof. Mitchell D. Theys, Study notes of Computer Architecture and Organization

University of Illinois - Chicago Computer Architecture and Organization

Prof. Mitchell D. Theys

The solutions to homework 3 of the computer architecture i course offered by the university of illinois at chicago in spring 2012. The homework includes optimizing boolean functions using k-map, optimizing boolean functions with don't-care conditions, and implementing logic functions using gates.

Typology: Study notes

2011/2012

Uploaded on 12/16/2012

billyking100 🇺🇸

(2)

39 documents

1 / 4

Partial preview of the text

Download CS 266: Computer Architecture I - Homework 3 Solutions - Prof. Mitchell D. Theys and more Study notes Computer Architecture and Organization in PDF only on Docsity! University of Illinois at Chicago CS 266: Computer Architecture I Spring 2012 Homework 3 Solutions Question 1 Optimize the following Boolean functions by means of K-map: 1. [10] , , = 0, 2, 6, 7 , , = ̅̅ + 2. [10] , , = 3, 5,6,7 , , = + + 3. [10] , , = 1,3,5,7 , , = 4. [10] , , , = 4,6,7,15 , , , = ̅ + AB CD 00 01 1 1 11 10 1 1 00 01 11 10 0 0 1 00 01 1 1 11 10 1 1 0 0 1 00 01 1 1 1 11 10 1 0 0 1 00 01 1 1 1 11 10 1 5. [10] , , , = 2,3,12,13,14,15 , , , = ̅ + 6. [10] , , , = 0,1,4,5,6,7,8,9 , , , = ̅ + Question 2 Optimize the following Boolean function F together with the don't-care condition d in sum of products. 1. [10] , , , = 2,9,13,15 , , , = 10,11,12,14 , , , = + 2. [10] , , , = 1,3,8,10,15 00 01 X 1 11 10 1 X 1 X 00 01 11 10 1 X 00 01 1 1 11 10 00 01 11 10 1 1 1 1 1 1 00 01 1 1 11 10 00 01 11 10 1 1 1 1

Documents

questions

CS 266: Computer Architecture I - Homework 3 Solutions - Prof. Mitchell D. Theys, Study notes of Computer Architecture and Organization

Related documents

Partial preview of the text