FPT UNIVERSITY

UNDERGRADUATE DEGREE PROGRAM IN SOFTWARE ENGINEERING

SYLLABUS
(Under Decision No. /QĐ-ĐHFPT dated / / )

1 Course Name
2 Course Code
3 No of credits
4 Degree Level

5 Time Allocation

6 Pre-requisite

7 Main objectives

8 Description

9 Student's task
10 Materials

11 Assessment scheme

12 Scoring scale
13 Schedule
14 Examination
15 Date of Approval
16 Approval Level
 FPT UNIVERSITY
ADUATE DEGREE PROGRAM IN SOFTWARE ENGINEERING
SYLLABUS
(Under Decision No. /QĐ-ĐHFPT dated / / )

DISCRETE MATHEMATICS

3
Bachelor
Contact sessions (90' each):
- Lectures: 15
- Tutorials: 15

Upon finishing the course, students must acquire:

1. the following knowledge: (ABET a.1)
• Concepts of logical expressions & predicate logic.
• The method of induction and recursive definition.
• Concepts of algorithms, recursive algorithms, the complexity.
• Recurrence relations and divide-and-conquer algorithms.
• Application of integers and congruence in information technology.
• Set structure and map, counting principles and combinatorics concepts.
• The applications of relations in databases and representation of relations.
• The terminologies and properties of graphs & trees & weighted graphs.
• The applications of graphs, trees and weighted graphs in information
technology.

2. the following skills: (ABET a.2)

• Manipulate logical expressions & produce equivalent logical expressions.
• Produce proof of simple mathematical propositions, including applying
induction method.
• Evaluate complexity of algorithms.
• Solving simple congruence equations.
• Apply counting techniques in evaluating various set cardinalities.
• Solve counting problems, apply in analyze algorithms.
• Manipulate relational structures
• Apply graph’s algorithms to solve problems related to graph theory.

This course is the first part of the coverage of mathematical foundation for
computer science. Topics included: logic, mathematical reasoning and proof
techniques, mathematical induction and recursion, set and maps, basic
number theory, counting techniques, combinatorics, discrete probability. The
course will expose students to the large range of applications of the
mathematical concepts in information technology; for example, application of
number theory in cryptography and computer security. The mathematics in
this course will provide the base for topics discussed in the second part:
Discrete Mathematics 2.
Students must attend more than 80% of contact hours in order to be accepted
to the final examination.
Main materials:
1) Student Textbook:
Kenneth Rosen, Discrete Mathematics and its applications. Ed.6, Mc.Graw
Hill, IE, 2006 http://www.mhhe.com/rosen (ST1)
2) Teaching Suggestion and Applications of Discrete Mathematics for ST1
(TS).
3) Testbank for ST1.
4) Powerpoint image in CD + Powerpoint prepared by previous lecturers (PP).
5) Computerized tools (for example C programming tools, Maxima
http://maxima.sourceforge.net/) (CT)
Other references:
1) Kenneth Rosen, Discrete Mathematics and its applications. Ed.7, Mc.Graw
Hill, IE, 2012 http://www.mhhe.com/rosen
2) Adam Drozdek. Data structure and Algorithms in Java. 3rd Edition.

• Ongoing assessment:
- 3 Progress tests: 15 questions/30 minutes 30% (a1)
- 04 Assignments: 30% (a2)
• Final Examination 40% (a1, a2)
• Completion Criteria: Every on-going assessment component > 0, Final
Result >=5 & Final Exam Score >=4
10
See Appendix 1 for Schedule Detail
See Appendix 2 for Final Exam Detail
DISCRETE STRUCTURES - COURSE SCHEDULE

Back to Syllabus

Category
Slot Contents (8 chapters)

Introduction to the subject

1 - The Foundations: Logic and Proofs
1 1.1 Propositional Logic Lecture

2 1.2-Propositional Equivalences Lecture

3 1.2 Propositional Equivalences Lecture

1.4 Nested Quantifiers

4 1.5 Rules of Inference Lecture

2 - Basic Structures: Sets, Functions, Sequences, and Sums

2.1- Sets
5 2.2- Set operations Lecture

6 2.3 Functions Lecture

7 2.4 Sequences and Summations Lecture

Assignment 1
8 Test 1/Review 1

3 - The Fundamentals: Algorithms, the Integers, and Matrices

3.1- Algorithms
9 3.2- The Growth of Functions Lecture

10 3.3 Compexity of Algorithms Lecture

11 3.4 The Integers and Division Lecture

12 3.5 Primes and Greatest Common Divisors Lecture

13 3.6 Intergers and Algorithms Lecture

4 - Induction and Recursion

4.1 Mathematical Induction
14 4.2 Strong Induction ( bỏ Well-Ordering) Lecture

4.3 Recursive Definitions and Structural Induction (bỏ định nghĩa tree)
15 4.4 Recursive Algorithms Lecture

Assignment 2
5- Counting (Gom chapter 5 & 7)
16 5.1- The Basics of Counting Lecture

7.1 Recurrence Relations

17 7.3-Divide-and-Conquer Algorithms and recurrence Relations Lecture

18 Test 2/ Review 2

8- Relations
8.1-Relations and Their Properties
19 8.2- n-ary Relations and Their Applications Lecture

8.1 Relations and Their Properties

20 8.3- Representing Relations Lecture

21 8.5 Equivalence Relations Lecture

Assignment 3
9- Graphs
9.1-Graphs and Graph Models
22 9.2-Graph Terminology and Special Types of Graphs Lecture

24 9.3 Representing Graphs and Graph Isomorphism Lecture

9.4 Connectivity
25 9.5- Euler and Hamilton Paths Lecture

26 9.6 Shortest-Path Problems Lecture

10- Trees
27 10.1-Introduction to Trees Lecture

28 10.2-Applications of Trees Lecture

29 10.3-Tree Traversal Lecture
Assignment 4
30 Test 3/Review 3 Lecture

http://www.csd.uwo.ca/~lila/discrete/
 Student's task Student's task
Teacher's Material
before class after class

Book, slides,
teacher guide

Read textbook, Book, slides, Read textbook,

exercises done teacher guide do exercises

Read textbook, Book, slides, Read textbook,

exercises done teacher guide do exercises

Read textbook, Book, slides, Read textbook,

exercises done teacher guide do exercises

Read textbook, Book, slides, Read textbook,

exercises done teacher guide do exercises

Read textbook, Book, slides, Read textbook,

exercises done teacher guide do exercises

Read textbook, Book, slides, Read textbook,

exercises done teacher guide do exercises

Read textbook, Book, slides, Read textbook,

exercises done teacher guide do exercises

Read textbook, Book, slides, Read textbook,

exercises done teacher guide do exercises

Read textbook, Book, slides, Read textbook,

exercises done teacher guide do exercises

Read textbook, Book, slides, Read textbook,

exercises done teacher guide do exercises
Read textbook, Book, slides, Read textbook,
exercises done teacher guide do exercises

Read textbook, Book, slides, Read textbook,

exercises done teacher guide do exercises

Read textbook, Book, slides, Read textbook,

exercises done teacher guide do exercises

Read textbook, Book, slides, Read textbook,

exercises done teacher guide do exercises

Read textbook, Book, slides, Read textbook,

exercises done teacher guide do exercises

Read textbook, Book, slides, Read textbook,

exercises done teacher guide do exercises

Read textbook, Book, slides, Read textbook,

exercises done teacher guide do exercises

Read textbook, Book, slides, Read textbook,

exercises done teacher guide do exercises

Read textbook, Book, slides, Read textbook,

exercises done teacher guide do exercises

Read textbook, Book, slides, Read textbook,

exercises done teacher guide do exercises

Read textbook, Book, slides, Read textbook,

exercises done teacher guide do exercises

Read textbook, Book, slides, Read textbook,

exercises done teacher guide do exercises

Read textbook, Book, slides, Read textbook,

exercises done teacher guide do exercises

Read textbook, Book, slides, Read textbook,

exercises done teacher guide do exercises
Read textbook, Book, slides, Read textbook,
exercises done teacher guide do exercises
 Back to Syllabus APPENDIX 2: ASSESSMENT STRUCTURE
Number
Type of of
# Catergory Part Weight Time
questions question
s

1 Assignments/ At least 5/
4 30% at home Open
Exercises chapter

10'-30' 15
MC or a
dependin questions
2 Progress Test 3 30% suitable
g on within 30
format
scope minutes

3 Final Exam Computer

Only one part 40% 60' 50
gradable
ASSESSMENT STRUCTURE

Scope How Note

guided by
instructor
in class, Students use
Chapters introduced completed by notebooks for
students at exercises
home, submitted
by deadline

Instruction and
shedules for
Progress tests must
be presented in the
Course
Implementation
Plan approved by
director of the
by instructor,
campus.
and by
Chapters introduced suitable means
Progress test must
(computer,
be taken right after
paper, oral...)
the last lectures of
required material.

Instructor has
resposibility to
review the test for
students after
graded.

All studied chapters.

At least 6 ~10% of
questions/chapter by Exam Board questions is a2
objective oriented