CSE140 hw1

CSE140 hw1 - 4. Divide the following binary numbers using...

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

View Full Document Right Arrow Icon
CSE140 – Winter 2010, Homework #1 CSE140 Homework #1 Due date: Tuesday, 1/12/10 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. 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) 10110 + 01010 b) 10011110 + 10110010 2. Perform binary subtractions 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) 1101 – 1010 b) 010101 – 101011 3. Perform binary multiplication with the following binary numbers using the method shown in class. a) 01001 x 10110 b) 1110 x 1101
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: 4. Divide the following binary numbers using the method shown in class. a) 10010 / 1110 b) 1011100 / 11011 5. Prove the following Boolean equation using axioms/theorems of Boolean algebra; list what axiom you used. a) X + (X + Y’)’ = X + Y b) XY + Y’Z = (X + Y’) (X + Z) (Y + Z) 6. Draw the schematic of the following function using NAND gates only XY + XZ’ 7. What is the Boolean function of the following circuit? A, B and C are inputs and Z is the output 8. Show the necessary changes in the wiring of the circuit of Problem 7 in order to change its function to Z = ((A + B) C)’. (No additional transistors can be added) 9. Draw the transistor level diagram of a circuit realizing the following function. Argue why your design is efficient in terms of number of transistors that are used. F(A, B, C, D) = ((AB + C) D)’...
View Full Document

This note was uploaded on 04/15/2010 for the course CSE CSE140 taught by Professor Rosing during the Winter '10 term at UCSD.

Page1 / 2

CSE140 hw1 - 4. Divide the following binary numbers using...

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