{"id":4449,"date":"2020-02-08T05:59:51","date_gmt":"2020-02-08T05:59:51","guid":{"rendered":"https:\/\/www.inspirenignite.com\/up\/discrete-structures-theory-of-logic-cse-3rd-sem-syllabus-for-aktu-b-tech-2019-20-scheme\/"},"modified":"2020-02-08T05:59:51","modified_gmt":"2020-02-08T05:59:51","slug":"discrete-structures-theory-of-logic-cse-3rd-sem-syllabus-for-aktu-b-tech-2019-20-scheme","status":"publish","type":"post","link":"https:\/\/www.inspirenignite.com\/up\/discrete-structures-theory-of-logic-cse-3rd-sem-syllabus-for-aktu-b-tech-2019-20-scheme\/","title":{"rendered":"Discrete Structures & Theory of Logic CSE 3rd Sem Syllabus for AKTU B.Tech 2019-20 Scheme"},"content":{"rendered":"

Discrete Structures & Theory of Logic detail syllabus for Computer Science Engineering (Cse), 2019-20 scheme is taken from AKTU<\/a> official website and presented for AKTU students. The course code (KCS303), and for exam duration, Teaching Hr\/Week, Practical Hr\/Week, Total Marks, internal marks, theory marks, duration, and credits do visit complete sem subjects post given below.<\/p>\n

For all other cse 3rd sem syllabus for b.tech 2019-20 scheme aktu you can visit CSE 3rd Sem syllabus for B.Tech 2019-20 Scheme AKTU Subjects<\/a>. The detail syllabus for discrete structures & theory of logic is as follows.<\/p>\n

Unit I<\/h4>\n

For the complete syllabus, results, class timetable and more kindly download iStudy<\/a>. It’s a lightweight, easy to use, no images, no pdfs platform to make student’s life easier.<\/b><\/p>\n

Unit II<\/h4>\n

Algebraic Structures: Definition, Groups, Subgroups and order, Cyclic Groups, Cosets, Lagrange’s theorem, Normal Subgroups, Permutation and Symmetric groups, Group Homomorphisms, Definition and elementary properties of Rings and Fields.\n<\/p>\n

Unit III<\/h4>\n

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.\n<\/p>\n

Unit IV<\/h4>\n

For the complete syllabus, results, class timetable and more kindly download iStudy<\/a>. It’s a lightweight, easy to use, no images, no pdfs platform to make student’s life easier.<\/b><\/p>\n

Unit V<\/h4>\n

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.\n<\/p>\n

Course Outcomes:<\/h4>\n