{"id":120,"date":"2013-11-18T11:37:44","date_gmt":"2013-11-18T08:37:44","guid":{"rendered":"http:\/\/www.sjut.org\/math\/?page_id=120"},"modified":"2014-10-21T14:39:18","modified_gmt":"2014-10-21T11:39:18","slug":"mat302","status":"publish","type":"page","link":"http:\/\/www.sjut.org\/math\/index.php\/courselist\/mat302\/","title":{"rendered":"MAT302 Discrete Mathematics"},"content":{"rendered":"<p>This course introduces some of the basic ideas of discrete mathematics, including graph theory, algorithms and their complexity, languages and grammars, and finite state machines. The course assumes familiarity with the foundational concepts of logic and sets, numbers and counting, relations and functions, probability and combinatorics, which have been covered in other courses. The objective is to solidify a foundation for understanding the mathematics of digital computing.<br \/>\n<ul class=\"lcp_catlist\" id=\"lcp_instance_0\"><\/ul><br \/>\nOnline or Downloadable References for the Course:<\/p>\n<ul>\n<li>General Discrete Mathematics\n<ul>\n<li>Chen, WWL. <em><a title=\"Chen Discrete Mathematics Notes\" href=\"http:\/\/rutherglen.science.mq.edu.au\/wchen\/lndmfolder\/lndm.html\" target=\"_blank\">Discrete Mathematics<\/a><\/em> (Compiled Notes). Sydney: Macquarie University, 2008.<\/li>\n<li>Cooper, Christopher. <em><a title=\"DMTH137 Discrete Mathematics\" href=\"http:\/\/web.science.mq.edu.au\/~chris\/notes\/first_discrete.html\" target=\"_blank\">DMTH137 Discrete Mathematics<\/a>.<\/em> Sydney: Macquarie University, 2010.<\/li>\n<li><a title=\"Miquel Lerma at Northwestern\" href=\"http:\/\/www.math.northwestern.edu\/~mlerma\/\" target=\"_blank\">Lerma, Miguel A.<\/a> <em><a title=\"Lerma Note's on Discrete Mathematics\" href=\"http:\/\/www.math.northwestern.edu\/~mlerma\/papers\/discrete_mathematics-2005.pdf\" target=\"_blank\">Notes on Discrete Mathematics<\/a><\/em>. Chicago: Northwestern University, 2005.<\/li>\n<\/ul>\n<\/li>\n<li>Graph Theory\n<ul>\n<li>eBooks\n<ul>\n<li>Bondy, John Adrian and U.S. R. Murty. <em><a title=\"Graph Theory with Applications\" href=\"http:\/\/www.math.jussieu.fr\/~jabondy\/books\/gtwa\/gtwa.html\" target=\"_blank\">Graph Theory with Applications<\/a><\/em>. North Holland, 1976.<\/li>\n<li>Diestel, Reinhard<em>. <a href=\"http:\/\/diestel-graph-theory.com\/basic.html\">Graph Theory<\/a><\/em>, 4th electronic edition (free preview). Springer, 2010.<\/li>\n<li>See Ch 6-7 in <a title=\"Cooper Discrete Math DMTH137\" href=\"http:\/\/web.science.mq.edu.au\/~chris\/notes\/first_discrete.html\" target=\"_blank\">Cooper DMTH137, 2010<\/a> and Ch 17-19 in <a title=\"Chen Discrete Mathematics\" href=\"http:\/\/rutherglen.science.mq.edu.au\/wchen\/lndmfolder\/lndm.html\" target=\"_blank\">Chen, 2008<\/a>.<\/li>\n<\/ul>\n<\/li>\n<li>Tutorials and demonstrations\n<ul>\n<li>Caldwell, Chris K. <a title=\"Graph Theory Tutorials\" href=\"http:\/\/www.utm.edu\/departments\/math\/graph\/\" target=\"_blank\">Graph Theory Tutorials<\/a>. University of Tennesse Martin.<\/li>\n<li>Fredricks, Gary. <a title=\"Sandbox of Simple Graphs\" href=\"http:\/\/gfredericks.com\/sandbox\/graphs\/browse\" target=\"_blank\">Collection of Small Simple Graphs<\/a>.<\/li>\n<li><a title=\"Djikstra's Algorithm\" href=\"http:\/\/optlab-server.sce.carleton.ca\/POAnimations2007\/DijkstrasAlgo.html\" target=\"_blank\">Demonstration of Djikstra&#8217;s shortest path algorithm<\/a>.<\/li>\n<\/ul>\n<\/li>\n<li><a title=\"Glossary of Graph Theory\" href=\"http:\/\/en.wikipedia.org\/wiki\/Glossary_of_graph_theory\" target=\"_blank\">Graph theory glossary<\/a> is a good Wikipedia list of annoted graph theory terminology<\/li>\n<\/ul>\n<\/li>\n<li>Algorithms and their complexity\n<ul>\n<li>Wilf, Herbert S. <em><a title=\"Wilf Algorithms and Complexity\" href=\"http:\/\/www.math.upenn.edu\/~wilf\/AlgComp3.html\" target=\"_blank\">Algorithms and Complexity<\/a><\/em>, 1st Ed. Philadelphia: Herbert S. Wilf, 1994.<\/li>\n<li>&#8220;<a title=\"Wikipedia Big O notation\" href=\"http:\/\/en.wikipedia.org\/wiki\/Big_O_notation\" target=\"_blank\">Big O notation<\/a>,&#8221; <em>Wikipedia, The Free Encyclopedia<\/em>, (accessed January 23, 2012).<\/li>\n<li>&#8220;<a title=\"Wikipedia Analysis of Algorithms\" href=\"http:\/\/en.wikipedia.org\/w\/index.php?title=Analysis_of_algorithms&amp;oldid=468780777\" target=\"_blank\">Analysis of algorithms<\/a>,&#8221; <em>Wikipedia, The Free Encyclopedia,<\/em> (accessed January 23, 2012).<\/li>\n<li>Stanford University Lecture Video: <a href=\"http:\/\/www.academicearth.org\/lectures\/algorithm-analysis\">http:\/\/www.academicearth.org\/lectures\/algorithm-analysis<\/a><\/li>\n<\/ul>\n<\/li>\n<li>Modeling Computation\n<ul>\n<li>Cooper, Christopher. <a title=\"DMTH237 Languages and Machines\" href=\"http:\/\/web.science.mq.edu.au\/~chris\/notes\/second_langmach.html\" target=\"_blank\">DMTH237 Languages and Machines<\/a>. Sydney: Macquarie University, 2009.<\/li>\n<li>See Chapters 5-7 in <a title=\"Chen Discrete Mathematics\" href=\"http:\/\/rutherglen.science.mq.edu.au\/wchen\/lndmfolder\/lndm.html\" target=\"_blank\">Chen, 2008<\/a>.<\/li>\n<\/ul>\n<p>General Discrete Math References<\/p>\n<ul>\n<li>Rosen, Kenneth H., <em>Discrete Mathematics and Its Applications<\/em>, 5th Ed., McGraw-Hill, NY, 2003.<\/li>\n<li>Sarkar, Swapan K., <em>A Textbook of Discrete Mathematics<\/em>, S. Chand &amp; Co. Ltd., New Delhi, 2003.<\/li>\n<li>Johnsonbaugh, Richard, <em>Discrete Mathematics<\/em>, 5th Ed., Pearson Education Asia, New Delhi, 2001.<\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"<p>This course introduces some of the basic ideas of discrete mathematics, including graph theory, algorithms and their complexity, languages and grammars, and finite state machines. The course assumes familiarity with [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":18,"menu_order":0,"comment_status":"open","ping_status":"open","template":"","meta":{"footnotes":""},"categories":[21,20],"_links":{"self":[{"href":"http:\/\/www.sjut.org\/math\/index.php\/wp-json\/wp\/v2\/pages\/120"}],"collection":[{"href":"http:\/\/www.sjut.org\/math\/index.php\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"http:\/\/www.sjut.org\/math\/index.php\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"http:\/\/www.sjut.org\/math\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"http:\/\/www.sjut.org\/math\/index.php\/wp-json\/wp\/v2\/comments?post=120"}],"version-history":[{"count":6,"href":"http:\/\/www.sjut.org\/math\/index.php\/wp-json\/wp\/v2\/pages\/120\/revisions"}],"predecessor-version":[{"id":678,"href":"http:\/\/www.sjut.org\/math\/index.php\/wp-json\/wp\/v2\/pages\/120\/revisions\/678"}],"up":[{"embeddable":true,"href":"http:\/\/www.sjut.org\/math\/index.php\/wp-json\/wp\/v2\/pages\/18"}],"wp:attachment":[{"href":"http:\/\/www.sjut.org\/math\/index.php\/wp-json\/wp\/v2\/media?parent=120"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/www.sjut.org\/math\/index.php\/wp-json\/wp\/v2\/categories?post=120"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}