Transcript
![Page 1: February 23, 2009. Announcements ACSL – March 9 Digital Electronics – 2 Graph Theory – 2 Boolean Algebra – 1 USACO – March 13-16](https://reader035.vdocuments.us/reader035/viewer/2022072114/56649f0b5503460f94c1e92b/html5/thumbnails/1.jpg)
Lynbrook Computer Science
February 23, 2009
![Page 2: February 23, 2009. Announcements ACSL – March 9 Digital Electronics – 2 Graph Theory – 2 Boolean Algebra – 1 USACO – March 13-16](https://reader035.vdocuments.us/reader035/viewer/2022072114/56649f0b5503460f94c1e92b/html5/thumbnails/2.jpg)
AnnouncementsACSL – March 9
Digital Electronics – 2Graph Theory – 2Boolean Algebra – 1
USACO – March 13-16
![Page 3: February 23, 2009. Announcements ACSL – March 9 Digital Electronics – 2 Graph Theory – 2 Boolean Algebra – 1 USACO – March 13-16](https://reader035.vdocuments.us/reader035/viewer/2022072114/56649f0b5503460f94c1e92b/html5/thumbnails/3.jpg)
Digital ElectronicsLogic “Gates”Just Boolean
Algebra!AND NAND (NOT
AND)
OR NOR (NOT OR)
XOR (Inequality)
XNOR (NOT XOR)(Tests equality)
NOT
![Page 4: February 23, 2009. Announcements ACSL – March 9 Digital Electronics – 2 Graph Theory – 2 Boolean Algebra – 1 USACO – March 13-16](https://reader035.vdocuments.us/reader035/viewer/2022072114/56649f0b5503460f94c1e92b/html5/thumbnails/4.jpg)
Try it outFind all ordered triples that make this circuit
true.
![Page 5: February 23, 2009. Announcements ACSL – March 9 Digital Electronics – 2 Graph Theory – 2 Boolean Algebra – 1 USACO – March 13-16](https://reader035.vdocuments.us/reader035/viewer/2022072114/56649f0b5503460f94c1e92b/html5/thumbnails/5.jpg)
SolutionConvert to boolean algebra: (A XOR B) XOR
(B OR C)Truth table: Evaluate each part individually
![Page 6: February 23, 2009. Announcements ACSL – March 9 Digital Electronics – 2 Graph Theory – 2 Boolean Algebra – 1 USACO – March 13-16](https://reader035.vdocuments.us/reader035/viewer/2022072114/56649f0b5503460f94c1e92b/html5/thumbnails/6.jpg)
More challengingFind all gates
(AND/OR/NAND/NOR/XOR/XNOR) that can replace the “X” such that only one tuple makes the circuit true.
![Page 7: February 23, 2009. Announcements ACSL – March 9 Digital Electronics – 2 Graph Theory – 2 Boolean Algebra – 1 USACO – March 13-16](https://reader035.vdocuments.us/reader035/viewer/2022072114/56649f0b5503460f94c1e92b/html5/thumbnails/7.jpg)
Solution