# hw1 - CSE140 Spring 2010 Homework#1 CSE140 Homework#1 Due...

This preview shows pages 1–3. Sign up to view the full content.

CSE140 – Spring 2010, Homework #1 CSE140 Homework #1 Due date: You must SHOW ALL STEPS for obtaining the solution. Reporting the correct answer, without showing the work performed at each step will result in getting 0 points for that problem. Problems: 1. Simplify using axioms and theorems of Boolean algebra. State the axioms used. a. F (A, B, C) = A’B’C’+AB’C’+ABC’+ABC+A’B’C+AB’C b. F (A, B) = (A’+B) (A+B) 2. Draw the logic diagram for the Boolean expression. Y= ((A+B’) (B+C)’)’ 3. Give the Boolean equation and the truth table for the given logic diagram. 4. Do the necessary conversions. a. (F23) 16 Decimal b. (1E0) 16 Binary c. (10011111) 2 octal d. (104) 10 Binary e. (300) 10 Hex

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

View Full Document
5. Perform binary addition with the following two’s complement numbers, and check whether these operations will generate an overflow or not using the two methods discussed in the course. a.
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 11/10/2010 for the course CSE 140 taught by Professor Rosing during the Spring '06 term at UCSD.

### Page1 / 3

hw1 - CSE140 Spring 2010 Homework#1 CSE140 Homework#1 Due...

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

View Full Document
Ask a homework question - tutors are online