to provide students with a background needed for subsequent mathematics and computing
Prerequisite(s)
Course Code Course Name…
Corequisite(s)
Course Code Course Name…
Special Requisite(s)
The minimum qualifications that are expected from the students who want to attend the course.(Examples: Foreign language level, attendance, known theoretical pre-qualifications, etc.)
Instructor(s)
Course Assistant(s)
Schedule
The course will not be given this semester.
Office Hour(s)
The course will not be given this semester.
Teaching Methods and Techniques
Resitation and Oral Presantation
Principle Sources
1. Kenneth H.Rosen, Discrete mathematics and its applications, Mc Graw-Hill International Editions.
2. Ralph Grimaldi, Discrete and Combinatorial Mathematics, Pearson Addison Wesley.
3. Richard Johnsonbaugh, Discrete Mathematics, Prentice Hall.
Other Sources
Course Schedules
Week
Contents
Learning Methods
1. Week
Fundamental Counting Principle
Resitation and Oral Presantation
2. Week
Permutation and Combination
Resitation and Oral Presantation
3. Week
Binom Theorem, Multinom Theorem
Resitation and Oral Presantation
4. Week
The Pigeonhole Principle
Resitation and Oral Presantation
5. Week
Insertion extraction principle
Resitation and Oral Presantation
6. Week
Producer functions
Resitation and Oral Presantation
7. Week
recurrence relations
Resitation and Oral Presantation
8. Week
Ara Sınav
Midterm
9. Week
Introduction to number theory
Resitation and Oral Presantation
10. Week
Applications of number theory
Resitation and Oral Presantation
11. Week
Cryptography
Resitation and Oral Presantation
12. Week
Introduction to Graph Theory
Resitation and Oral Presantation
13. Week
Planarity and coloring
Resitation and Oral Presantation
14. Week
Applications
Resitation and Oral Presantation
15. Week
Final
Final Exam
16. Week
Final
Final Exam
17. Week
Final
Final Exam
Assessments
Evaluation tools
Quantity
Weight(%)
Midterm(s)
1
50
Final Exam
1
50
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 ofgraphs.