Scribd
Upload
11 views2 pages

Discrete Math Syllabus

The MCA-103 Discrete Mathematics course aims to provide students with a mathematical foundation for understanding and solving practical problems in mathematics and computer science. Key topics include sets, relations, functions, graph theory, and Boolean algebra, with a focus on constructing mathematical arguments and validating correctness. The course consists of four modules covering various discrete structures and their applications, supported by a primary textbook and several reference materials.

Uploaded by

Priyanka Banerjee
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
11 views2 pages

Discrete Math Syllabus

The MCA-103 Discrete Mathematics course aims to provide students with a mathematical foundation for understanding and solving practical problems in mathematics and computer science. Key topics include sets, relations, functions, graph theory, and Boolean algebra, with a focus on constructing mathematical arguments and validating correctness. The course consists of four modules covering various discrete structures and their applications, supported by a primary textbook and several reference materials.

Uploaded by

Priyanka Banerjee
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

MCA-103 Discrete Mathematics

Course objectives:
Prepare students to develop mathematical foundations to understand and create mathematical
arguments require in learning many mathematics and computer sciences courses. To motivate
students how to solve practical problems using discrete mathematics. Also, in this course basic
concepts of Graph theory such as Trees, Eulerian Graphs, Matching, Vertex colourings, Edge
colourings, Planarity, are introduced.

Learning Outcome:
1) Construct mathematical arguments using logical connectives and quantifiers.
2) Understand how lattices and Boolean algebra are used as tools and mathematical models in
the study of networks.
3) Validate the correctness of an argument using statement and predicate calculus.
4) Learn how to work with some of the discrete structures which include sets, relations,
functions, graphs and recurrence relation.
5) Understand the concepts Planarity including Euler identity.
6) Discuss and understand the importance of the concepts Matching’s and Colourings’.

Module-I 10 Hours)
Sets and Propositions: Principle of Inclusion and Exclusion, Mathematical induction, Propositions,
Logical Connectives, Conditionals and Biconditionals, Logical Equivalences, Predicate Calculus,
Quantifiers, Theory of inference, Methods of proof. Relations and Functions: properties of binary
relations, Closure of relations, Warshall’s algorithm, Equivalence relations, Partial ordering
relations and lattices, Chains and antichains, Functions, Composition of Functions, Invertible
Functions, Recursive Functions, Pigeonhole principle.
Module-II (10 Hours)
Numeric Functions and Generating Functions: Discrete Numeric functions, Generating Functions,
Recurrence Relations and Recursive Algorithms: Recurrence relations, Linear recurrence relations
with constant coefficients, Solution of recurrence relations by the method of generating functions,
Divide and conquer algorithms.
Module-III (10 Hours)
Groups and Rings: groups and subgroups, Cosets and Lagrange’s theorem, Codes and Group
codes, Error detection and correction using Group codes, Isomorphism, Homomorphism and
normal subgroups, Rings, Integral domains and Fields, Boolean Algebras: Lattices and algebraic
systems, Principle of duality, Distributive and complemented lattices, Boolean functions and
Boolean expressions, Simplification of logic expressions using Karnaugh Map, Design and
Implementation of Digital Networks, Switching Circuits.
Module-IV (10 Hours)
Graphs and Trees: Basic terminology, Diagraphs and relations, representation of Graphs,
operations on graphs, paths and circuits, graph traversals, shortest path in weighted graphs,
Eulerian paths and circuits, Hamiltonian paths and circuits, Traveling sales person’s problem,
Planar graphs, Graph Coloring, Trees, Rooted trees, Binary search trees, Spanning trees,
Minimum spanning trees, Kruskal’s Algorithm, Prim’s Algorithm.

Text Book:
1. C. L. Liu, D. P. Mohapatra, Elements of Discrete Mathematics: A computer Oriented Approach,
McGraw Hill Education (India) Private Limited, 4th Edition, 2013.
Reference Books:
1. R.K.Bisht, and H.S.Dhami, Discrete Mathmatics, Oxford University Press, First Edition, 2015
2. Kenneth H. Rosen, Discrete Mathematics and its Applications, Tata McGraw Hill, 5thed, 2003.
3. J. P. Tremblay and R. Manohar, Discrete Mathematical Structures with Applications, to
Computer Science, TataMc-Graw Hill, 2001.
4. Joe L. Mott, A. Kandel, and T. P. Baker, Discrete Mathematics for Computer Scientists &
Mathematics, Prentice Hall of India, 2nd Edition, 2006. 5. N. Deo, Graph Theory with
applications to Engineering & Computer Science, Prentice Hall of India, 2006.
5. S. Lipschutz, Discrete Mathematics, Tata McGraw Hill, 2005

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy