Scribd
Upload
69 views2 pages

Discrete Maths

The Discrete Mathematics course (M(IT)401) is designed for B.Tech IT students, focusing on Probability Distribution, Abstract Algebra, and Graph Theory, with a total of 36 contact hours and 3 credits. Students will learn to apply mathematical tools to solve problems in these areas and analyze real-world phenomena. The course includes modules on probability distributions, algebraic structures, and graph theory, supported by various textbooks and references.

Uploaded by

amanfoogle15
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
69 views2 pages

Discrete Maths

The Discrete Mathematics course (M(IT)401) is designed for B.Tech IT students, focusing on Probability Distribution, Abstract Algebra, and Graph Theory, with a total of 36 contact hours and 3 credits. Students will learn to apply mathematical tools to solve problems in these areas and analyze real-world phenomena. The course includes modules on probability distributions, algebraic structures, and graph theory, supported by various textbooks and references.

Uploaded by

amanfoogle15
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

[R23. B.Tech.

IT]

COURSE NAME: DISCRETE MATHEMATICS


COURSE CODE: M(IT)401
CONTACT: 3:0:0
TOTAL CONTACT HOURS: 36
CREDITS: 3

Prerequisites:
The students to whom this course will be offered must have the concept of (10+2) standard set theory, calculus, basic
probability.

Course Objectives:
The objective of this course is to familiarize the prospective engineers with techniques of Probability Distribution Abstract
Algebra and Graph Theory. It aims to equip the students with standard concepts and tools at an intermediate to advanced
level that will serve them well towards tackling more advanced level of mathematics and applications that they would find
useful in their

Course Outcome(s):
On successful completion of the learning sessions of the course, the learner will be able to:
CO1: Apply the appropriate mathematical tools for the solutions of the problems in probability and graph theory.
CO2: Identify the distinctive algebraic structures.
CO3: Analyze the real-world uncertain phenomena by identify probability distribution.
CO4: Analyze the real-life problems using the algorithms of graph theory.
CO-PO Mapping:

PO
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO 10 PO 11 PO 12
CO
CO1 3 2 - - - - - - - - - -
CO2 3 2 - - - - - - - - - -
CO3 3 3 - - - - - - - - - -
CO4 3 3 - - - - - - - - - -
M(IT)401 3 2.5 - - - - - - - - - -

Course Content:

Module-I: Probability Distributions [12L]


Random Variable: Discrete and Continuous, Probability Distribution, Probability Mass
Function and Probability Density Function for single variable only, Distribution Function,
Expectation and Variance, Special Types of Distributions: Binomial, Poisson and Normal,
Binomial Approximation to Poisson distribution and Normal Distribution

Module-II: Algebraic Structures [12L]


Group, Commutative Group, Order of a Group, Order of an element of a Group, Properties of Group, Subgroup, Cyclic
group, Coset, Lagrange‘s theorem, Normal subgroup, Permutation group, Symmetric group(S3). Ring, Properties of Ring,
Sub ring, Integral Domain, Field.

Module -III: Graph Theory [12L]


Graph: Properties and Theorems, Digraphs, Weighted Graph, Connected and Disconnected Graph, Bipartite Graph,
[R23. B.Tech. IT]

complement of a Graph, Regular Graph, Complete Graph, Walk, Path, Circuit, Euler Graph, Hamiltonian Circuit,
Adjacency and Incidence Matrices of a Graph, Tree: Properties and Theorems, Binary Tree, Spanning Tree, Minimal
Spanning Tree, Dijkstra’s algorithm, Kruskal’s Algorithm, Prim’s Algorithm

Text Books:
 Das, N.G., Probability and Statistics, The McGraw Hill Companies.
 Chakraborty, S. K. and Sarkar, B. K., Discrete Mathematics, Oxford University Press.
 Deo, N., Graph Theory with Applications to Engineering and Computer Science, Prentice
Hall.

Reference Books:
 Gupta, S. C. and Kapoor, V. K., Fundamentals of Mathematical Statistics, Sultan Chand & Sons.
 Sharma, J. K., Discrete Mathematics, Macmillan.
 Wilson: Introduction to Graph Theory, Pearson Education.
 Mapa, S. K., Higher algebra: Abstract and Linear, Levant , 2011.
 Grewal, B. S., Higher Engineering Mathematics, Khanna Pub.
 Kreyzig, E. Advanced Engineering Mathematics, John Wiley and Sons.
 Spiegel, M. R., Schiller, J. J. and Srinivasan, R. A., Probability and Statistics (Schaum's Outline Series), TMH.

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