DOC PREVIEW
GT ECE 2030 - ECE 2030h, Intro. To Computer Eng., QUIZ 1

This preview shows page 1 out of 3 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 3 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 3 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

Name GT#________ESC2030h Fall ’01 - Quiz 1 p. 1 of 3ECE 2030h, Intro. To Computer Eng., QUIZ 1Quiz No. 1: Sept. 13, 2001Prof. John A. CopelandSchool of Electrical and Computer EngineeringRULES.i This quiz is closed book.ii. Non-programmable calculators may be used.iii Answer all questions and show all work to receive full credit.iv All questions have the same weight. (20 Points). All sub-questions within aquestion are weighted equally.v Please do not ask the proctors any questions during the exam about examquestions. Part of the test is understanding the question as written, without supplementalinformation. If you feel additional data is needed to solve the problem, make (and state) anassumption and then work the problem.Question 1 – Truth Table.Given the Boolean expression: Out = AB + ABC + A’B’Hint – simplify first _______ AB + A’B’___________Complete the truth table.ABCOut00010011010001101000101011011111Name __________________________ESC2030h Fall ’01 - Quiz 1 p. 2Question 2 – CMOS LogicDraw the CMOS transistor diagram for AB + CD. Assume A, A’, B, B’, C, C’,D’ and D’ signals areavailable.Question 3 – Logic Identities Simplify the follow Boolean expressions:A. X(X+Y) X B. X + Y + XZ X + Y C. (X’ + Y’)’ XY D. X + XY X E. XY + YZ + X’Z XY + X’Z (if YZ =1 then Y=1 and Z=1 & XY or X’Z =1) OutA’C’D’''B’B’A’D’C’Name __________________________ESC2030h Fall ’01 - Quiz 1 p. 3Question 4 – Minterm and Maxterm IndicesFor the truth tables below, express the minterm sum of products, and the maxterm product of sums:ABCF00000010010101101000101111001111sum of products ___A’BC’ + AB’C + ABC __________________________product of sums ____(A’+B’+ C’) (A’+B’+ C) (A’+B+ C) (A+B’+ C’) (A+B+ C’)____Draw a Karnaugh Map for the truth table in Question 4. Circle the Prime Implicants with a solid line.Label the Essential prime Implicants with a dashed line. F = AC + A’BC’A \ BC000111100000110110 ACQuestion 5 – Karnaugh Map For the Karnaugh map below, circle the Prime Implicants and labelthe Essential Prime Implicants with “EPI” [all are “Essential” Prime Implicants except A’BC and A’CD].AB \ CD00011110000110011011110001100110Write the reduced logic expression: ____A’D + A’BD’ + BCD’ + (A’BC or A’CD)____maxterm indices (decimal) ____0, 2, 5, 7, 8, 10, 12, 13,


View Full Document

GT ECE 2030 - ECE 2030h, Intro. To Computer Eng., QUIZ 1

Documents in this Course
Load more
Download ECE 2030h, Intro. To Computer Eng., QUIZ 1
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view ECE 2030h, Intro. To Computer Eng., QUIZ 1 and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view ECE 2030h, Intro. To Computer Eng., QUIZ 1 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?