Scribd
Upload
66 views1 page

Math-132 Syllabus (2020 Spring)

Math132 sylbus

Uploaded by

Mert Okur
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
66 views1 page

Math-132 Syllabus (2020 Spring)

Math132 sylbus

Uploaded by

Mert Okur
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

MATH 132–03,04,05,06 – Discrete and Combinatorial Mathematics

Semester: Spring 2020


Instructor: Nil Şahin E-mail: [email protected]
Office: Room EA-326 Phone: 3442

Exams & Grading: • 1st Midterm (30%) TBA


• 2nd Midterm (30%) TBA
• Final Exam (34%) Finals week
• Homework (%6)
• Homework will be assigned and graded via McGraw-Hill Connect
Visit https://connect.mheducation.com/class/n-sahin-spring-2020
to enroll. Refer to the Moodle for detailed instructions and penalties!

FZ policy: If the sum of your midterm scores is less than 40 (out of 200), you will get FZ

Course Schedule: 4 hours of lectures in odd numbered weeks and 2 hours in even numbered weeks.
Office Hours: Monday 15:40–16:30, Tuesday 14:00–16:00

Course website: Moodle. Check regularly for vital announcements!

Make-up Policy: You must have a valid written excuse, approved by Bilkent and your
department or institution, to make up for a missed exam. A single
make-up is given during the last week of classes, covering the entire syllabus.

Textbook: Kenneth H. Rosen, Discrete Mathematics and Its Appplications, 8th Edition.

Other: • No cell phones or computers during lectures.

Tentative course schedule

Week Subject MT
#1 Sets, functions, cardinality of sets (2.1–2.5)
#2 Modular arithmetic, primes and greatest common divisor (4.1–4.3)
#3 Congruences and their applications (4.4)
#4 Induction and well-ordering (5.1–5.2)
#5 Counting and the pigeonhole principle (6.1–6.2)
#6 Counting: permutations and combinations (6.3–6.4)
#7 Counting: generalized permutations and combinations (6.5–6.6)
#8 Advanced counting techniques: recurrence relations (8.1–8.2)
#9 Advanced counting techniques: generating functions (8.4)
#10 Advanced counting techniques: inclusion/exclusion (8.5–8.6)
#11 Relations: general theory (9.1)
#12 Relations: equivalence relations and partial orders (9.5–9.6)
#13 Graphs: terminology, graph isomorphisms (10.1–10.3)
#14 Graphs: connectivity, Euler & Hamilton paths (10.4–10.6)
#15 Graphs: planar graphs, graph colorings (10.7–10.8)

You might also like