Undergraduate
Faculty of Science and Letters
Mathematics And Computer Science
Anlık RSS Bilgilendirmesi İçin Tıklayınız.Düzenli bilgilendirme E-Postaları almak için listemize kaydolabilirsiniz.


Discrete Mathematics

Course CodeSemester Course Name LE/RC/LA Course Type Language of Instruction ECTS
MBT1006 1 Discrete Mathematics 4/0/0 BSC Turkish 6
Course Goals
Give basic mathematical concept on discrete mathematical structures such as graphs trees. Give the basic knowledge about the elementary number theory and its applications to cryptography.
Prerequisite(s) -
Corequisite(s) -
Special Requisite(s) -
Instructor(s)
Course Assistant(s) -
Schedule This course will not be given this semester.
Office Hour(s) This course will not be given this semester.
Teaching Methods and Techniques Lecture and applications.
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 Principles of Counting Lecture and Application
2. Week Permutations and Combinations Lecture and Application
3. Week Binomial Theorem and Multinomial Theorem Lecture and Application
4. Week The Pigeonhole Principle Lecture and Application
5. Week Inclusion-Exclusion Principle Lecture and Application
6. Week Generating Functions Lecture and Application
7. Week Reccurence Relations Lecture and Application
8. Week Midterm Exam Exam
9. Week Introduction to Number Theory Lecture and Application
10. Week Application of Number Theory Lecture and Application
11. Week Cryptography Lecture and Application
12. Week Introduction to Graphy Theory Lecture and Application
13. Week Planarity, Colorings Lecture and Application
14. Week Applications Lecture and Application
15. Week Final Exam
16. Week Final Exam
17. Week Final Exam
Assessments
Evaluation tools Quantity Weight(%)
Midterm(s) 1 50
Final Exam 1 50


Program Outcomes
PO-1Interpreting advanced theoretical and applied knowledge in Mathematics and Computer Science.
PO-2Critiquing and evaluating data by implementing the acquired knowledge and skills in Mathematics and Computer Science.
PO-3Recognizing, describing, and analyzing problems in Mathematics and Computer Science; producing solution proposals based on research and evidence.
PO-4Understanding the operating logic of computer and recognizing computational-based thinking using mathematics as a discipline.
PO-5Collaborating as a team-member, as well as individually, to produce solutions to problems in Mathematics and Computer Science.
PO-6Communicating in a foreign language, and interpreting oral and written communicational abilities in Turkish.
PO-7Using time effectively in inventing solutions by implementing analytical thinking.
PO-8Understanding professional ethics and responsibilities.
PO-9Having the ability to behave independently, to take initiative, and to be creative.
PO-10Understanding the importance of lifelong learning and developing professional skills continuously.
PO-11Using professional knowledge for the benefit of the society.
Learning Outcomes
LO-11. Solve problems involving counting.
LO-22. Learn Elementary Number Theory and know some application such as Cryptography.
LO-33. Solve reccurence relations.
LO-44. Know graphs and its applications.
LO-55. Learn planaritry and colorings.
Course Assessment Matrix:
Program Outcomes - Learning Outcomes Matrix
 PO 1PO 2PO 3PO 4PO 5PO 6PO 7PO 8PO 9PO 10PO 11
LO 1
LO 2
LO 3
LO 4
LO 5