Homework 1 Problems - Computer Organization | CPSC 2105, Assignments of Computer Architecture and Organization

Material Type: Assignment; Class: Computer Organization; Subject: Computer Science; University: Columbus State University; Term: Spring 2005;

Typology: Assignments

Pre 2010

Uploaded on 08/04/2009

koofers-user-8iw
koofers-user-8iw 🇺🇸

10 documents

1 / 1

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
CPSC 3115 Homework Due Thursday, February 17, 2005
SHOW ALL OF YOUR WORK. DO NOT PLACE ANSWERS ON THIS SHEET.
1. How many Boolean terms are logically adjacent to the following sum term over
four variables? List all of the terms that are adjacent.
In the next two problems, we use hexadecimal notation.
A = 1010 B = 1011 C = 1100
D = 1101 E = 1110 F = 1111
2. Using K-Maps for SOP (Sum-of-Products), simplify the following Boolean
expressions over four variables.
a) F(W, X, Y, Z) = (5, 7, D, F)
b) F(W, X, Y, Z) = (0, 1, 2, 3, 4, 5, 6, 7,8, 9, C, D)
-- Convert this to SOP first.
3. Using K-Maps for POS (Product-of-Sums), simplify the following Boolean
expression
a) F(W, X, Y, Z) = (5, 7, D, F) -- Convert this to POS first.
b) F(W, X, Y, Z) = (5, 6, 7, 9, A, B, D, E, F)

Partial preview of the text

Download Homework 1 Problems - Computer Organization | CPSC 2105 and more Assignments Computer Architecture and Organization in PDF only on Docsity!

CPSC 3115 Homework Due Thursday, February 17, 2005

SHOW ALL OF YOUR WORK. DO NOT PLACE ANSWERS ON THIS SHEET.

  1. How many Boolean terms are logically adjacent to the following sum term over four variables? List all of the terms that are adjacent. In the next two problems, we use hexadecimal notation. A = 1010 B = 1011 C = 1100 D = 1101 E = 1110 F = 1111
  2. Using K-Maps for SOP (Sum-of-Products), simplify the following Boolean expressions over four variables.

a) F(W, X, Y, Z) = (5, 7, D, F)

b) F(W, X, Y, Z) = (0, 1, 2, 3, 4, 5, 6, 7,8, 9, C, D)

-- Convert this to SOP first.

  1. Using K-Maps for POS (Product-of-Sums), simplify the following Boolean expression

a) F(W, X, Y, Z) = (5, 7, D, F) -- Convert this to POS first.

b) F(W, X, Y, Z) = (5, 6, 7, 9, A, B, D, E, F)