midterm2005 - EECE 256 - Sections 101, 102 &103 - midterm...

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

View Full Document Right Arrow Icon
EECE 256 - Sections 101, 102 &103 - midterm Dr. Panos Nasiopoulos 1 THE UNIVERSITY OF BRITISH COLUMBIA October 27, 2005 EECE 256 – Sections 101, 102 & 103 Student name:__________________________________ S#: ______________________ Midterm – 50 minutes Closed book – No calculators are allowed 1. Simplify the following Boolean function using only Boolean algebra. Show all your work (Do NOT use truth tables or K-Maps for this question). Implement this function using the minimum number of 2-input gates . F = [(D + D’) + A + B]’ + A’BD + CAB + D’A’B + AB’ + ABC’ (20%) – show all your work. Department of Electrical & Computer Engineering
Background image of page 1

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

View Full DocumentRight Arrow Icon
EECE 256 - Sections 101, 102 &103 - midterm Dr. Panos Nasiopoulos 2 2. Design a binary subtractor which can perform the following operations: A +B, A-B, -A+B, -A-B Use Full-Adders and external gates. (30%) - show all your work
Background image of page 2
EECE 256 - Sections 101, 102 &103 - midterm Dr. Panos Nasiopoulos 3 3. You are developing a monitoring system for an automobile to be used for new
Background image of page 3

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

View Full DocumentRight Arrow Icon
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 12/21/2010 for the course EECE 256 taught by Professor Sidney during the Spring '10 term at The University of British Columbia.

Page1 / 4

midterm2005 - EECE 256 - Sections 101, 102 &103 - midterm...

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

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