Class Notes (835,937)
Canada (509,515)
CSC258H1 (46)
Lecture

jan18ce.docx

1 Page
122 Views
Unlock Document

Department
Computer Science
Course
CSC258H1
Professor
Steve Engels
Semester
Winter

Description
 Verilog  Karnaught map review – from jan21ce o o K-Maps provide an illustration of a circuit’s minterms (or maxterms)  Week 2 Review and a guide to how neighboring terms may be combined o Q1 express 2 input XOR gate as a combination of NAND / NOT gates 0 0 1 0 1 0 1 1 o K-map example o Q2 What are the mintermsfor the truth table below?  Create a circuit with 4 iniputs (A, B, C, D) and 2 output (X, Y)  The output X is high whenever 2+ of the inputs are high  The ouput Y is high whenever 3+ of the inputs are high A B C D X Y2 0 0 0 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 1 1 1 0 0 1 0 0 1 0 0 1 0 1 0 0 0 1 1 0 1 0 0 1 1 1 1 1 1 0 0 0 0 0 1 0 0 1
More Less

Related notes for CSC258H1

Log In


OR

Join OneClass

Access over 10 million pages of study
documents for 1.3 million courses.

Sign up

Join to view


OR

By registering, I agree to the Terms and Privacy Policies
Already have an account?
Just a few more details

So we can recommend you notes for your school.

Reset Password

Please enter below the email address you registered with and we will send you a link to reset your password.

Add your courses

Get notes from the top students in your class.


Submit