Discrete Mathematical Structures

(21CS37)

Handled by
Dr. Arunakumari B N
Assistant Professor
Dept. of CSE
Email id: arunakumaribn@bmsit.in
30-10-2022
Phone Number: 7619256698 1
 Discrete Mathematical
DMS Structure
DMS(DMS) DMS

30-10-2022 2
What is Discrete Mathematical Structure?

•Discrete mathematics is the study of mathematical

language that is countable or otherwise distinct and
separable. Examples of structures that are discrete
are combinations, graphs, and logical statements.

•Similar to spoken language, it consists of

syntactics, semantics and pragmatics.

30-10-2022 3
What is Discrete Mathematical Structure?
• Syntactics: Symbols and their Meanings

30-10-2022 4
What is Discrete Mathematics?

•Semantics: Two or more symbols combined together to form

meaningful entity/statement /equation.

Examples : ax2 + bx + c = 0;

•Pragmatics: Current Practices

30-10-2022 5
Why to study Discrete Mathematics?
How many programming languages are there?

Wikipedia claims that there are around 700 programming languages

02-Aug-2022

30-10-2022 6
Why to study Discrete Mathematics?

•E = mc2 is outdated?

•Integration and differentiation is Outdated?

•Anything that is based on natural and mathematical rigour

it survive for longer time.

•Mathematics is a language to prove correctness and

completeness of any paradigm .

30-10-2022 7
 Discrete Mathematics Application in Computer
Science?
✔Artificial Intelligence ✔Operating system

✔Machine Learning ✔Computer Architecture

✔Data Science ✔Computer Networks

✔Advanced Algorithms data structure✔Database Management

System

✔Programming Language compilers &✔Cryptography & Cyber

interpreters Security

✔Error Correction codes ✔Graphic, animation and game

30-10-2022 8
engine
Discrete Mathematics Application in Computer
Science?
• This course introduces students to formal reasoning and
the mathematics of discrete structures which build the
mathematical foundation of Computer Science.

• DMS methods of mathematics can be applied in the areas

of algorithm design, analysis and verification, automata
theory and computability, knowledge representation,
formal reasoning, information systems, and information
security.

31-10-2022 9
 Module - 1

• Fundamental Principles of Counting: Overview, The rule of

sum and product, Permutations, Combinations, The binomial
theorem, Multinomial Theorem, and Combinations with
repetition.

•Set Theory: Sets and Subsets, Set operations, Laws of set

theory.

•The Principles of Inclusion and Exclusion: Generalization of the

30-10-2022 10

principle, Derangements- Nothing is in its right place.

 Module - 2

•Fundamentals of Logic: Basic connectives and Truth tables,

Tautologies.

•Logical Equivalence: The laws of logic, Logical implications,

Rules of inference.

•Open statement, Quantifiers, and Predicate Calculus: Definition

and the use of Quantifiers, Definitions, and the proofs of
theorems.
30-10-2022 11
 Module - 3

•Relations: Properties of relations, Equivalence relations,

Partitions, Partial orders, Hasse diagrams, and Extremal
elements in posets.

•Functions: Types of function, Properties of functions, The

pigeonhole principle, Composition of functions, Inverse
functions and Invertible Functions.

30-10-2022 12
 Module - 4

•Mathematical Induction, Recursive Definitions and Recurrence

Relations: Method of mathematical induction, Recursive
definition, Rook polynomials, and Arrangements with forbidden
positions. First order linear recurrence relation-Formulation
problems and examples. Second order linear homogeneous
recurrence relations with constant coefficients.

30-10-2022 13
 Module - 5

Introduction to Graph Theory: Definitions and Examples,

Subgraphs-Spanning subgraph, Induced subgraph, Special
subgraphs, Complements of a subgraph, and Graph of
isomorphism, Vertex degree, Euler trails and Circuits, Shortest
path.

Trees: Definitions, Properties and Examples, Routed Trees-

Binary tree, Balanced tree, Full binary Tree, Sorting-Merge sort,
Weighted trees, Optimal tree and Prefix codes.

30-10-2022 14
Course Outcomes:
The Students should be able to

CO1: Outline the fundamental concepts of discrete mathematical

structures.

CO2: Apply the concepts of discrete mathematical structures for

effective computation and relating problems in Engineering domain.

CO3: Analyze the concepts of discrete mathematics to various fields

of Engineering.

CO4: Design mathematical solutions for solving various real time

problems.
30-10-2022 15
Question paper pattern:
•SEE will be conducted for 100 marks.
•Part A: First question with 20 MCQs carrying 1 mark each.

•Part B: Each full question is for 16 marks. (Answer five full

questions out of 10 questions with intra modular choice).

• In every question, there will be a maximum of three sub-questions.

•CIE will be announced prior to the commencement of the course.

•25 marks for test. Average of three test will be taken.

•25 marks for Alternate Assessment Method.

30-10-2022 16
 25 marks for Alternate Assessment Method.

1. Activity Presentation / Project Based Learning

2. Assignments

•Assignment will be given after completion of module, and it

must be uploaded to Google Classroom on the date mentioned.

•Assignment will be mostly problems to be solved.

•You must be honest in solving the problem and the problem will
be discussed in the forum once the due date will be over.
30-10-2022 17
 Book for DMS:
1. Ralph P. Grimaldi and B V Ramana, Discrete and
Combinatorial Mathematics- An Applied Introduction,
Pearson Education, Asia, Fifth edition – 2007. ISBN
978-81-7758-424-0.

2. J.P. Tremblay and R. Manohar, Discrete Mathematical Structures

with Applications to Computer Science, Tata – McGraw Hill,
35TH reprint 2008. ISBN 13:978-0-07- 463113-3.

30-10-2022 18
Google Classroom

Class Code:
p2etafa
30-10-2022 19