Course Handout (2023-24 ODD SEMESTER)

: MATHEMATICS-III for Computer Sciences(BTBS-

Subject Name/Code T-BS-017)
Branch/Sem/Batch :

: Prayag Prasad Mishra , Chittaranjan Behera , Saroj Kanta Misra , Susmita Biswal , TUSAR
Name of Faculty PARIDA , Swarupa Roy , TARUN KUMAR CHAKRA , Sripati Kumar Mishra
Scope & Objective -:

The objectives of this course is to gain mathematical maturity to handle logical & abstract processes, discrete structures, graph
theory, important counting techniques, and discrete Fourier transform which are essential for solving various problems in
computer science.

Pre-Requisite -:

Detailed Syllabus:
Module# CO Topics Hours
Propositional Logic, Propositional Equivalences, Predicates and
Module-1 CO1 Quantifiers, Nested Quantifiers, Rules of Inference, Proof 10
Strategies.
Mathematical induction, Basics of counting, Pigeonhole
principle, Permutations & Combinations, Binomial coefficients,
Module-2 CO2 Generalized permutation & combinations; Recurrence 10
relations, Linear recurrence relations, Generating functions,
Inclusion & Exclusion with applications.
Relations and their properties, N-ary Relations & their
Module-3 CO3 applications, Representing relations, Closure of relations, 8
Equivalence relations, Partial ordering and Lattice.
Introduction to Graphs, Graph terminology, Representation of
graphs & graph isomorphism, Connectivity, Euler & Hamilton
Module-4 CO4 10
graphs, Planar graph & Graph coloring; Trees, Spanning trees
and Cut-sets.
Algebraic structure, Semigroup, Monoid, Groups, Subgroups,
Cosets and Lagrange’s theorem, Codes and group codes,
Module-5 CO5 10
Isomorphism & Automorphism, Homomorphism & Normal
subgroups, Rings, Integral Domains & Fields.
Sampling and sampling theorem for signals, Discrete Time
Module-6 CO6 Signals, Discrete Fourier Transform, Properties of DFT, Fast 8
Fourier Transform (FFT).
Total 56 Hours

# Topic Module Chapter Course Coverage No of Classes

Introduction (details about the course, books, pre-

1 MODULE-1 TRUE 1
requisites, the preparation needed for such a course)
propositional logic (Proposition, conjunction, disjunction,
2 negation, conditional, truth tables, translating to MODULE-1 TRUE 1
symbols)
Bconditional, converse, contrapositive, inverse,
3 Prpositional Equivalences (Equivalence using truth MODULE-1 TRUE 1
table)
Laws specifying equivalence, equivalence by
4 MODULE-1 TRUE 1
simplification
Predicate & Quantifier, Universal & Existential
5 Quantifiers, Quantifiers with Restricted Domains, MODULE-1 TRUE 1
Translating from English into Logical Expressions
Logical Equivalences Involving Quantifiers, Negating
6 MODULE-1 TRUE 1
Quantified Expressions
Nested Quantifiers(Translating mathematical statements
7 into statements involving nested quantifiers and vice MODULE-1 TRUE 1
versa, negating nested quantifiers)
 Rules of inference for propositions(Modus ponens,Modus
tollens,Hypothetical Syllogism,Disjunctive
8 MODULE-1 TRUE 1
Syllogism,Addition,Simplification,conjunction,Resolution,
Using rules of inference to build arguments)
9 Rules of inferences for quantified Statements MODULE-1 TRUE 1
Introduction to proofs(Direct proofs,proof by
10 contrapositive,contradiction,vacuous and trivial MODULE-1 TRUE 1
proofs,proofs of equivalence,mistakes in proofs)
Proof methods and strategy(Exhaustive proof,proof by
11 MODULE-1 TRUE 1
cases,existence proofs, Uniqueness proofs)
Mathematical Induction(Weak induction,strong
12 MODULE-2 TRUE 1
induction)
13 Solutions of problems by Mathematical Induction MODULE-2 TRUE 1
Basics of counting, the sum rule and the product rule,
14 MODULE-2 TRUE 1
pigeonhole principle and its applications
Recalling of permutation & combination and binomial
15 MODULE-2 TRUE 1
coefficients
Generalized permutation & combination (permutation &
16 combination with repetition, permutations with MODULE-2 TRUE 1
indistinguisable objects, distributing objects in to boxes)
Recurrence Relation(Definition and modeling with
17 MODULE-2 TRUE 1
recurrence relations)
Solution of linear Recurrence Relation (Homogeneous
18 MODULE-2 TRUE 1
with constant coefficients)
Solution of linear Recurrence Relation (non-
19 MODULE-2 TRUE 1
Homogeneous with constant coefficients)
20 Generating Function and its applications MODULE-2 TRUE 1
21 Inclusion Exclusion Principle MODULE-2 TRUE 1
Relations and their prpoperties(Binary relation,relation
22 MODULE-3 TRUE 1
on a set,Properties of Relation,Combining relations)
23 n-ary relations and their applications MODULE-3 TRUE 1
Representing relations(Representing relations using
24 MODULE-3 TRUE 1
matrices,Representing relations using diagraphs)
Closure of relations(Reflexive,symmetric and transitive
25 MODULE-3 TRUE 1
closure)
26 Warshall's Algorithm MODULE-3 TRUE 1
Equivalence relations(Introduction with
27 MODULE-3 TRUE 1
examples,Equivalence classes and Partitions)
28 Partial ordering(Definition,Lexicographic ordering) MODULE-3 TRUE 1
Hasse Diagram(Drawing Hasse diagram,maximal and
29 MODULE-3 TRUE 1
minimal elements,upper and lower bounds,)
30 lub and glb,Lattices MODULE-3 TRUE 1
31 Algebraic System, Semi group MODULE-5 TRUE 1
32 Monoid, Group MODULE-5 TRUE 1
33 Subgroup MODULE-5 TRUE 1
34 Cyclic Group TRUE 1
35 problem discussion FALSE 1
36 Cosets & Lagrange's Theorem MODULE-5 TRUE 1
37 Homomorphism,Isomorphism,Automorphism MODULE-5 TRUE 1
38 Normal subgroup FALSE 1
39 Group codes MODULE-5 TRUE 1
40 Error Correcting Codes MODULE-5 TRUE 1
41 Ring,Field and Integral domain MODULE-5 TRUE 1
42 problem discussion on Ring TRUE 1
Graphs, terminology (Defination,Basic terminologies,The
43 Handshaking Theorem, types of graphs,special simple MODULE-4 TRUE 1
graphs,bipartite,complete bipartite,subgraphs)
44 Types of grphs MODULE-4 TRUE 1
Representation of graph & graph Isomorphism
45 (Adjacency matrices,Incidence matrices,Isomorphism of MODULE-4 TRUE 1
graphs)
Connectivity(Introduction,Paths,connectedness in
46 undirected and directed graphs,Paths and MODULE-4 TRUE 1
Isomorphism,Counting paths between vertices)
47 Euler & Hamiltonian Path & Circuit TRUE 1
48 Shortest path problem(Dijkstra's algorithm) MODULE-4 TRUE 1
49 Planar graph, Euler's Formula MODULE-4 TRUE 1
Graph colouring, Chromatic number, representing maps
50 MODULE-4 TRUE 1
by planar graph and finding their chromatic number
51 Tree and its properties MODULE-4 TRUE 1
 52 Signals, Sampling and Quantization TRUE 1
Discrete-Time Signals, Classifications and Simple
53 TRUE 1
Manipulations
54 The Discrete Fourier Transform (DFT) TRUE 1
55 DFT as a Linear Transform & Properties of DFT TRUE 1
56 Divide-and-Conquer Approach to Computation of DFT TRUE 1
57 Radix-2 FFT Algorithm TRUE 1
58 Appendix: On complex number and complex exponential TRUE 1

Total no. of classes : 58

Text Book
Discrete Mathematics and Its Applications, K. H. Rosen, Tata McGraw-Hill
Elements of Discrete Mathematics, C. L. Liu , Tata McGraw-Hill
Digital Signal Processing, , J. G. Proakis and D. G. Manolakis, 4th Edition

Reference Book
Discrete Mathematical Structures with Applications to Computer Science, J. P. Tremblay and R. Manohar, McGraw-Hill
Education
Discrete Mathematics for Computer Scientists and Mathematicians, , J. R. Mott, A. Kandel, and T. P. Baker, Pearson Education
Online Reference Material(s):

1. http://www.nptel.ac.in/courses/111105035
2. http://www.nptel.ac.in/courses/122104017
3. http://nptel.ac.in/courses/122102009
4. http://nptel.ac.in/courses/111107063
5. https://swayam.gov.in/course/1396-discrete-mathematics
6. https://www.coursera.org/learn/linearalgebra2
7. https://www.coursera.org/learn/differentiation-calculus
8. https://www.coursera.org/learn/single-variable-calculus
9. https://alison.com/courses/Algebra-Functions-Expressions-and-Equations

Course Outcome:
CO1 Apply logic for logical inferences.
Apply principle of inclusion & exclusion, generating function and recurrence relations to solve
CO2
counting problems.
CO3 Understand and apply the concepts of relation and lattice.
CO4 Apply graph theory to real-life problems of computer science & engineering.
CO5 Differentiate the discrete algebraic structures and apply them to study group codes.
CO6 Apply discrete Fourier Transform and FFT to process digital signals.

Program Outcomes Relevent to the Course:

Engineering knowledge: Apply the knowledge of mathematics, science, engineering fundamentals,
PO1
and an engineering specialization to the solution of complex engineering problems
Problem analysis: Identify, formulate, review research literature, and analyze complex engineering
PO2 problems reaching substantiated conclusions using first principles of mathematics, natural
sciences, and engineering sciences.
Design/development of solutions: Design solutions for complex engineering problems and design
PO3 system components or processes that meet the specified needs with appropriate consideration for
the public health and safety, and the cultural, societal, and environmental considerations.
Conduct investigations of complex problems: Use research-based knowledge and research methods
PO4 including design of experiments, analysis and interpretation of data, and synthesis of the
information to provide valid conclusions.
Modern tool usage: Create, select, and apply appropriate techniques, resources, and modern
PO5 engineering and IT tools including prediction and modeling to complex engineering activities with
an understanding of the limitations.
 The engineer and society: Apply reasoning informed by the contextual knowledge to assess
PO6 societal, health, safety, legal and cultural issues and the consequent responsibilities relevant to the
professional engineering practice.
Environment and sustainability: Understand the impact of the professional engineering solutions in
PO7 societal and environmental contexts, and demonstrate the knowledge of, and need for sustainable
development.
Ethics: Apply ethical principles and commit to professional ethics and responsibilities and norms of
PO8
the engineering practice.
Individual and team work: Function effectively as an individual, and as a member or leader in
PO9
diverse teams, and in multidisciplinary settings.
Communication: Communicate effectively on complex engineering activities with the engineering
PO10 community and with society at large, such as, being able to comprehend and write effective reports
and design documentation, make effective presentations, and give and receive clear instructions.
Project management and finance: Demonstrate knowledge and understanding of the engineering
PO11 and management principles and apply these to one’s own work, as a member and leader in a team,
to manage projects and in multidisciplinary environments.
Life-long learning: Recognize the need for, and have the preparation and ability to engage in
PO12
independent and life-long learning in the broadest context of technological change.

Mapping of CO's to PO's: (1: Low, 2: Medium, 3: High)

PO1 PO2 PO3 PO4 PO5
CO1 3 3 1 3 1
CO2 3 3 2 1 2
CO3 3 3 3 3 1
CO4 3 3 3 2 3
CO5 3 3 2 2 2
CO6 3 3 2 2 2