GEIG1415, Summer 2023 Introduction to Discrete Mathematics
Hello, dear friend, you can consult us at any time if you have any questions, add WeChat: daixieit
Introduction to Discrete Mathematics
GEIG1415, Summer 2023 (July 17 - August 18)
Instructor Information
Lecturer: TBA
Email: TBA
Office hours: by appointment
Overview
This course introduces the foundations of discrete mathematics, including functions, relations, sets, simple proof techniques, Boolean algebra, fundamentals of logic, partial orders, elementary number theory and the fundamentals of counting etc.
Credits
4
Contact hours
60
Required Text(s):
Discrete MathematicswithAplications, 5ed, Susanna S. Epp, ISBN: 978- 1-337- 69419-3
Grading Policy
Your final grade is based on the following components:
Quizzes |
30% |
Exams |
50% |
Homework |
15% |
Participation |
5% |
Total |
100% |
Grading Scale
Letter Grade |
A+ |
A |
- |
B+ |
B |
- |
C+ |
C |
- |
D |
E |
X |
Scores |
90- 100 |
85-89 |
80-84 |
77-79 |
73-76 |
70-72 |
67-69 |
63-66 |
60-62 |
40-59 |
1-39 |
0 |
Academic Honesty
Feng Chia University defines academic misconduct as any act by a student that misrepresents the student’s own academic work or that compromises the academic work of another. Scholastic misconduct includes (but is not limited to) cheating on assignments or examinations; plagiarizing, i.e., misrepresenting as one’s own work any work done by another; submitting the same paper, or a substantially similar paper, to meet the requirements of more than one course without the approval and consent of the instructors concerned; or sabotaging another’ s work within these general definitions. Instructors, however, determine what constitutes academic misconduct in the courses they teach. Students found guilty of academic misconduct in any portion of the academic work face penalties that range from the lowering of their course grade to awarding a grade of E for the entire course.
Course Schedule
Wek1:
Fundamentals of Logic: sections 2. 1, 2.2, 3. 1, 3.2
Properties of the Integers; Mathematical Induction: section 4. 1, 4.3, 5.2
Recurrence Relations: section 5.6
Quiz 1
Wek2
Set Theory: section 6. 1
Functions: sections 7. 1, 7.2
Relations: sections 8. 1, 8.2, 8.3
Quiz 2
Wek3
Fundamental Principles of Counting: sections 9. 1, 9.2
The Principle of Inclusion and Exclusion: section 9.3
Rings and Modular Arithmetic: section 8.4
Mid-term Exam
Wek4
An Introduction to Graph Theory: sections 10. 1, 10.2
Trees: section 10.4, 10.5
Optimization and Matching: section 10.6
Quiz 3
Wek5
Boolean Algebra and Switching Functions: section 6.4
Languages: Finite State Machines: section 12. 1, 12.2
Generating Functions.
Final Exam
2023-07-14