MTH110

Course Outline

Ryerson University

Last updated: Monday, 30-Nov-2009 16:33:01 EST

This outline may be updated during the term so please check regularly


The topics will not necessarily be covered in the exact order below.
Times given are rough guides only. Some topics will be covered as they come up in other sections.
Some topics will only be covered if time permits.
All Chapter references are from Discrete Mathematics by Epp.

Weeks 1-4:

Week 4:

Weeks 5-7:

Weeks 7-10:

Weeks 10-12:

Weeks 12-13:

If Time Permits

Time did Permit!

  • Set Theory - Chapter 5

    • Set element methods, proving set identities

    SectionPractice Exercises
    5.2 2, 3, 6, 7, 8, 10, 11, 12, 15, 16, 18, 19, 22, 23, 27, 28, 32.

  • Efficiency of Algorithms - Chapter 9

    • Big O
    • Comparing Efficiency of Algorithms

    SectionPractice Exercises
    9.2 11, 13, 14, 25, 35, 37, 39, 40, 43, 46, 49cde, 51, 52, 54, 55, 56, 59, 60
    (In all questions use the limit definition from the Big O handout)
    9.3 1, 2, 3, 4, 5, 8, 9, 11, 17, 19


Maintained by Peter Danziger.
This page is best viewed with Mozilla Firefox.
Last modified Monday, 30-Nov-2009 16:33:01 EST