FACULTY OF INFORMATION TECHNOLOGY

DEPARTMENT OF COMPUTER SCIENCE

501044
Discrete Structures

Introduction

1
501044 - Discrete Structures
Information

Credits 4(3,1)

Time Theory/ 45 Practice/ 30 Self-Study 120

allocation Exercise Discussion (hours):
(periods): (periods):

Prerequisite No Prerequisite No
Code

501044 - Discrete Structures 2

Course Objectives

REMEMBER BASIC DISCRETE UNDERSTAND PROOF APPLY DISCRETE ALGORITHMS APPLY DISCRETE STRUCTURE IN
STRUCTURES. TECHNIQUES, ALGORITHMS TO SOLVE PROBLEMS. PROGRAMING.
RELATED TO DISCRETE
STRUCTURES.

501044 - Discrete Structures 3

Course Learning Outcomes (CLOs)

Recognize basic discrete Explain proof techniques, Apply discrete algorithms Implement an algorithm
structures. algorithms related to to solve professional tasks. to solve a specific
discrete structures. problem.

501044 - Discrete Structures 4

 • Students will be provided
mathematics knowledge/structure
that widely used in information
technology
• Theory:
• Logic and Statement
Course • Proof techniques
summary • Properties of numbers and special
sequences
• Set and Set relation
• Graph and Tree
• Practical class: Using Python to
implement algorithms and
applications of learned structures.
5
501044 - Discrete Structures
 ATTENDANCE FULL PARTICIPATION IN
CLASS ACTIVITIES
Student’s
tasks

COMPLETE HOMEWORK
ASSIGNMENTS

501044 - Discrete Structures 6

 Chapter 1: Logic of Compound
Statements
Organization of teaching
Prerequisite-
Session Content Self-Study CLOs related Student's tasks
T E P D content

01-02 - Logical Form 6 0 3 0 15 [1], [2], At class:

- Logical Equivalence [3], [4] - Positive listening, asking questions.
- Conditional Statements - Do the exercises required by the
- Valid Arguments instructor.
- Invalid Arguments
After class:
Teaching methods: - Read the lecture before class
- Presentation - Do homework.
- Discussion - Read [1], chapter 2
- Exercise

501044 - Discrete Structures 7

 Chapter 2: Logic of Quantified
Statements
Organization of teaching
Prerequisite-
Session Content Self-Study CLOs related Student's tasks
T E P D content

03-04 - Predicates 6 0 3 0 15 [1], [2], At class:

- Quantifiers [3], [4] - Positive listening, asking questions.
- Quantified Statement - Do the exercises required by the
- Statements with Multiple instructor.
Quantifiers
- Arguments with Quantified After class:
Statements - Read the lecture before class
- Do homework.
Teaching methods: - Read [1], chapter 3
- Presentation
- Discussion
- Exercise

501044 - Discrete Structures 8

 Chapter 3: Proof techniques
Organization of teaching
Prerequisite-
Session Content Self-Study CLOs related Student's tasks
T E P D content

05-06 - Proof by Construction: 6 0 3 0 15 [1], [2], At class:

Existence Proof, Disproof by [3], [4] - Positive listening, asking questions.
Counterexample - Do the exercises required by the
- If-then Statements instructor.
- For-all Statements
- Proof by Contradiction After class:
- Proof by Controposition - Read the lecture before class
- Do homework.
Teaching methods: - Read [1], chapter 4
- Presentation
- Discussion
- Exercise

501044 - Discrete Structures 9

 Chapter 4: Number theory
Organization of teaching
Prerequisite-
Session Content Self-Study CLOs related Student's tasks
T E P D content

07-08 - Prime numbers: properties, 6 0 6 0 18 [1], [2], At class:

application, primality test [3], [4] - Positive listening, asking questions.
- Well Ordering Principle - Do the exercises required by the
- Quotient-Remainder Theorem instructor.
- Representation of integers
- Least Common Multiple After class:
- Euclid's algorithm - Read the lecture before class
- Greatest Common Divisor - Do homework.
- Modulo arithmetic - Read [1], chapter 4

Teaching methods:
- Presentation
- Discussion
- Exercise

501044 - Discrete Structures 10

 Chapter 5: Sequence and recursion
Organization of teaching
Prerequisite-
Session Content Self-Study CLOs related Student's tasks
T E P D content

09 - Sequences: Explicit formula, 3 0 3 0 9 [1], [2], At class:

recurrence relation [3], [4] - Positive listening, asking questions.
- Common sequences - Do the exercises required by the
- Solving recurrences instructor.
- Application: Tower of Hanoi
After class:
Teaching methods: - Read the lecture before class
- Presentation - Do homework.
- Discussion - Read [1], chapter 5
- Exercise

501044 - Discrete Structures 11

 Chapter 6: Set and Relation
Organization of teaching
Prerequisite-
Session Content Self-Study CLOs related Student's tasks
T E P D content

10-11 - Basic Set Theory 6 0 3 0 15 [1], [2], At class:

- Operation on Sets [3], [4] - Positive listening, asking questions.
- Cartesian product - Do the exercises required by the
- N-ary relation instructor.
- Properties of Relations on a
Set After class:
- Equivalence Relations - Read the lecture before class
- Transitive Closure - Do homework.
- Partial and Total Orders - Read [1], chapter 6, 8
- Set cardinality and infinity

Teaching methods:
- Presentation
- Discussion
- Exercise

501044 - Discrete Structures 12

 Chapter 7: Graph
Organization of teaching
Prerequisite-
Session Content Self-Study CLOs related Student's tasks
T E P D content

12-13 - Definitions 6 0 6 0 18 [1], [2], At class:

- Properties of the graph [3], [4] - Positive listening, asking questions.
- Paths and cycles on the graph - Do the exercises required by the
- Graphical representation instructor.
- Graph isomorphism
- Planar graphs After class:
Teaching methods: - Read the lecture before class
- Presentation - Do homework.
- Discussion - Read [1], chapter 10
- Exercise [2], chapter 9

501044 - Discrete Structures 13

 Chapter 8: Tree
Organization of teaching
Prerequisite-
Session Content Self-Study CLOs related Student's tasks
T E P D content

14-15 - Definitions 6 0 3 0 15 [1], [2], At class:

- Properties of the Tree [3], [4] - Positive listening, asking questions.
- Binary tree - Do the exercises required by the
- Tree traversal instructor.
- Spanning tree
- Minimum spanning tree After class:
algorithms - Read the lecture before class
- Shortest path algorithms - Do homework.
Teaching methods: - Read [1], chapter 10
- Presentation [2], chapter 10
- Discussion
- Exercise

501044 - Discrete Structures 14

Textbook
• [1]. Susanna S. Epp, [2011],
Discrete Mathematics with
applications, 4th edition,
Brooks/Cole, Boston.

501044 - Discrete Structures 15

Recommended texts
• [2]. Kenneth H. Rosen, [2012], Discrete
mathematics and its applications, 7th edition,
McGraw-Hill, New York.
• [3]. Allan Stavely, [2014], Programming and
mathematical thinking: A gentle introduction to
discrete math featuring Python, The New Mexico
Tech Press, Socorro, New Mexico.

501044 - Discrete Structures 16

Other readings
• [4]. R. P. Grimaldi, [2004], Discrete and
Combinatorial Mathematics: An Applied
Introduction, 5th edition, Pearson Education,
Boston.
• [5]. Rowan Garnier, John Taylor, [2002], Discrete
Mathematics for New Technology, 2nd edition,
Institute of Physics, Bristol, Philadelphia.

501044 - Discrete Structures 17

 Assessment

Weight
Category Type of questions
(%)
Progress 1 10 Process exercise
Progress 2 20 Essay
Mid-term 20 Constructed-response test
Final term 50 Constructed-response test
18
501044 - Discrete Structures
 Thank you
for your listening
501044 - Discrete Structures 1
9