Main page   Curriculum Vitae   Teaching   Research   Math links


MATH 2056, Discrete Mathematics II fall semester 2016

Course outline

  • Lecture: Tuesday 2:00-3:20 PM, Thursday 2:00-3:20 PM, Main Campus Room A129.

  • Instructor: Ihor Stasyuk

  • Office: Room H351-B

  • Phone: 705 474 3450 ext. 4442

  • E-mail: ihors@nipissingu.ca

  • Office hours: Monday 4:00-5:00 PM, Wednesday 1:00-2:00 PM or by appointment.

  • Textbook:
    "Discrete Mathematics with Applications"
    by Susanna Epp
    4th edition

  • Topics: The course will be based on Chapters 5-10 of the textbook.
    • Chapter 5, Sequences, Mathematical Induction
    • Chapter 6, Set Theory.
    • Chapter 7, Functions.
    • Chapter 8, Relations.
    • Chapter 9, Counting and Probability.
    • Chapter 10, Graphs and Trees (if time permits).

  • Examinations: The nal exam will be in December and there will be one midterm exam at the end of October or beginning of November (the date to be announced in class). The midterm and the nal exams will be closed book. No calculators or other electronic devices will be permitted. If you are unable to be present at the midterm exam because of illness or another important reason beyond your control we will arrange an alternative midterm exam at a convenient time.

  • Assignments: There will be several marked home assignments devoted to solving prob- lems similar to those considered in class. No late assignments will be accepted.

  • Distribution of marks:
    assignments midterm exam final exam
    35% 25% 40%

  • Learning expectations:
    By the end of the course students should be able to
    • demonstrate ability to use mathematical induction by applying it to problem solving
    • demonstrate understanding of the concept of a set by solving a range of problems involving operations on sets
    • demonstrate understanding of the concept of a function de ned on general sets by creating examples of functions and solving problems involving properties of injective and surjective functions, inverse functions, compositions of functions etc.
    • demonstrate understanding of the concept of (un)countability and the hierarchy of the uncountable sets by solving problems and proposing constructions that demonstrate (un)countability
    • demonstrate understanding of the concept of a relation and its properties by solv- ing problems involving these properties; demonstrate ability to perform operations on relations
    • demonstrate understanding of the concept of probability by applying possibility trees, the multiplication rule, the addition rule, the inclusion/exclusion rule and the pigeon- hole principle to problem solving
    • demonstrate understanding of the general concepts in graph theory such as trees, planarity, cycles and directedness by solving problems involving these properties and illustrating the solutions.