Discrete Structures & Theory of Logic detail syllabus for Computer Science Engineering (Cse), 2019-20 scheme is taken from AKTU 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.
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. The detail syllabus for discrete structures & theory of logic is as follows.
Unit I
For the complete syllabus, results, class timetable and more kindly download iStudy. It’s a lightweight, easy to use, no images, no pdfs platform to make student’s life easier.
Unit II
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.
Unit III
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.
Unit IV
For the complete syllabus, results, class timetable and more kindly download iStudy. It’s a lightweight, easy to use, no images, no pdfs platform to make student’s life easier.
Unit V
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.
Course Outcomes:
- Write an argument using logical notation and determine if the argument is or is not valid.
- Understand the basic principles of sets and operations in sets.
- Demonstrate an understanding of relations and functions and be able to determine their properties.
- Demonstrate different traversal methods for trees and graphs.
- Model problems in Computer Science using graphs and trees.
Reference Books:
- Koshy, Discrete Structures, Elsevier Pub. 2008 Kenneth H. Rosen, Discrete Mathematics and Its Applications, 6/e, McGraw-Hill, 2006.
- B. Kolman, R.C. Busby, and S.C. Ross, Discrete Mathematical Structures, 5/e, Prentice Hall, 2004.
- E.R. Scheinerman, Mathematics: A Discrete Introduction, Brooks/Cole, 2000.
- R.P. Grimaldi, Discrete and Combinatorial Mathematics, 5/e, Addison Wesley, 2004.
- Liptschutz, Seymour, Discrete Mathematics, McGraw Hill.
- Trembley, J.P & R. Manohar, Discrete Mathematical Structure with Application to Computer Science, McGraw Hill. 4. Deo,
- Narsingh, Graph Theory With application to Engineering and Computer.Science., PHI.
- Krishnamurthy, V., Combinatorics Theory & Application, East-West Press Pvt. Ltd., New Delhi.
For detail syllabus of all other subjects of B.Tech Cse, 2019-20 scheme do visit Cse 3rd Sem syllabus for 2019-20 scheme.
Don’t forget to download iStudy for the latest syllabus, results, class timetable and more.