Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
6 views

Introduction

Uploaded by

fahimalrazy2005
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
6 views

Introduction

Uploaded by

fahimalrazy2005
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 7

Discrete Mathematics

Intro to DM
Discussion
Discrete Mathematics and Its Applications
Kenneth H Rosen, New York: McGraw-Hill, 2019 (2003)

The book was sold more than 450K copies in US and is taught in more than 600
North American schools. It has been translated into Spanish, French, Portuguese,
Greek, Chinese, Vietnamese and Korean.

This text is designed for a one- or two-term introductory discrete mathematics


course taken by students in a wide variety of majors, including mathematics,
computer science, and engineering. College algebra is the only explicit
prerequisite, although a certain degree of mathematical maturity is needed to
study discrete mathematics in a meaningful way.
Intro to DM
Discussion
Goals of a DM course
1. Mathematical Reasoning: to understand and construct mathematical
reasoning starting with mathematical logic, mathematical induction
2. Combinatorial Analysis: ability of enumerating objects, counting
3. Discrete Structures: abstract mathematical structures like sets, permutations,
relations, graphs, trees, finite state machines
4. Algorithmic Thinking: Some problems are solved by the specification of an
algorithm, verification that it works properly and analysis of resource
requirements
5. DM has applications to computer science, data networking, chemistry,
biology, linguistics, geography, business and internet
Intro to DM
Topic Coverage Discussion

▶ Logic: Several logical puzzles have been introduced. A new example explains how to model the n-queens
problem as a satisfiability problem that is both concise and accessible to students.

▶ Set theory: Multisets are now covered in the text. (Previously they were introduced in the exercises.

▶ Algorithms: The string matching problem, an important algorithm for many applications, including spell checking,
keyword searching, string-matching, and computational biology, is now discussed. The brute-force algorithm for
solving string-matching exercises is presented.

▶ Number theory: The new edition includes the latest numerical and theoretical discoveries relating to primes and
open conjectures about them. The extended Euclidean algorithm, a one-pass algorithm, is now discussed in the
text.

▶ Cryptography: The concept of homomorphic encryption, and its importance to cloud computing, is now covered
Intro to DM
Topic Coverage (cont) Discussion

▶ Mathematical induction: The template for proofs by mathematical induction has been expanded. It is now placed in the
text before examples of proof by mathematical induction.

▶ Counting methods: The coverage of the division rule for counting has been expanded

▶ Data mining: Association rules—key concepts in data mining—are now discussed in the section on n-ary relations.
Also, the Jaccard metric, which is used to find the distance between two sets and which is used in data mining, is
introduced in the exercises.

▶ Graph theory applications: A new example illustrates how semantic networks, an important structure in artificial
intelligence, can be modeled using graphs

▶ Biographies: New biographies of Wiles, Bhaskaracharya, de la Vallee-Poussin, ´ Hadamard, Zhang, and Gentry have
been added. Existing biographies have been expanded and updated. This adds diversity by including more historically
important Eastern mathematicians, major nineteenth and twentieth century researchers, and currently active twenty-first
century mathematicians and computer scientists.
Intro to DM
For students Discussion

What is discrete mathematics? Discrete mathematics is the part of mathematics devoted to the
study of discrete objects. (Here discrete means consisting of distinct or unconnected elements.)

The kinds of problems solved using discrete mathematics include:

▶ 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?
Intro to DM
Discussion
For students
WHY STUDY DISCRETE MATHEMATICS?

There are several important reasons for studying discrete mathematics. First, through this course you can develop
your mathematical maturity: that is, your ability to understand and create mathematical arguments. You will not get
very far in your studies in the mathematical sciences without these skills. Second, discrete mathematics is the
gateway to more advanced courses in all parts of the mathematical sciences. Discrete mathematics provides the
mathematical foundations for many computer science courses, including data structures, algorithms, database
theory, automata theory, formal languages, compiler theory, computer security, and operating systems. Students find
these courses much more difficult when they have not had the appropriate mathematical foundations from discrete
mathematics. One student sent me an e-mail message saying that she used the contents of this book in every
computer science course she took! Math courses based on the material studied in discrete mathematics include
logic, set theory, number theory, linear algebra, abstract algebra, combinatorics, graph theory, and probability theory
(the discrete part of the subject). Also, discrete mathematics contains the necessary mathematical background for
solving problems in operations research (including discrete optimization), chemistry, engineering, biology, and so on.
In the text, we will study applications to some of these areas.

You might also like