1 / 7

Lynbrook Computer Science

Lynbrook Computer Science. February 23, 2009. Announcements. ACSL – March 9 Digital Electronics – 2 Graph Theory – 2 Boolean Algebra – 1 USACO – March 13-16. Digital Electronics. Logic “Gates” Just Boolean Algebra!. AND. NAND (NOT AND). OR. NOR (NOT OR). XOR (Inequality).

iram
Download Presentation

Lynbrook Computer Science

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Lynbrook Computer Science February 23, 2009

  2. Announcements • ACSL – March 9 • Digital Electronics – 2 • Graph Theory – 2 • Boolean Algebra – 1 • USACO – March 13-16

  3. Digital Electronics • Logic “Gates” • Just Boolean Algebra! AND NAND (NOT AND) OR NOR (NOT OR) XOR (Inequality) XNOR (NOT XOR) (Tests equality) NOT

  4. Try it out • Find all ordered triples that make this circuit true.

  5. Solution • Convert to boolean algebra: (A XOR B) XOR (B OR C) • Truth table: Evaluate each part individually

  6. More challenging • Find all gates (AND/OR/NAND/NOR/XOR/XNOR) that can replace the “X” such that only one tuple makes the circuit true.

  7. Solution

More Related