Anna University, Subject code – MA3354, deals with the B.E Computer Science and Engineering Semester -III Discrete Mathematics syllabus regulation 2021 relating to affiliated institutions. From here, Students can get assistance in preparing notes to excel in academic performance.
We include every topic of the Discrete Mathematics Syllabus, to understand the subject very well. It will help you to improve your idea of syllabus of MA3354-Discrete Mathematics Syllabus on your finger tips to go ahead in a clear path of preparation. In this following article Discrete Mathematics Syllabus, will help you, Hope you share with your friends.
If you want to know more about the syllabus of B.E Computer Science and Engineering connected to an affiliated institution’s under four-year undergraduate degree programme. We provide you with a detailed Year-wise, semester-wise, and Subject-wise syllabus in the following link B.E Computer Science and Engineering Syllabus Anna University, Regulation 2021.
Aim Of Concept:
- To extend student’s logical and mathematical maturity and ability to deal with abstraction.
- To introduce most of the basic terminologies used in computer science courses and application of ideas to solve practical problems.
- To understand the basic concepts of combinatorics and graph theory.
- To familiarize the applications of algebraic structures.
- To understand the concepts and significance of lattices and boolean algebra which are widely used in computer science and engineering.
MA3354- Discrete Mathematics Syllabus
Unit I: Logic And Proofs
Propositional logic – Propositional equivalences – Predicates and quantifiers – Nested quantifiers – Rules of inference – Introduction to proofs – Proof methods and strategy.
Unit II: Combinatorics
Mathematical induction – Strong induction and well-ordering – The basics of counting – The pigeonhole principle – Permutations and combinations – Recurrence relations – Solving linear recurrence relations – Generating functions – Inclusion and exclusion principle and its applications.
Unit III: Graphs
Graphs and graph models – Graph terminology and special types of graphs – Matrix representation of graphs and graph isomorphism – Connectivity – Euler and Hamilton paths.
Unit IV: Algebraic Structures
Algebraic systems – Semi groups and monoids – Groups – Subgroups – Homomorphism’s – Normal subgroup and cosets – Lagrange’s theorem – Definitions and examples of Rings and Fields.
Unit V: Lattices And Boolean Algebra
Partial ordering – Posets – Lattices as posets – Properties of lattices – Lattices as algebraic systems – Sub lattices – Direct product and homomorphism – Some special lattices – Boolean algebra – Sub Boolean Algebra – Boolean Homomorphism.
Text Books:
- Rosen. K.H., “Discrete Mathematics and its Applications”, 7th Edition, Tata McGraw Hill Pub. Co. Ltd., New Delhi, Special Indian Edition, 2017.
- Tremblay. J.P. and Manohar. R, “Discrete Mathematical Structures with Applications to Computer Science”, Tata McGraw Hill Pub. Co. Ltd, New Delhi, 30th Reprint, 2011.
References:
- Grimaldi. R.P. “Discrete and Combinatorial Mathematics: An Applied Introduction”, 5th Edition, Pearson Education Asia, Delhi, 2013.
- Koshy. T. “Discrete Mathematics with Applications”, Elsevier Publications, 2006.
- Lipschutz. S. and Mark Lipson., “Discrete Mathematics”, Schaum’s Outlines, Tata McGraw Hill Pub. Co. Ltd., New Delhi, 3rd Edition, 2010.
Related Posts On Semester III:
- CS3351 – Digital Principles and Computer Organization
- CS3352 – Foundations of Data Science
- CS3301 – Data Structures
- CS3391 – Object-Oriented Programming