Scribd
Upload
67 views18 pages

Lesson 1 Introduction To Discrete Math

This document provides information about an online discrete mathematics course taught by Ms. Krystel Jane L. Ajius. The course introduces students to discrete mathematics topics like logic, proof, sets, functions, and algorithms. It has both synchronous and asynchronous components. Students will learn through lessons, videos, lectures and projects submitted on Google Classroom. The document reminds students about email addresses, deadlines, attendance and provides an example of counting handshakes at a party to introduce discrete concepts.

Uploaded by

Jane Ajias
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
Download as pptx, pdf, or txt
67 views18 pages

Lesson 1 Introduction To Discrete Math

This document provides information about an online discrete mathematics course taught by Ms. Krystel Jane L. Ajius. The course introduces students to discrete mathematics topics like logic, proof, sets, functions, and algorithms. It has both synchronous and asynchronous components. Students will learn through lessons, videos, lectures and projects submitted on Google Classroom. The document reminds students about email addresses, deadlines, attendance and provides an example of counting handshakes at a party to introduce discrete concepts.

Uploaded by

Jane Ajias
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
Download as pptx, pdf, or txt
Download as pptx, pdf, or txt
You are on page 1/ 18

ONLINE CLASS

MS. KRYSTEL JANE L. AJIAS


Course Title: Discrete Mathematics (MS 101)
Course Description:
This is an introductory course in discrete mathematics. The
goal of this course is to introduce students to ideas and techniques
from discrete mathematics that are widely used in science and
engineering. This course teaches the students techniques in how to
think logically and mathematically and apply these techniques in
solving problems. To achieve this goal, students will learn logic and
proof, sets, functions, as well as algorithms and mathematical
reasoning. Key topics involving proposition, truth tables, logic
gates, laws of Boolean algebra are covered in this course.

Pre-requisite : Probability and Statistics (IT 102)


Two types of Class (Synchronous & Asynchronous)
Synchronous Meetings
-it means that everyone must go online at the same time.
Applications:
* Google Meet

Asynchronous class
- it means that we can still communicate and it does NOT require
everyone to be online at the same time.

Applications:
* Google Classroom – where you will submit your quizzes, projects,
assignments.
- lessons , videos and lectures will be posted.

NOTE: All Quizzes , activities and Projects will be sent ONLY within a specified
given period of time.
REMINDERS
 Wrong Email Address
 Unaware of Deadline
 Late Submissions of Work – demerits of points
 Attendance
 Absent
 Late – 3o mins
LESSON 1
INTRODUCTION TO
DISCRETE MATHEMATICS
MS. KRYSTEL JANE L. AJIAS
• DISCRETE

Can be read as : dis·crete / dis’krët.

Synonyms: separate, detached , distinct.

• Discrete mathematics is the study of mathematical structures that are fundamentally discrete
rather than continuous.

• 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.

 
Consider the function which gives the number of children of each person
reading this. What is the range? I’m guessing it is something like {0,1,2,3}.
Maybe 4 is in there too. But certainly there is nobody reading this that has
1.32419 children.

Conclusion: This output set is discrete because the elements are


separated. { 0, 1, 2, 3,4 };
: This is also a discrete set because each Input is an individual
person.

Examples of structures that are discrete are combinations, graphs, and


logical statements.
Investigate !

The most popular mathematician in the world is throwing a party for


all of his friends. As a way to kick things off, they decided that
everyone should shake hands. Assuming all10 people at the party
each shake hands with every other person (but not themselves,
obviously) exactly once, how many handshakes take place?
1 2 3 4 5 6 7 8 9 10

9 9 9 9 9 9 9 9 9 9

10 x 9 = 90
Click icon to add picture
END
janeajias26@gmail.com
Proposition

You might also like