Discrete Mathematics

CSL223
Discrete Mathematics – CSL223

Course Code L-T-P Credits Type of Course Lectures

CSL223 3-0-0 3 Programme Core 45 Hours

Vision and Mission of the Department

To contribute significantly through adoption of contemporary

computing tools and technologies in academics, innovations,
socially relevant research and problem solving; to be recognized
universally as a promoter of emerging technologies for transforming
lives of individuals and society.

• To develop competent professionals with analytical skills and

independent thinking, through excellent undergraduate and
graduate education programmes to meet the needs of academia
and industry.
• To enhance theoretical and applied skills of faculty and students
through long-term national and international collaboration with
industry and research organizations.
• To continuously improve physical, academic, IT and computing
infrastructure.
• To contribute towards social upliftment by focusing on
entrepreneurship, data driven and research-based socially relevant
projects.
• To create a nurturing environment for lifelong learning skills.
Programme Outcomes
1. Engineering knowledge: Apply the knowledge of mathematics, science, engineering fundamentals, and an engineering specialization to the
solution of complex engineering problems.
2. Problem analysis: Identify, formulate, review research literature and analyze complex engineering problems reaching substantiated
conclusions using first principles of mathematics, natural and engineering sciences.
3. Design/development of solutions: Design solutions for complex engineering problems and design system components or processes that meet a
specific requirement with appropriate consideration for the public health and safety and the cultural, societal and environmental
considerations.
4. Conduct investigations for the complex problems: Use research-based knowledge and research methods including design of experiments,
analysis and interpretation of data and synthesis of the information to provide valid conclusions.
5. Modern tool usage: Create, select and apply appropriate techniques, resources and modern engineering and IT tools including prediction and
modeling to complex engineering activities with an understanding of the limitations.
6. The engineer and society: Apply reasoning informed by the contextual knowledge to assess societal, health, safety, legal and cultural issues
and the consequent responsibilities relevant to the professional engineering practice.
7. Environment and sustainability: Understand the impact of the professional engineering solutions in societal and environmental contexts, and
demonstrate the knowledge of and need for sustainable development.
8. Professional Ethics: Apply ethical principles and commit to professional ethics and responsibilities and norms of the engineering practice.

9. Individual and team work: Function effectively as an individual and as a member or leader in diverse teams and in multidisciplinary settings.

10. Communication: Communicate effectively on complex engineering activities with the engineering community and with the society at large. Will
be able to comprehend and write effective reports and design documentation, making effective presentations and guide with themselves and
others with clear instructions.
11. Project management and finance: Demonstrate knowledge and understanding of the engineering and management principles and apply these
to one’s own work being a member and leader in a team, to manage projects and in multidisciplinary environments.
12. Life-long learning: Recognize the need for and have the preparation and ability to engage in independent and life-long learning in the broad
context of technological change.
 COURSE OUTCOMES
Apply the operations of sets and use Venn diagrams to solve applied
CO1
problems; solve problems using the principle of inclusion-exclusion
Simplify and evaluate basic logic statements including compound
CO2 statements, implications, inverses, converses, and contrapositives using
truth tables and the properties of logic.
Identify and implement the base step and the recursive or inductive
CO3 step in applied problems and give a recursive and a non-recursive
definition for an iterative algorithm.

Apply the various algebraic structures in the various research field like
CO4
cryptography.

Perform tree traversals using preorder, inorder, and postorder traversals

CO5 and apply these traversals to application problems; use binary search
trees or decision trees to solve problems.
 Syllabus
• Unit Number: 1 Title: Set Theory
Content Summary:
Introduction to set theory, Set operations, Algebra of sets, Duality, Finite and Infinite sets, Classes of sets, Power
Sets, Multi sets, Cartesian Product, Representation of relations, Types of relation, Equivalence relations and
partitions, Partial ordering relations and lattices, Function and its types, Composition of function and relations.
• Unit Number: 2 Title: Propositional Calculus
Content Summary:
Basic operations: AND, OR, NOT, Truth value of a compound statement, propositions, tautologies,
contradictions, Techniques of Counting: Permutations with and without repetition, Combination.
• Unit Number: 3 Title: Recursion and Recurrence Relation
Content Summary:
Linear recurrence relation with constant coefficients, Homogeneous solutions, particular solutions, Total
solution of recurrence relation using generating functions
• Unit Number: 4 Title: Algebraic Structures
Content Summary:
Algebraic Structures Definition and examples of a monoid, Semigroup, Groups, abelian group and rings,
Subgroups and Normal subgroups, Cyclic groups, Integral domain and fields, Cosets, Lagrange's theorem
• Unit Number: 5 Title: Graphs and Trees
Content Summary:
Introduction to graphs, Directed and Undirected graphs, Homomorphic and Isomorphic graphs, Sub
graphs, Cut points and Bridges ,Multigraph and Weighted graph, Paths and circuits, Shortest path in
weighted graphs, Euler path and circuits, Hamilton paths and circuits, Planar graphs, Euler's formula,
Trees, Spanning trees, Binary trees and its traversals.
Evaluation Scheme
Discrete Mathematics
Component Marks

Minor 25

Major 45

Online Quiz 20

Class Performance 10
 Introduction
Mathematics can be broadly classified into two
categories
• Continuous Mathematics − It is based upon
continuous number line or the real numbers. It
is characterized by the fact that between any
two numbers, there are almost always an infinite
set of numbers. For example, a function in
continuous mathematics can be plotted in a
smooth curve without breaks.
• Discrete Mathematics − It involves distinct
values; i.e. between any two points, there are a
countable number of points. For example, if we
have a finite set of objects, the function can be
defined as a list of ordered pairs having these
objects, and can be presented as a complete list
of those pairs.
8
 What is Discrete Mathematics?
• Discrete mathematics is the study
of mathematical structures that are
fundamentally discrete rather than continuous.
In contrast to real numbers that have the
property of varying "smoothly", the objects
studied in discrete mathematics – such
as integers, graphs, and statements in logic – do
not vary smoothly in this way, but have distinct,
separated values
• It excludes topics in "continuous mathematics"
such as calculus or Euclidean geometry.
• The set of objects studied in discrete
mathematics can be finite or infinite.

9
Intuitive ways of thinking about discrete
vs continuous distinction
• A piano makes music in a "discrete" way: On a piano, there is no
note between C and C#. But a violin makes music in a
"continuous" way: There are (in theory at least) a continuum of
notes between C and C#.
• An analog clock (i.e., a clock with hands) is (at least in theory)
continuous: The set of times that it can show is not only dense,
but it can even tell you when it is π o'clock. But a digital clock is
discrete: In a typical digital clock, there is no time between
3:14 PM and 3:15 PM.
• Discrete math concerns sets of objects that are countable.
Continuous math concerns sets of objects that are "measurable".
• A film, with "frames", is discrete.
The real events depicted on the film are continuous.
10
Topics of Discrete Mathematics
• Information theory: studies the quantification, storage, and communication
of information.
• Logic: is the study of the principles of valid reasoning and inference, as well as
of consistency, soundness, and completeness
• Set theory: the branch of mathematics that studies sets, which are collections of
objects, such as {blue, white, red} or the (infinite) set of all prime numbers. Partially
ordered sets and sets with other relations have applications in several areas.
• Combinatorics: studies the way in which discrete structures can be combined or
arranged.
• Graph theory: is the study of points and lines. In particular, it involves the ways in
which sets of points, called vertices, can be connected by lines or arcs, called edges.
• Probability: is concerned with the analysis of random phenomena. The outcome of a
random event cannot be determined before it occurs, but it may be any one of several
possible outcomes. The actual outcome is considered to be determined by chance.

11
Topics of Discrete Mathematics
• Number theory: is concerned with the properties of numbers in general,
particularly integers. It has applications to cryptography and cryptanalysis.
• Algebraic structures: A non-empty set G equipped with one or more binary
operations is said to be an algebraic structure. Suppose * is a binary operation
on G. Then (G, *) is an algebraic structure
• Game theory: deals with situations where success depends on the choices of
others, which makes choosing the best course of action more complex.
• Operations research: provides techniques for solving practical problems in
engineering, business, and other fields — problems such as allocating
resources to maximize profit, and scheduling project activities to minimize
risk.
• Mathematical induction and recurrence : is a technique used to prove a
proposition that involves an integer variable. Frequently the proposition is an
identity or an inequality involving an integer n such as 1+2+4+ ··· + 2n−1 =
2n − 1 for n = 1, 2,...,

12
 Everyday Applications of Discrete Maths

Computers run software and store files. The software and files are both stored as huge strings of 1s and 0s. Binary maths is discrete
mathematics.

Scheduling problems: like deciding which nurses should work which shifts, or which airline pilots should be flying which routes, or
scheduling rooms for an event, or deciding timeslots for committee meetings, or which chemicals can be stored in which parts of a
warehouse---are solved either using graph coloring or using combinatorial optimization, both parts of discrete mathematics.

Cell phone communications: Making efficient use of the broadcast spectrum for mobile phones uses linear algebra and information
theory. Assigning frequencies so that there is no interference with nearby phones can use graph theory or can use discrete optimization.

Google Maps uses discrete mathematics to determine fastest driving routes and times.

And many more....

13
Topics to be covered

Recursion
Propositional And Algebraic Graphs And
Set Theory Recurrence
Calculus Structures Trees
Relation
Evaluation Scheme
Minor Test (25 Marks)
Major Exam(45 Marks)
Online quiz(20 Marks)
Class Performance (10 Marks)

15
Resources to be used:
Textbooks:
• Kolman, Busby and Ross, “Discrete Mathematics and its
Applications”, Pearson; 6 edition , 2008
• Trembly J.P and Manohar R, “Discrete Mathematical Structures
with Applications to Computer Science”, Tata McGraw–Hill Pub.
Co. Ltd, 2003.
Reference Books:
• 1. .Kenneth H.Rosen, “Discrete Mathematics and its
Applications”, Fifth Edition, Tata McGraw – Hill Pub. Co. Ltd,2003.
Reference Websites: (nptel, swayam, coursera, edx, udemy,
lms, official documentation weblink)
• https://nptel.ac.in/courses/106106094/

16
•C

17