cs2204ex1

# cs2204ex1 - CS2204 DIGITAL LOGIC & STATE MACHINE DESIGN...

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

CS2204 DIGITAL LOGIC & STATE MACHINE DESIGN FALL 2009 Polytechnic Institute of NYU Page 1 of 2 Handout No : 12 October 15, 2009 110 MINUTES OPEN BOOK EXAM I WORK ALL PROBLEMS (25 pts) 1) Consider the following expression : (i) Simplify the expression to obtain the minimal SOP expression by using Switching Algebra as shown in class . (ii) Then, draw the corresponding minimal 2-level AND-OR gate network, by assuming single- rail inputs as shown in class . (30 pts) 2) Consider the following combinational circuit with four inputs and three outputs : (i) Obtain the truth table of the circuit based on the operation table. Use sign extensions to obtain 3 bits of R from 2 bits of K as done in the homework. (ii) Then, obtain the minterm lists of the outputs from the truth table. (iii) Then, obtain the canonical SOP expressions of all three outputs as shown in class . (25 pts) 3) Consider the following 8-bit addition on two 2’s Complement Binary numbers where the first number is shown in Hex coding

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 02/02/2011 for the course CS 2204 taught by Professor Hadimioglu during the Spring '10 term at NYU Poly.

### Page1 / 2

cs2204ex1 - CS2204 DIGITAL LOGIC & STATE MACHINE DESIGN...

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

View Full Document
Ask a homework question - tutors are online