Practice8_3400 - b) Construct the truth table for this...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
German University in Cairo Faculty of Media Engineering and Technology Prof. Dr. Slim Abdennadher Introduction to Computer Science , Winter Term 2009-2010 Practice Assignment 8 Discussion: 12.12.2009 - 17.12.2009 Exercise 8-1 Given the following truth table, where P,X, and Y are the input variables and S and C are the output variables: P X Y S C 0 0 0 0 0 0 0 1 1 0 0 1 0 1 0 0 1 1 0 1 1 0 0 1 0 1 0 1 0 1 1 1 0 0 1 1 1 1 1 1 a) Using the sum-of-products-algorithm, determine the boolean expressions that correspond to the truth table. Exercise 8-2 Using truth tables, show that: X 0 Y + Y 0 Z + XZ 0 = XY 0 + Y Z 0 + X 0 Z Exercise 8-3 A circuit should be designed to perform the operation ( A - 1) where A represents number in sign/magnitude notation consisting of 2 bits. a) How many output variables are needed? Justify your answer.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: b) Construct the truth table for this circuit. c) Use the sum-of-products algorithm to nd the Boolean expressions that corre-sponds to the truth table. Exercise 8-4 A circuit should be designed to perform the moduls operation of two numbers con-sisting of two bits each. Assume that for any number N , N %0 = 3 . 1 a) How many input and output variables are needed? b) Construct the truth table for this circuit c) Using the sum-of-products method, nd the Boolean expressions that corre-spond to the constructed truth table. 2...
View Full Document

This note was uploaded on 12/22/2009 for the course CSEN 102 taught by Professor Slim during the Spring '09 term at German University in Cairo.

Page1 / 2

Practice8_3400 - b) Construct the truth table for this...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online