D I SC R E T E S T R UC T U R E S

by Ja y Mark T . Umba c
Prepared
NUMBER OF UNITS AND PRE-REQUISITES

For lecture: 2 units

For lab work: 1 unit
Pre-requisite Subject/s: CSC 100, GE 4
TENTATIVE TOPICS TO DISCUSS
• Discrete Structures: An overview
• Basic Logic
• Functions, Relations, and Sets
• Proof Techniques
• Basics of Counting
• Divisibility
• Modular Arithmetic
• Introduction to Digital Logic and Digital Systems
COURSE DESCRIPTION

• this course introduces the foundations of discrete mathematics as they apply to

computer science. Topics include functions, relations and sets, basic logic,
proof techniques, basics of counting and introduction to digital logic and digital
systems.
INTRODUCTION
WHAT IS DISCRETE ?
dis·crete / dis’krët.
Adjective: Individually separate and distinct.

“Some math fundamentally deals with stuff that is

individually separate and distinct”.
DISCRETE VS CONTINUOUS
Discrete Continuous

A set of data is said to be discrete if A set of data is said to be

the values belonging to the set are continuous if the values belonging
distinct and separate. to the set can take any value within
a finite or infinite interval

COUNTED MEASURED
DISCRETE VS CONTINUOUS
Examples of discrete data

• –number of boys in the class.

• –number of candies in a packet.
• –number of suitcases lost by an airline.
Examples of continuous data

• –height of a person.
• –time in a race.
• –distance traveled by a car.
But this discussion is not about these two quantitative variables. This part only aims to fully help
and understand the basic concept of discrete structures. Now that you have identified the
difference between continuous and discrete, the real question here is,

WHAT IS DISCRETE STRUCTURE ?

DISCRETE STRUCTURES
From the definition of a discrete object,

it is a collection of mathematical topics that examine and use

finite or countably infinite mathematical objects.
DISCRETE STRUCTURES
From the computer science side of things,

a set of discrete elements on which certain operations are

defined. Discrete implies noncontinuous and therefore discrete
sets include finite and countable sets but not uncountable sets
such as the real numbers.
WHY IS IT IMPORTANT ?
• Language and formalism for expressing ideas in computing
• Fundamental tasks in computing like translating imprecise specification into a working system
and getting the details right

• Computers use discrete structures to represent and manipulate data.

• Defining a problem requires mathematical rigor
• Use and analysis of models, data structures, algorithms requires a solid foundation of
mathematics

• To justify why a particular way of solving a problem is correct or efficient requires analysis with a
well-defined mathematical model.
DISCRETE STRUCTURES AND COMPUTER SCIENCE

Concepts from discrete mathematics are useful for describing objects and
problems in computer algorithms and programming languages. It is basically
applying the concepts of discrete mathematics to computer science which
creates the foundations of discrete structures.
WHY STUDY DISCRETE MATHEMATICS IN COMPUTER
SCIENCE ?
It does not directly help us write programs. At the same time, it is the mathematics underlying
almost all of computer science. Here are a few examples:
• Designing high-speed networks and message routing paths.

• Finding good algorithms for sorting.

• Performing web searches.

• Analyzing algorithms for correctness and efficiency.

• Formalizing security requirements.

• Designing cryptographic protocols.

APPLICATIONS OF DISCRETE MATHEMATICS IN
COMPUTER SCIENCE

• Discretemathematics describes processes that consist of a sequence of

individual steps. this contrasts with calculus, which describes processes that
change in a continuous fashion.

• Whereas the ideas of calculus were fundamental to the science and technology
of the industrial revolution, the ideas of discrete mathematics underlie the
science and technology of the computer age.
CONCLUSION
• In the end, we will learn to write precise mathematical statements that captures what
we want in each application, and learn to prove things about these statements. For
example, how do we state, in mathematical terms, that a banking protocol allows a user
to prove that she knows her password, without ever revealing the password itself?

• This topic may be difficult to deal with but it is always exciting to go in an unknown
adventure where you discover a lot of things along the way. All you have to do is be
patient and of course, study your plans (or your lessons) and get ready to come in a
battle prepared.