204211 Discrete Mathematics src:52

Instructor : วัชรพัฐ เมตตานันท

Section : 800

Class : Tuesday 9.00-12.00

Room: 10205

Office hour : Wednesday 11.00-12.00, 13.00-14.00

Grading

• Mid: 37.5%
• Final: 37.5%
• H.W. 15%
• Quizes: 10%

Course Overview

This course aims to introduce students to mathematical thinking and problem solving. Various ideas and techniques from discrete mathematics will be presented along with specific applications in Computer Science. With this parallel approach, students would be able to see the connections between the theory and practice.

Weekly Plan

• 1. Introduction, Logic review
• 2. Basic proof techniques, Mathematical induction
• 3. More on mathematical induction/ Recursion
• 4. Counting: permutation, inclusion-exclusion, pigeonholes
• 5. Counting: binomial coefficients, Fibonacci numbers
• 6. Number theory: modular arithematics, gcd
• 7. Number theory: primality testing, RSA
• 8. Graphs: basics, counting trees
• 9. Graphs: connectivity, Eulerian walks and Hamiltonian cycles, TSP
• 10. Graphs: matchings, planarity
• 11. Graphs: coloring
• 12. Probability: concepts, probability, conditional probability
• 13. Probability: random variables, expectations, linearity of expectation
• 14. Selected topic
• 15. Selected topic

Home Works

• ยังไม่มีการบ้านสำหรับสัปดาห์แรก

Documents

หนังสือ คณิตศาสตร์เต็มหน่วย ของ อาจารย์เฉลิมศักดิ์ ฉัตรดอกไม้ไพร

• บทที่ 1 (pdf)