Discrete Mathematics (1208)

Course Teacher

1
• How many ways are there to choose a valid password on a
computer system?
• What is the probability of winning a lottery?
• Is there a link between two computers in a network?
• How can I identify spam e-mail messages?
• How can I encrypt a message so that no unintended recipient can
read it?
• What is the shortest path between two cities using a transportation
system?
• How can a list of integers be sorted so that the integers are in
increasing order?
• How many steps are required to do such a sorting?
• How can it be proved that a sorting algorithm correctly sorts a list?
• How can a circuit that adds two integers be designed?
• How many valid Internet addresses are there?

2
 Today’s topics
• Teaching Discrete Mathematics
• Active Learning in Discrete Mathematics

3
 About the course
• Course Code: CSE-1209
• Course Title: Discrete Mathematics
• Course Teacher: Selina Sharmin
• Credit: 3
• Total Marks: 100
• Lecture: 28
• Two Mid exam (20)
• Assessment (10) Presentations +
Attendance
• Final Exam (70) 4
• Discrete Mathematics and Its applications
• Kenneth H Rosen

7/1/2008 IUCEE: Discrete Mathematics 5

 Course overview

• Logic
• Reasoning
• Set Theory
• Number Theory
• Counting
• Probability
• Relations
• Graph Theory 6
 Analyzing the course and
content
• What is the purpose of each unit?
– Long term impact on students
• What are the learning goals of each unit?
– How are they evaluated
• What strategies can be used to make
material relevant and interesting?
• How does the context impact the content

7
 Broader goals
• Analysis of course content
– How does this apply to the courses that you
teach?
• Reflect on challenges of your courses

8
 What Is Discrete Mathematics
In Computer Science?
• Discrete mathematics is the part of mathematics
devoted to the study of discrete objects.
• Discrete means consisting of distinct or
unconnected elements.
• The term discrete mathematics refers to the study of
discrete (i.e. A distinct object (e.g. Computer science
is important because information is stored and
manipulated in a discrete manner in computing
machines.

9
• Discrete mathematics is used whenever objects are
counted, when relationships between finite (or
countable) sets are studied, and when processes
involving a finite number of steps are analyzed.
•
A key reason for the growth in the importance of discrete
mathematics is that information is stored and
manipulated by computing machines in a discrete
fashion.

• When Did Discrete Mathematics Begin?

• “Discrete Mathematics” was introduced to university
curricula in the 1980s as a computer science support
course; its contents were somewhat haphazard at the
time.
10
 Application
• Applications are mostly in Computer Science.
• Symbolic logic is used in framing algorithms and their verification and in
automatic theorem proving.
• Set theory, Graph Theory, trees etc are used in storage and retrieval of
information (data structures),
• Algorithms and their complexity studies also uses tools from discrete
mathematics. Formal Languages, Automata theory, Turing machines etc
are themselves part of discrete mathematics and so is Recursive Function
Theory.
• Undecidability of many problems are established using Turing machines
which is the Mathematical model for studying theoretical limitations of
Computation.
• Lattices and Boolean Algebra are used in Computer Science as well as in
communications and networking.
• Several parts of discrete mathematics like sets, relations and functions
and Graph Theory are also used extensively in other areas of
mathematics.
11
 Who Is The Father Of Discrete Mathematics?

Paul Erdős
26 March 1913 Budapest, Austria-
Born
Hungary
20 September 1996 (aged 83)
Died
Warsaw, Poland
Nationality Hungarian
Royal Hungarian Pázmány Péter
Alma mater
University 12
13
• Computers run software and store files.
The software and files are both stored as huge strings of 1s a
nd 0s.
Binary math is discrete mathematics.

• Networks are, at base, discrete structures. The

routers that run the internet are, at base, discrete structures.
The routers that run the internet are connected by long cables.
People are connected to each other by social media (
"following" on Twitter are, at base, discrete structures. The routers
that run the internet are connected by long cables. People are
connected to each other by social media ("following" on Twitter,
"friending" on Facebook are, at base, discrete structures.
The routers that run the internet are connected by long cables.
People are connected to each other by social media ("following" on
Twitter, "friending" on Facebook, etc.). The US highway system
connects cities with roads.
14
• Why Is It Called Discrete Math?
• It is not the name of a branch of mathematics, such as
number theory, algebra, calculus, etc. Rather, it is a
description of a set of branches of mathematics that all
share the same characteristic, which is that they are
“discrete” rather than continuous.
• Is Discrete Mathematics Important For Computer
Science?
• In computing, Discrete Mathematics is a fundamental
foundation, and its applications are vast. All of a
computer’s data is represented by bits (zeros and ones).

15
• 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. One example is
scheduling games for a professional sports league

16
• Scaling COVID-19 testing by more
efficiently using patient samples is assisted by
linear algebra
• Encryption and decryption are part
of cryptography, which is part of discrete
mathematics. For example,
secure internet shopping uses public-key
cryptography.

17
• Designing password criteria is a counting
problem: Is the space of passwords chosen
large enough that a hacker can't break into
accounts just by trying all the possibilities?
How long do passwords need to be in order
to resist such attacks? (find out here!)
18
• Apportionment: In the U.S., the legislative branch of the
government has a House of Representatives with 435
members. The process of deciding how many of these
members should be allocated to each state is called
apportionment: In the U.S., the legislative branch of the
government has a House of Representatives with 435
members. The process of deciding how many of these
members should be allocated to each state is
called apportionment, and there is a lot of discrete
mathematics involved---both in creating and implementing
various apportionment methods. 19
• Managing Health Care Resources:
Medical procedures require space and
health care workers and equipment. We
want to not waste space and schedule
staff well and make sure equipment is both
used and maintained, and we want these
resources to be allocated equitably. A type
of discrete mathematics known as
integer programming is used in optimizing
hospital resources
. 20
• Voting systems: There are
different methods for voting: There
are different methods for voting---not just
the common cast-a-ballot-for-exactly-one-
candidate method. The study of
possible voting methods and how well
their outcomes reflect the intent of the
voters uses discrete mathematics.

• Bankruptcy proceedings can involve

lots of different reasonable ways to resolve
claims
. Some involve discrete optimization. 21
• Wiring a computer network using the
least amount of cable is a
minimum-weight spanning tree problem.
• Area codes: How do we know when we
need more area codes to cover the phone
numbers in a region? This is a basic
combinatorics problem.

22
• Food Webs: A food web describes the
ways in which a set of species eat (and
don't eat) each other. They can be studied:
A food web describes the ways in which a
set of species eat (and don't eat) each
other. They can be studied using: A food
web describes the ways in which a set of
species eat (and don't eat) each other.
They can be studied using graph: A food
web describes the ways in which a set of
species eat (and don't eat) each other.
They can be studied using graph theory.
23
 References
• http://www.mathily.org/dm-rw.html#:~:text=
An%20analog%20clock%20has%20gears,
is%20part%20of%20discrete%20mathema
tics
.
• Internet

24