0116-notes

0116-notes - CPSC 121 Lecture 6 January 16, 2009 Menu...

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

View Full Document Right Arrow Icon
CPSC 121 Lecture 6 January 16, 2009 Menu January 16, 2009 Topics: Example: 7 Segment LED Display (cont’d) Canonical Forms — Disjunctive Normal Form (DNF) — Conjunctive Normal Form (CNF) Reading: Today: Epp 1.3 Next week: Epp 2.1, 2.3 Reminders: Assignment 1 due Friday, January 30, 17:00 READ the WebCT Vista course announcements board WebCT Vista: http://www.vista.ubc.ca www: http://www.ugrad.cs.ubc.ca/~cs121/ Disjunctive Normal Form (DNF) A canonical representation for a logical formula, P , as a disjunction of clauses, Q i , i = 1 , 2 ,...,m , each of which is itself a conjunction. That is, P = Q 1 Q 2 ... Q m where each clause, Q i , is of the form q 1 q 2 ... q n and where each q i is a literal (i.e., a propositional variable or the negation of a propositional variable) Disjunctive Normal Form (DNF) is useful to determine a logical formula corresponding to a given truth table (based on rows in the table that are T ) Example 1: Consider the following truth table:
Background image of page 1

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

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

Page1 / 3

0116-notes - CPSC 121 Lecture 6 January 16, 2009 Menu...

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

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