KEMBAR78
Discrete Structures 1 - Week 1 | PDF | Discrete Mathematics | Mathematics
Scribd
Upload
3K views8 pages

Discrete Structures 1 - Week 1

This document provides an introduction to a course on discrete structures. It defines discrete mathematics as the study of discrete objects and processes involving a finite number of steps. The objectives of the course are to define discrete mathematics, familiarize students with its goals, and help students appreciate its study. Some goals of discrete mathematics discussed are mathematical reasoning, combinatorial analysis, discrete structures, algorithmic thinking, and applications/modeling. Reasons given for studying discrete mathematics are to develop mathematical maturity and provide foundations for computer science courses.

Uploaded by

Jamel Pandiin
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
3K views8 pages

Discrete Structures 1 - Week 1

This document provides an introduction to a course on discrete structures. It defines discrete mathematics as the study of discrete objects and processes involving a finite number of steps. The objectives of the course are to define discrete mathematics, familiarize students with its goals, and help students appreciate its study. Some goals of discrete mathematics discussed are mathematical reasoning, combinatorial analysis, discrete structures, algorithmic thinking, and applications/modeling. Reasons given for studying discrete mathematics are to develop mathematical maturity and provide foundations for computer science courses.

Uploaded by

Jamel Pandiin
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 8

Discrete

Structures 1
Jamel D. Pandiin
ACLC Local_OLC
April 4, 2021
Introduction

It is a common perception for students who would like


to take IT Education to choose programs other than
Computer Science. This is mainly because they want to
avoid the courses of mathematics such as Discrete
Mathematics or Discrete Structure. Little do they know
that the study of mathematics, particularly Discrete
Mathematics, is a pre-requisite knowledge in order to
learn algorithms used in computer programming.
This course will teach you sets of mathematical facts
and how to apply them, more importantly, the course
would teach you how to think logically and
mathematically.

2 Discrete Structures 1 9/30/21


Objectives

After completing this module, you should be able to:


1. Define Discrete Mathematics.
2. Familiarize with goals of Discrete Mathematics.
3. Appreciate the study of Discrete Mathematics.

3 Discrete Structures 1 9/30/21


Discrete
Mathematics
Discrete mathematics is the part of mathematics
devoted to the study of discrete objects.
• Discrete mathematics describes processes that consist
of a sequence of individual steps.
• 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.

4 Discrete Structures 1 9/30/21


Goals of Discrete Mathematics

Mathematical Reasoning Combinatorial Analysis

 Students must understand mathematical reasoning in  An important problem-solving skill is the ability to
order to read, comprehend, and construct mathematical count or enumerate objects.
arguments.

5 Discrete Structures 1 9/30/21


Goals of Discrete Mathematics

Discrete Structures Algorithmic Thinking Applications and Modeling

 A course in discrete mathematics  Certain classes of problems are  Discrete mathematics has applications
should teach students how to work solved by the specification of an to almost every conceivable area of
with discrete structures, which are algorithm. After an algorithm has study. There are many applications to
the abstract mathematical structures computer science and data networking,
been described, a computer
as well as applications to such diverse
used to represent discrete objects program can be constructed areas as chemistry, biology, linguistics,
and relationships between these implementing it. geography, business, and the Internet.
objects.

6 Discrete Structures 1 9/30/21


Reasons for Studying Discrete Mathematics

1. To develop your mathematical maturity: that is, the ability to


understand and create mathematical arguments;

2. It 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.

7 Annual Review 9/30/21


Thank you
References:

1. Kenneth H. Rosen. Discrete Mathematics and Its Applications, 7th Edition. McGrawHill, 2012

2. Gary Weiss Damian Lyons, et al., Fundamentals of Discrete Structures, 2nd edition, Pearson Learning Solutions, 2012.

3. Susanna S. Epp, Discrete Mathematics with Applications, Brooks Cole; 4th edition, 2011.

4. James L. Hein, Discrete Structures, Logic, and Computability, 3rd edition, Jones & Bartlett Publishers, 3rd edition, 2009.

5. Kolman, B., Busby, R. C., Ross, S. C. Discrete Mathematical Structures, 6th Edition. Prentice Hall, 2008.

You might also like