Department: Mathematics
Semester: III Course Code: BMATS301 Contact Hrs /week: 4
Course Description: Discrete Mathematics (Common for No. of Credits: 3
CSE/ISE/AI&DS/AI &ML/CS-AI&ML) L : T : P : S = 2:2:0:0
Course Category: Basic Science Course (BSC) Total no. of Hours = 40
CIE: 50 Marks SEE: 50 Marks Exam Hours: 03
Course Pre-requisites:
Basic algebra and number theory
Fundamental concepts of functions and relations
Introductory set theory and probability concepts from high school mathematics
1. PREAMBLE ABOUT THE COURSE
This course provides a foundation in discrete mathematical structures that are vital to
computer science, information technology, and applied mathematics. The course covers set
theory, logic, counting principles, relations, functions, and probability with emphasis on
reasoning, proof techniques, and combinatorial problem-solving. Through structured learning
and problem-oriented approaches, students will build the mathematical foundation required
for algorithm design, data structures, and theoretical computer science.
2. COURSE LEVEL OBJECTIVES
By the end of this course, students will be able to:
1. Apply set theory and probability concepts.
2. Construct and evaluate logical statements.
3. Use counting principles and combinatorial techniques.
4. Analyze and classify relations and functions.
5. Identify and manipulate different types of functions.
3. COURSE OUTCOMES (COs) & COMPETENCIES
Course Mapped Cognitive Class
Description WK
Outcome POs/PSOs Level Hours
Apply set theory, counting PO1, PO2, L3
principles, and basic probability PO5 WK1,
concepts to model and solve
CO1 problems in computer science,
WK2, 8
including algorithm analysis and WK3,WK6
data representation.
Construct and evaluate logical PO1, PO2, L3
WK1,
CO2 statements using truth tables, PO5 8
rules of inference, and WK2,
quantifiers to develop valid
proofs and verify program WK3,WK6
correctness.
Solve combinatorial problems PO1, PO2, L2
using counting techniques, PO5 WK1,
permutations, combinations, and
CO3 mathematical induction to
WK2, 8
support algorithm design and WK3,WK6
complexity analysis.
Analyze relations and their PO1, PO2, L4
properties using matrices and PO5
graphs, and interpret WK1,
CO4 equivalence and partial order WK2, 8
relations using Hasse diagrams WK3,WK6.
and partitions in discrete
structures.
Apply function theory, PO1, PO2, L3
generating functions, and PO5 WK1,
CO5 recurrence relations to model WK2, 8
computational processes and WK3,WK6
analyze recursive algorithms.
WKs are Washington Accord’s Knowledge & Attitude Profiles ranging from WK1 to WK9
4. SYLLABUS
Module Mapped No. of
Module Description
No. COs Hours
Sets and Subsets, Set Operations and the Laws of Set
Theory, Counting and Venn Diagrams. Probability,
I CO1 8
Axioms of probability, Conditional probability, Bayes
theorem.
Fundamentals of Logic: Basic Connectives and Truth
Tables, Logic Equivalence, The Laws of Logic Logical
II CO2 8
Implication: Rules of Inference, Quantifiers, Definitions,
and the Proofs of Theorems.
Fundamental Principles of Counting: The Rules of Sum and
Product, Permutations, Combinations: The Binomial
III Theorem, Combinations with Repetition. The Well CO3 8
Ordering Principle: Mathematical Induction, Recursive
Definitions.
Relations and Functions: Cartesian Products and Relations,
Properties of Relations, Computer Recognition: Zero-One
IV CO4 8
Matrices and Directed Graphs, Partial Orders: Hasse
Diagrams, Equivalence Relations and Partitions.
Functions: Plain and One-to-One, Onto Functions. Function
V Composition and Inverse Functions. Generating function CO5 8
and first order recurrence relation.
5. LIST OF RECOMMENDED AND REFERENCE TEXTBOOKS
S.
Name of the Book Author(s) Publisher Edition
No.
Discrete and Combinatorial Pearson
1 Ralph P. Grimaldi 5th
Mathematics Education
Higher Engineering Khanna
2 B. S. Grewal 44th
Mathematics Publishers
Discrete Mathematics and its
3 Kenneth H. Rosen McGraw Hill 6th
Applications
Advanced Engineering John Wiley &
4 E. Kreyszig 10th
Mathematics Sons
Probability, Statistics and
Random Processes with Tata Mc-Graw Hill
5 T Veerarajan Co
4th
Queueing Theory and Queueing
Networks
6. LIST OF ONLINE RESOURCES [NPTEL/SWAYAM/MOOCS/WEB RESOURCE
https://nptel.ac.in/courses
https //swayam.gov.in/nptel onlinecourses.nptel.ac.in/
https://academicearth.org/online-college-courses/
https://elearning.vtu.ac.in/
7. EVALUATION METHODOLOGY
Semester End Examination (SEE):
SEE Question paper is to be set for 100 marks and the marks scored will be proportionately reduced
to 50. There will be two full questions (with a maximum of four sub questions) from each module
carrying 20 marks each. Students are required to answer any five full questions choosing at least one
full question from each module.
Continuous Internal Evaluation (CIE):
Components Marks
Test 1 40 Marks
Test 2 40 Marks
Test 3 40 Marks
Assignment 10 Marks
Final CIE Marks Average of 3 tests + Assignment Marks
8. COURSE OUTCOMES & PROGRAM OUTCOMES MAPPING
POs →
PO10
PO11
PO1
PO2
PO3
PO4
PO5
PO6
PO7
PO8
PO9
COs ↓
CO1 3 1 - - 1 - - - - - -
CO2 3 1 - - 1 - - - - - -
CO3 3 1 - - 1 - - - - - -
CO4 3 1 - - 1 - - - - - -
Correlation Weightage: 1 – Low, 2 – Moderate, 3 - High
9. COURSE OUTCOMES & PROGRAM SPECIFIC OUTCOMES MAPPING
PSOs PSO1 PSO2 PSO3
→
COs ↓
CO1 - - -
CO2 - - -
CO3 - - -
CO4 - - -
Correlation Weightage: 1 – Low, 2 – Moderate, 3 - High
Department: Mathematics
Semester: IV Course Code: BMATS401 Contact Hrs /week: 4
Course Description: Statistics, Probability and Graph Theory No. of Credits: 3
(Common for CSE/ISE/AI&DS/AI &ML/CS-AI &ML) L : T : P : S = 2:2:0:0
Course Category: Basic Science Course (BSC) Total no. of Hours = 40
CIE: 50 Marks SEE: 50 Marks Exam Hours: 03
Course Pre-requisites:
A fundamental understanding of calculus and linear algebra.
Basic knowledge of set theory and matrix operations.
Introductory familiarity with probability concepts and high school-level statistics.
1. PREAMBLE ABOUT THE COURSE
This course is designed to equip students with essential tools from statistics, probability
theory, stochastic processes, and graph theory that form the backbone of data analysis,
decision-making, and computational modelling in engineering and scientific domains.
The course begins with foundational techniques in data fitting and correlation, progresses
through theoretical and applied probability models, and extends to stochastic behaviour
analysis and hypothesis testing. The final module introduces students to key concepts in
graph theory, enabling them to model complex structures like networks, circuits, and
hierarchical data. By integrating classical mathematical techniques with modern
applications, this course aims to prepare students to apply these tools in engineering
contexts, research problems, and real-world systems modelling.
2. COURSE LEVEL OBJECTIVES
By the end of this course, students will be able to:
1. Apply statistical techniques such as least squares fitting, correlation, and regression to
analyze and interpret data.
2. Evaluate probability models involving discrete and continuous random variables for a
variety of engineering and scientific applications.
3. Analyze joint and conditional distributions, and understand the behaviour of
stochastic processes and Markov chains.
4. Conduct statistical hypothesis testing using sampling theory and various test statistics
(t, chi-square, F) to make informed decisions.
5. Construct and examine graphs and trees, including Euler and Hamiltonian paths, and
use these tools in problems involving sorting, coding, and network structures.
3. COURSE OUTCOMES (COs) & COMPETENCIES
Course Mapped Cognitive Class
Description WK
Outcome POs/PSOs Level Hours
CO1 Analyze and interpret data using PO1, PO2, L4 WK1, 8
statistical techniques such as PO5 WK2,
curve fitting, correlation, WK3,WK6
regression, and error estimation
to support decision-making in
computing and data science.
Apply discrete and continuous PO1, PO2, L3
probability distributions to PO5 WK1,
CO2 model uncertainty in computer WK2, 8
systems and support WK3,WK6
probabilistic algorithm design.
Evaluate joint, marginal, and PO1, PO2, L3
conditional distributions, and PO5 WK1,
model dynamic systems using
CO3 stochastic processes and
WK2, 8
Markov chains in algorithmic WK3,WK6
contexts.
Perform hypothesis testing PO1, PO2, L4
using sampling distributions and PO5 WK1,
statistical tests (t, χ², F) to draw
CO4 conclusions from sample data in
WK2, 8
experimental and research WK3,WK6.
applications.
Apply graph theory concepts PO1, PO2, L3
including Euler and PO5 WK1,
Hamiltonian paths, planar
CO5
graphs, and tree structures to
WK2, 8
design and analyze efficient WK3,WK6
algorithms and data structures.
WKs are Washington Accord’s Knowledge & Attitude Profiles ranging from WK1 to WK9
4. SYLLABUS
Module Mapped No. of
Module Description
No. COs Hours
Statistics: Introduction, Principles of least squares, fitting of
a straight line, second degree parabola, . Karl Pearson’s
I CO1 8
coefficient of correlation, Regression analysis standard
error of estimate, rank correlation
Random variable, Discrete and continuous random
II variables, Probability distributions: Binomial, Poisson, CO2 8
exponential, uniform and Normal distributions.
Joint distributions, Marginal and conditional distributions,
Covariance, Correlation. Stochastic processes, probability
III CO3 8
vector, stochastic matrices, fixed points, regular stochastic
matrices, Markov chains, higher transition probability.
Sampling, Sampling distributions, standard error, test of
hypothesis for means and proportions, student’s t-
IV CO4 8
distribution, chi-square distribution as a test of goodness of
fit, F- test.
Graphs, Subgraphs, Complements, and Graph
Isomorphism, Vertex Degree, Euler Trails and Circuits.
V Planar Graphs, Hamiltonian paths and Cycles. Trees, CO5 8
Rooted Trees, Trees and Sorting, Weighted Trees and
Prefix Codes.
5. LIST OF RECOMMENDED AND REFERENCE TEXTBOOKS
S.
Name of the Book Author(s) Publisher Edition
No.
Higher Engineering Khanna
1 Mathematics
B.S. Grewal
Publishers
44th
Higher Engineering Tata
2 Mathematics
B.V. Ramana
McGraw-Hill
Advanced Engineering John Wiley &
3 Mathematics
E. Kreyszig
Sons
10th
A Textbook of
N.P.Bali and Laxmi
4 Engineering
Manish Goyal Publications
6th
Mathematics
Probability, Statistics
and Random Processes
Tata Mc-
5 with Queueing Theory T Veerarajan Graw Hill Co
4th
and Queueing
Networks
6. LIST OF ONLINE RESOURCES [NPTEL/SWAYAM/MOOCS/WEB
RESOURCE
https://nptel.ac.in/courses
https //swayam.gov.in/nptel onlinecourses.nptel.ac.in/
https://academicearth.org/online-college-courses/
https://elearning.vtu.ac.in/
7. EVALUATION METHODOLOGY
Semester End Examination (SEE):
SEE Question paper is to be set for 100 marks and the marks scored will be proportionately reduced
to 50. There will be two full questions (with a maximum of four sub questions) from each module
carrying 20 marks each. Students are required to answer any five full questions choosing at least one
full question from each module.
Continuous Internal Evaluation (CIE):
Components Marks
Test 1 40 Marks
Test 2 40 Marks
Test 3 40 Marks
Assignment 10 Marks
Final CIE Marks Average of 3 tests + Assignment Marks
8. COURSE OUTCOMES & PROGRAM OUTCOMES MAPPING
POs →
PO10
PO11
PO1
PO2
PO3
PO4
PO5
PO6
PO7
PO8
PO9
COs ↓
CO1 3 1 - - 1 - - - - - -
CO2 3 1 - - 1 - - - - - -
CO3 3 1 - - 1 - - - - - -
CO4 3 1 - - 1 - - - - - -
Correlation Weightage: 1 – Low, 2 – Moderate, 3 - High
9. COURSE OUTCOMES & PROGRAM SPECIFIC OUTCOMES MAPPING
PSOs
→ PSO1 PSO2 PSO3
COs ↓
CO1 - - -
CO2 - - -
CO3 - - -
CO4 - - -
Correlation Weightage: 1 – Low, 2 – Moderate, 3 - High
