{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

MIDf05_ANSWER - ECSE-323 Department of Electrical and...

Info icon This preview shows pages 1–5. Sign up to view the full content.

View Full Document Right Arrow Icon
McGILL UNIVERSITY Department of Electrical and Computer Engineering ECSE-323 Fall 2005 MIDTERM EXAM Question Maximum Points Points Attained 1 10 2 10 3 15 4 15 5 10 6 15 Total 75 points Please write down your name: ANSWER KEY Please write your student ID: ______________________________________ Instructions/Please read carefully! This is a close book quiz. No books or notes are allowed. You may use a standard calculator. All work is to be done on the attached sheets and under no circumstance are booklets or loose sheets to be used. Write your name at the top of every sheet. Read the question carefully. If something appears ambiguous, write down your assumption. The points have been assigned according to the formula that 1 point = 1 exam minute, so please pace yourself accordingly.
Image of page 1

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

View Full Document Right Arrow Icon
Your Name_______________________________________________________ Question 1 :Boolean Logic Theory (10 points) Consider the following circuit (5 points) a) Give the k-map corresponding to F. (5 points) b) Give the minimal two-level NOR-NOR circuit producing F. _________________________________________________________________ ANSWER 2
Image of page 2
Your Name_______________________________________________________ Question 1 :Boolean Logic Theory (10 points) (Continues) b) 3
Image of page 3

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

View Full Document Right Arrow Icon
Your Name_______________________________________________________ Question 2 : Application of Boolean Theory (10 points) The covering table in the Quine-McCluskey method was made equivalent to a Boolean function, called the Petrick function, for the purpose of finding all minimal two-level expressions of a given function. In a similar way, i.e. by means of constructing and simplifying the proper Boolean function, solve the following problem: Five students A,B,C,D,E are planning a trip. Let us define Boolean variables A, B, C, D, E associated with each student. If variable A=1, then student A goes, and if variable A = 0, then student A stays. The same convention applies to variables B, C, D and E. Students must satisfy ALL the following conditions: 1.- Either A or B, or both A and B go on the trip.
Image of page 4
Image of page 5
This is the end of the preview. Sign up to access the rest of the document.
  • Winter '07
  • redacka
  • Boolean Algebra, The Circuit, Boolean function, Name_______________________________________________________ Question

{[ snackBarMessage ]}

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern