Scribd
Upload
53 views1 page

Maths

The document outlines the BCSC 0058 module on Discrete Mathematical Structures, focusing on fundamental concepts in discrete mathematics and their applications in computer science. It covers topics such as set theory, probability, algebra, and graph theory, with a total of 40 teaching hours. Upon completion, students will be able to apply mathematical thinking, probability, and algebraic techniques to problem solving.

Uploaded by

Yash Mishra
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
53 views1 page

Maths

The document outlines the BCSC 0058 module on Discrete Mathematical Structures, focusing on fundamental concepts in discrete mathematics and their applications in computer science. It covers topics such as set theory, probability, algebra, and graph theory, with a total of 40 teaching hours. Upon completion, students will be able to apply mathematical thinking, probability, and algebraic techniques to problem solving.

Uploaded by

Yash Mishra
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/ 1

BCSC 0058: DISCRETE MATHEMATICAL STRUCTURES

Objective: The objective is to introduce students to language and methods of the area of Discrete
Mathematics. The focus of the module is on basic mathematical concepts in discrete mathematics and
on applications of discrete mathematics in computer science.

Credits: 4 L–T–P-J: 3–1–0-0

Module Teaching
No. Content Hours
Sets, Relations and Functions: Introduction to Set Theory, Venn diagrams,
algebra of Sets, Inclusion-Exclusion Principle, Partitions, Proof Techniques,
Relations, Properties and their types, Function and their types.
Recurrence Relations and Generating Functions
Introduction to Counting Principle: Permutation, Combination,
I Permutation with Repetition, Combination with Repetition, Pigeonhole 17
Principle.
Probability Theory: Introduction to Probability Theory, Conditional
Probability, Total Probability, Bayes’ Theorem.
Proof Method: Mathematical Induction
Propositional Logic - Logical Connectives, Truth Tables, Normal Forms
(Conjunctive and Disjunctive), Validity;
Predicate Logic - Quantifiers, Inference Theory.
Algebra: Motivation of Algebraic Structures, Finite Groups, Subgroups and
II Group Homomorphism; Lagrange’s Theorem; Commutative Rings and 23
Elementary Properties;
Graph Theory: Introduction to Graphs, Types: Planner, Directed, Complete,
Bipartite Graph, Isomorphism, Euler Graph, Hamiltonian Graph, Operations
on Graphs, Representation of graphs, Connectivity.

Text Book:
 Kenneth H Rosen (2012), “Discrete Mathematics and Its Applications”, 7th edition, TMH.
Reference Books:
 J. P. Tremblay (1997), “Discrete Mathematical Structures with Applications to Computer
Science”, TMH, New Delhi.
 V. Krishnamurthy (1986), “Combinatorics: Theory and Applications”, East-West Press, New Delhi.
 Ralph P. Grimaldi (2004), “Discrete and Combinatorial Mathematics- An Applied
Introduction”, 5th Edition, Pearson Education.
 C. L. Liu (2000), “Elements of Discrete Mathematics”, 2nd Edition, TMH.
Outcome: After the completion of the course, the student will be able to:
 CO1: Understand the notion of mathematical thinking, mathematical proofs, and
algorithmic thinking, and be able to apply them in problem solving.
 CO2: Understand the basics of discrete probability and number theory, and be able to
apply the methods from these subjects in problem solving.
 CO3: Use effectively algebraic techniques to analyze basic discrete structures and
algorithms.

You might also like