{"id":17401,"date":"2021-11-21T14:13:59","date_gmt":"2021-11-21T14:13:59","guid":{"rendered":"https:\/\/www.inspirenignite.com\/up\/kcs303-discrete-structures-and-theory-of-logic-csiot-3rd-sem-syllabus-for-aktu-b-tech-2021-22-scheme\/"},"modified":"2021-11-21T14:13:59","modified_gmt":"2021-11-21T14:13:59","slug":"kcs303-discrete-structures-and-theory-of-logic-csiot-3rd-sem-syllabus-for-aktu-b-tech-2021-22-scheme","status":"publish","type":"post","link":"https:\/\/www.inspirenignite.com\/up\/kcs303-discrete-structures-and-theory-of-logic-csiot-3rd-sem-syllabus-for-aktu-b-tech-2021-22-scheme\/","title":{"rendered":"KCS303: Discrete Structures and Theory of Logic CSIOT 3rd Sem Syllabus for AKTU B.Tech 2021-22 Scheme"},"content":{"rendered":"

Discrete Structures and Theory of Logic detail syllabus for Computer Science & Internet of Things (CSIOT), 2021-22 scheme is taken from AKTUs<\/a> official website and presented for the AKTU B.Tech students. For the course code (KCS303), exam duration, teaching hr\/week, practical hr\/week, total marks, internal marks, theory marks, duration, credits, and other details do visit complete semester subjects post given below.<\/p>\n

For all other csiot 3rd sem syllabus for aktu b.tech 2021-22 scheme you can visit CSIOT 3rd Sem Syllabus for 2021-22 regulation<\/a>. The detail syllabus for discrete structures and theory of logic is as follows.<\/p>\n

Discrete Structures and Theory of Logic<\/title><\/p>\n<h4>Course Outcomes:<\/h4>\n<p><b>For the complete syllabus, results, class timetable and more kindly <a class=\"rank-math-link\" href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy\" rel=\"nofollow noopener\" target=\"_blank\">download iStudy<\/a>. It’s a lightweight, easy to use, no images, no pdfs platform to make student’s life easier.<\/b><\/p>\n<h4>Unit I<\/h4>\n<p> Set Theory: Introduction, Combination of sets, Multisets, Ordered pairs. Proofs of some general identities on sets. Relations: Definition, Operations on relations, Properties of relations, Composite Relations, Equality of relations, Recursive definition of relation, Order of relations. Functions: Definition, Classification of functions, Operations on functions, Recursively defined functions. Growth of Functions. Natural Numbers: Introduction, Mathematical Induction, Variants of Induction, Induction with Nonzero Base cases. Proof Methods, Proof by counter – example, Proof by contradiction.<\/p>\n<h4>Unit II<\/h4>\n<p><b>For the complete syllabus, results, class timetable and more kindly <a class=\"rank-math-link\" href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy\" rel=\"nofollow noopener\" target=\"_blank\">download iStudy<\/a>. It’s a lightweight, easy to use, no images, no pdfs platform to make student’s life easier.<\/b><\/p>\n<h4>Unit III<\/h4>\n<p> Lattices: Definition, Properties of lattices – Bounded, Complemented, Modular and Complete lattice. Boolean Algebra: Introduction, Axioms and Theorems of Boolean algebra, Algebraic manipulation of Boolean expressions. Simplification of Boolean Functions, Karnaugh maps, Logic gates, Digital circuits and Boolean algebra.<\/p>\n<h4>Unit IV<\/h4>\n<p><b>For the complete syllabus, results, class timetable and more kindly <a class=\"rank-math-link\" href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy\" rel=\"nofollow noopener\" target=\"_blank\">download iStudy<\/a>. It’s a lightweight, easy to use, no images, no pdfs platform to make student’s life easier.<\/b><\/p>\n<h4>Unit V<\/h4>\n<p> Trees: Definition, Binary tree, Binary tree traversal, Binary search tree. Graphs: Definition and terminology, Representation of graphs, Multigraphs, Bipartite graphs, Planar graphs, Isomorphism and Homeomorphism of graphs, Euler and Hamiltonian paths, Graph coloring, Recurrence Relation & Generating function: Recursive definition of functions, Recursive algorithms, Method of solving recurrences. Combinatorics: Introduction, Counting Techniques, Pigeonhole Principle<\/p>\n<h4>Text Books:<\/h4>\n<ol>\n<li>Koshy, Discrete Structures, Elsevier Pub. 2008 Kenneth H. Rosen, Discrete Mathematics and Its Applications, 6\/e, McGraw-Hill, 2006.<\/li>\n<li>B. Kolman, R.C. Busby, and S.C. Ross, Discrete Mathematical Structures, 5\/e, Prentice Hall, 2004.<\/li>\n<li>E.R. Scheinerman, Mathematics: A Discrete Introduction, Brooks\/Cole, 2000.<\/li>\n<li>R.P. Grimaldi, Discrete and Combinatorial Mathematics, 5\/e, Addison Wesley, 2004<\/li>\n<li>Liptschutz, Seymour, ‘ Discrete Mathematics’, McGraw Hill.<\/li>\n<li>Trembley, J.P & R. Manohar, ‘Discrete Mathematical Structure with Application to Computer Science’, McGraw Hill. 4. Deo, 7.Narsingh, ‘Graph Theory With application to Engineering and Computer.Science.’, PHI.<\/li>\n<li>Krishnamurthy, V., ‘Combinatorics Theory & Application’, East-West Press Pvt. Ltd., New Delhi<\/li>\n<\/ol>\n<p align=\"justify\">For detail syllabus of all other subjects of B.Tech CSIOT, 2021-22 scheme do visit <a class=\"rank-math-link\" href=\"..\/category\/csiot+3rd-sem\">CSIOT 3rd Sem syllabus for 2021-22 scheme<\/a>.<\/p>\n<p id=\"istudy\" style=\"text-align:center\">For the complete syllabus, results, class timetable, and many other features kindly download the <a class=\"rank-math-link\" href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy\" rel=\"nofollow noopener\" target=\"_blank\">iStudy App<\/a><br \/><b> It is a lightweight, easy to use, no images, and no pdfs platform to make students’s lives easier.<\/b><br \/><a class=\"rank-math-link\" href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy&pcampaignid=pcampaignidMKT-Other-global-all-co-prtnr-py-PartBadge-Mar2515-1\" rel=\"nofollow noopener\" target=\"_blank\"><img decoding=\"async\" src=\"https:\/\/play.google.com\/intl\/en_us\/badges\/static\/images\/badges\/en_badge_web_generic.png\" alt=\"Get it on Google Play\" style=\"height:65px\"><\/a><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Discrete Structures and Theory of Logic detail syllabus for Computer Science & Internet of Things (CSIOT), 2021-22 scheme is taken from AKTUs official website and presented for the AKTU B.Tech […]<\/p>\n","protected":false},"author":2300,"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":[38,115],"tags":[],"class_list":["post-17401","post","type-post","status-publish","format-standard","hentry","category-3rd-sem","category-csiot"],"_links":{"self":[{"href":"https:\/\/www.inspirenignite.com\/up\/wp-json\/wp\/v2\/posts\/17401","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.inspirenignite.com\/up\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.inspirenignite.com\/up\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.inspirenignite.com\/up\/wp-json\/wp\/v2\/users\/2300"}],"replies":[{"embeddable":true,"href":"https:\/\/www.inspirenignite.com\/up\/wp-json\/wp\/v2\/comments?post=17401"}],"version-history":[{"count":0,"href":"https:\/\/www.inspirenignite.com\/up\/wp-json\/wp\/v2\/posts\/17401\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.inspirenignite.com\/up\/wp-json\/wp\/v2\/media?parent=17401"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/up\/wp-json\/wp\/v2\/categories?post=17401"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/up\/wp-json\/wp\/v2\/tags?post=17401"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}