{"id":19189,"date":"2019-12-10T05:46:03","date_gmt":"2019-12-10T05:46:03","guid":{"rendered":"https:\/\/www.inspirenignite.com\/anna-university\/discrete-mathematics-it-3rd-sem-syllabus-for-be-2017-regulation-anna-univ\/"},"modified":"2019-12-10T05:46:03","modified_gmt":"2019-12-10T05:46:03","slug":"discrete-mathematics-it-3rd-sem-syllabus-for-be-2017-regulation-anna-univ","status":"publish","type":"post","link":"https:\/\/www.inspirenignite.com\/anna-university\/discrete-mathematics-it-3rd-sem-syllabus-for-be-2017-regulation-anna-univ\/","title":{"rendered":"Discrete Mathematics It 3rd Sem Syllabus for BE 2017 Regulation Anna Univ"},"content":{"rendered":"<p>Discrete Mathematics detail syllabus for Information Technology (It), 2017 regulation is taken from <a href=\"https:\/\/www.annauniv.edu\/\" target=\"_blank\" rel=\"noopener\">Anna University<\/a> official website and presented for students of Anna University. The details of the course are: course code (MA8351), Category (BS), Contact Periods\/week (4), Teaching hours\/week (4), Practical Hours\/week (0). The total course credits are given in combined syllabus.<\/p>\n<p>For all other it 3rd sem syllabus for be 2017 regulation anna univ you can visit <a href=\"..\/it-3rd-sem-syllabus-for-be-2017-regulation-anna-univ\">It 3rd Sem syllabus for BE 2017 regulation Anna Univ Subjects<\/a>. The detail syllabus for discrete mathematics is as follows.&#8221;<\/p>\n<p><h4>Course Objective:<\/h4>\n<ul>\n<li>To extend students logical and mathematical maturity and ability to deal with abstraction.<\/li>\n<li>To introduce most of the basic terminologies used in computer science courses and application of ideas to solve practical problems.<\/li>\n<li>To understand the basic concepts of combinatorics and graph theory.<\/li>\n<li>To familiarize the applications of algebraic structures.<\/li>\n<li>To understand the concepts and significance of lattices and boolean algebra which are widely used in computer science and engineering.<\/li>\n<\/ul>\n<p><h4>Unit I<\/h4>\n<p>For complete syllabus and results, class timetable and more pls <a href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy\" target=\"_blank\" rel=\"noopener\">download iStudy<\/a>. Its a light weight, easy to use, no images, no pdfs platform to make students life easier.<\/p>\n<p><h4>Unit II<\/h4>\n<p><strong> Combinatorics<\/strong><br \/>\nMathematical induction &#8211; Strong induction and well ordering &#8211; The basics of counting &#8211; The pigeonhole principle &#8211; Permutations and combinations &#8211; Recurrence relations &#8211; Solving linear recurrence relations &#8211; Generating functions &#8211; Inclusion and exclusion principle and its applications\n<\/p>\n<p><h4>Unit III<\/h4>\n<p><strong> Graphs<\/strong><br \/>\nGraphs and graph models &#8211; Graph terminology and special types of graphs &#8211; Matrix representation of graphs and graph isomorphism &#8211; Connectivity &#8211; Euler and Hamilton paths.\n<\/p>\n<p><h4>Unit IV<\/h4>\n<p>For complete syllabus and results, class timetable and more pls <a href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy\" target=\"_blank\" rel=\"noopener\">download iStudy<\/a>. Its a light weight, easy to use, no images, no pdfs platform to make students life easier.<\/p>\n<p><h4>Unit V<\/h4>\n<p><strong> Lattices and Boolean Algebra<\/strong><br \/>\nPartial ordering &#8211; Posets &#8211; Lattices as posets &#8211; Properties of lattices &#8211; Lattices as algebraic systems -Sub lattices &#8211; Direct product and homomorphism &#8211; Some special lattices &#8211; Boolean algebra.\n<\/p>\n<p><h4>Course Outcome:<\/h4>\n<p>At the end of the course, students would:<\/p>\n<ul>\n<li>Have knowledge of the concepts needed to test the logic of a program.<\/li>\n<li>Have an understanding in identifying structures on many levels.<\/li>\n<li>Be aware of a class of functions which transform a finite set into another finite set which relates to input and output functions in computer science.<\/li>\n<li>Be aware of the counting principles.<\/li>\n<li>Be exposed to concepts and properties of algebraic structures such as groups, rings and fields.<\/li>\n<\/ul>\n<p><h4>Text Books:<\/h4>\n<ol>\n<li>Rosen, K.H., &#8220;Discrete Mathematics and its Applications&#8221;, 7th Edition, Tata McGraw Hill Pub. Co. Ltd., New Delhi, Special Indian Edition, 2011.<\/li>\n<li>Tremblay, J.P. and Manohar.R, &#8221; Discrete Mathematical Structures with Applications to Computer Science&#8221;, Tata McGraw Hill Pub. Co. Ltd, New Delhi, 30th Reprint, 2011.<\/li>\n<\/ol>\n<p><h4>References:<\/h4>\n<ol>\n<li>Grimaldi, R.P. &#8220;Discrete and Combinatorial Mathematics: An Applied Introduction&#8221;, 4th Edition, Pearson Education Asia, Delhi, 2007.<\/li>\n<li>Lipschutz, S. and Mark Lipson., &#8220;Discrete Mathematics&#8221;, Schaums Outlines, Tata McGraw Hill Pub. Co. Ltd., New Delhi, 3rd Edition, 2010.<\/li>\n<li>Koshy, T. &#8220;Discrete Mathematics with Applications&#8221;, Elsevier Publications, 2006.<\/li>\n<\/li>\n<\/ol>\n<p>For detail syllabus of all other subjects of BE It, 2017 regulation do visit <a href=\"..\/category\/it+3rd-sem\">It 3rd Sem syllabus for 2017 Regulation<\/a>.<\/p>\n<p>Dont forget to <a href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy\" target=\"_blank\" rel=\"noopener\">download iStudy<\/a> for latest syllabus and results, class timetable and more.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Discrete Mathematics detail syllabus for Information Technology (It), 2017 regulation is taken from Anna University official website and presented for students of Anna University. The details of the course are: [&hellip;]<\/p>\n","protected":false},"author":2297,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_bbp_topic_count":0,"_bbp_reply_count":0,"_bbp_total_topic_count":0,"_bbp_total_reply_count":0,"_bbp_voice_count":0,"_bbp_anonymous_reply_count":0,"_bbp_topic_count_hidden":0,"_bbp_reply_count_hidden":0,"_bbp_forum_subforum_count":0,"footnotes":""},"categories":[46,72],"tags":[],"class_list":["post-19189","post","type-post","status-publish","format-standard","hentry","category-3rd-sem","category-it"],"_links":{"self":[{"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/posts\/19189","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/users\/2297"}],"replies":[{"embeddable":true,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/comments?post=19189"}],"version-history":[{"count":0,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/posts\/19189\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/media?parent=19189"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/categories?post=19189"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/tags?post=19189"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}