{"id":714,"date":"2017-11-12T15:17:27","date_gmt":"2017-11-12T15:17:27","guid":{"rendered":"https:\/\/science.sjp.ac.lk\/mat\/?page_id=714"},"modified":"2024-12-19T05:12:49","modified_gmt":"2024-12-19T05:12:49","slug":"discrete-mathematics","status":"publish","type":"page","link":"https:\/\/science.sjp.ac.lk\/mat\/discrete-mathematics\/","title":{"rendered":"Discrete Mathematics"},"content":{"rendered":"<section class=\"wpb-content-wrapper\"><p>[vc_row][vc_column][vc_column_text]<\/p>\n<p style=\"text-align: justify;\"><strong>Course: <\/strong><strong>AMT 223 1.0 Discrete Mathematics<\/strong> <strong>(Compulsory)<\/strong><\/p>\n<p style=\"text-align: justify;\"><strong>\u00a0<\/strong><strong>Course content:\u00a0<\/strong><\/p>\n<p style=\"text-align: justify;\">Tools of Discrete Mathematics: Algorithms, Induction and Recursion; Elementary Counting Techniques:\u00a0 Fundamental principles of counting, Permutations and combinations, Combinatorial problems involving repetitions, The pigeonhole principle; Additional Topics in Combinatorics: Combinatorial identities, Modeling combinatorial problems with recurrence relations, Solving recurrence relations, The inclusion-exclusion principle, Generating functions.<\/p>\n<p style=\"text-align: justify;\"><strong>Recommended Readings:<\/strong><\/p>\n<ol>\n<li>Baker,T.P.,Kandel,A., &amp; Mott,J.L.(1986). Discrete Mathematics for Computer Scientists and Mathematicians (2<sup>nd<\/sup> ed). Pearson Education<\/li>\n<li>Grossman,J.W. (1990). <em>Discrete Mathematics (An Introduction to Concepts, Methods, and Applications) <\/em>(1<sup>st<\/sup> ed). Macmillan Publishing Company.<\/li>\n<\/ol>\n<p><strong>\u00a0<\/strong>[\/vc_column_text][\/vc_column][\/vc_row]<\/p>\n<\/section>","protected":false},"excerpt":{"rendered":"<p>[vc_row][vc_column][vc_column_text] Course: AMT 223 1.0 Discrete Mathematics (Compulsory) \u00a0Course content:\u00a0 Tools of Discrete Mathematics: Algorithms, Induction and Recursion; Elementary Counting Techniques:\u00a0 Fundamental principles of counting, Permutations and combinations, Combinatorial problems involving repetitions, The pigeonhole principle; Additional Topics in Combinatorics: Combinatorial identities, Modeling combinatorial problems with recurrence relations, Solving recurrence relations, The inclusion-exclusion principle, Generating functions. &hellip; <a href=\"https:\/\/science.sjp.ac.lk\/mat\/discrete-mathematics\/\" class=\"more-link\">Continue reading <span class=\"screen-reader-text\">Discrete Mathematics<\/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\/714"}],"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=714"}],"version-history":[{"count":3,"href":"https:\/\/science.sjp.ac.lk\/mat\/wp-json\/wp\/v2\/pages\/714\/revisions"}],"predecessor-version":[{"id":4758,"href":"https:\/\/science.sjp.ac.lk\/mat\/wp-json\/wp\/v2\/pages\/714\/revisions\/4758"}],"wp:attachment":[{"href":"https:\/\/science.sjp.ac.lk\/mat\/wp-json\/wp\/v2\/media?parent=714"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}