give the discrete mathematical structure,
show the impotance of counting and graps,
provide students with a background needed for subsequent mathematics and computing
--Kenneth H. Rosen, Discrete Mathematics and its applications, McGraw-Hill International Editions, 2003
Other Sources
-Ralph. P. Grimaldi, Discrete and Combinatorial Mathematics, Pearson Addison Wesley
- Richard Johnsonbaugh, Discrete Mathematics, Pearson Prentice Hall
-Joan M. Aldous and Robin J. Wilson, Graphs and Applications, Springer
-Ian Anderson, A first course in Discrete Mathematics, Springer
-Richard A. Brualdi, Introductory Combinatorics, Prentice Hall
Course Schedules
Week
Contents
Learning Methods
1. Week
Fundamental Principles of Counting
Oral and written presentation
2. Week
Permutations and Combinations
Oral and written presentation
3. Week
The Binomial Theorem
Oral and written presentation
4. Week
Combinations with Repetitions
Oral and written presentation
5. Week
An Introduction to Discrete Probability
Oral and written presentation
6. Week
The Pigenhole Principle
Oral and written presentation
7. Week
Inclusion-Exclusion
Oral and written presentation
8. Week
Midterm exam
Written exams
9. Week
Reccurence relations
Oral and written presentation
10. Week
Introduction to Number Theory
Oral and written presentation
11. Week
Applications of Number Theory
Oral and written presentation
12. Week
Cryptography
Oral and written presentation
13. Week
An Introduction to Graph Theory
Oral and written presentation
14. Week
Representing Graphs and Graph Isomorphism
Oral and written presentation
15. Week
Final exam
Written exams
16. Week
Final exam
Written exams
17. Week
Final exam
Written exams
Assessments
Evaluation tools
Quantity
Weight(%)
Midterm(s)
1
40
Quizzes
4
20
Final Exam
1
40
Program Outcomes
PO-1
Interpreting advanced theoretical and applied knowledge in Mathematics and Computer Science.
PO-2
Critiquing and evaluating data by implementing the acquired knowledge and skills in Mathematics and Computer Science.
PO-3
Recognizing, describing, and analyzing problems in Mathematics and Computer Science; producing solution proposals based on research and evidence.
PO-4
Understanding the operating logic of computer and recognizing computational-based thinking using mathematics as a discipline.
PO-5
Collaborating as a team-member, as well as individually, to produce solutions to problems in Mathematics and Computer Science.
PO-6
Communicating in a foreign language, and interpreting oral and written communicational abilities in Turkish.
PO-7
Using time effectively in inventing solutions by implementing analytical thinking.
PO-8
Understanding professional ethics and responsibilities.
PO-9
Having the ability to behave independently, to take initiative, and to be creative.
PO-10
Understanding the importance of lifelong learning and developing professional skills continuously.
PO-11
Using professional knowledge for the benefit of the society.
Learning Outcomes
LO-1
solve problems involving counting
LO-2
learn elementary number theory and know some application of number theory such as Cryptography
LO-3
solve reccurence relations
LO-4
Know basic graph theory
LO-5
recocnize same special type of graphs such as Eulerian, Planar and learn some application of graps
