{"id":4661,"date":"2024-12-18T18:46:16","date_gmt":"2024-12-18T18:46:16","guid":{"rendered":"https:\/\/science.sjp.ac.lk\/mat\/?page_id=4661"},"modified":"2024-12-18T18:47:03","modified_gmt":"2024-12-18T18:47:03","slug":"mat-315-2-0-boolean-algebra-and-switching-circuits","status":"publish","type":"page","link":"https:\/\/science.sjp.ac.lk\/mat\/mat-315-2-0-boolean-algebra-and-switching-circuits\/","title":{"rendered":"MAT 315 2.0 Boolean Algebra and Switching Circuits"},"content":{"rendered":"<section class=\"wpb-content-wrapper\"><p>[vc_row][vc_column][vc_column_text]<\/p>\n<p><strong>Course:\u00a0\u00a0<\/strong>MAT 315 2.0 Boolean Algebra and Switching Circuits (Optional)<\/p>\n\n<p><strong>Course Content<\/strong>:<\/p>\n\n\n<p class=\"wp-block-heading\" style=\"text-align: justify;\">Preliminaries: Sets and Subsets,Relations.POSETS,Chain,Maximal and Minimal element,Product of two POSETS,Lattices,Properties of Lattice, Definition of Lattice (as Algebra),Semi Lattices,Complete Lattices,Sub Lattices,Modular Lattices,Basic Theorems,Distributive Lattices, Basic Theorems on Distributive lattices, Complemented lattices,Basic Theorems on complemented lattices,Boolean Algebras, Boolean function, Disjunctive Normal Form, \u00a0Conjunctive Normal Form,Switching Circuits<\/p>\n<p style=\"text-align: left;\"><\/p>\n<p style=\"text-align: left;\"><strong>Recommend Readings:<\/strong><\/p>\n\n\n<ol type=\"1\">\n<li style=\"list-style-type: none;\">\n<ol type=\"1\"><\/p>\n<li>Khanna, V. K. (1994). <em>Lattices and Boolean Algebras<\/em> &#8211; first concepts. Modern Printers, Delhi.<\/li>\n\n\n<li>Mendelson, E. <em>Schaum\u2019s Outline of<\/em> <em>theory and problems of Boolean Algebras and <\/em>\u00a0<em>Switching Circuits<\/em>.<\/li>\n\n\n<li>Rutherford, D.E. <em>Introduction to Lattice Theory<\/em>.<\/li>\n<\/ol>\n<\/li>\n<\/ol>\n\n\n<p>&nbsp;<\/p>\n<p>[\/vc_column_text][\/vc_column][\/vc_row]<\/p>\n<\/section>","protected":false},"excerpt":{"rendered":"<p>[vc_row][vc_column][vc_column_text] Course:\u00a0\u00a0MAT 315 2.0 Boolean Algebra and Switching Circuits (Optional) Course Content: Preliminaries: Sets and Subsets,Relations.POSETS,Chain,Maximal and Minimal element,Product of two POSETS,Lattices,Properties of Lattice, Definition of Lattice (as Algebra),Semi Lattices,Complete Lattices,Sub Lattices,Modular Lattices,Basic Theorems,Distributive Lattices, Basic Theorems on Distributive lattices, Complemented lattices,Basic Theorems on complemented lattices,Boolean Algebras, Boolean function, Disjunctive Normal Form, \u00a0Conjunctive Normal Form,Switching &hellip; <a href=\"https:\/\/science.sjp.ac.lk\/mat\/mat-315-2-0-boolean-algebra-and-switching-circuits\/\" class=\"more-link\">Continue reading <span class=\"screen-reader-text\">MAT 315 2.0 Boolean Algebra and Switching Circuits<\/span><\/a><\/p>\n","protected":false},"author":33,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_ti_tpc_template_sync":false,"_ti_tpc_template_id":"","footnotes":""},"_links":{"self":[{"href":"https:\/\/science.sjp.ac.lk\/mat\/wp-json\/wp\/v2\/pages\/4661"}],"collection":[{"href":"https:\/\/science.sjp.ac.lk\/mat\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/science.sjp.ac.lk\/mat\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/science.sjp.ac.lk\/mat\/wp-json\/wp\/v2\/users\/33"}],"replies":[{"embeddable":true,"href":"https:\/\/science.sjp.ac.lk\/mat\/wp-json\/wp\/v2\/comments?post=4661"}],"version-history":[{"count":2,"href":"https:\/\/science.sjp.ac.lk\/mat\/wp-json\/wp\/v2\/pages\/4661\/revisions"}],"predecessor-version":[{"id":4664,"href":"https:\/\/science.sjp.ac.lk\/mat\/wp-json\/wp\/v2\/pages\/4661\/revisions\/4664"}],"wp:attachment":[{"href":"https:\/\/science.sjp.ac.lk\/mat\/wp-json\/wp\/v2\/media?parent=4661"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}