Help
This course has an assignment that is due by 11:55 pm Central Standard Time on Wednesday night of the first week of class.  Failure to complete this assignment will result in your removal from the course for non-participation. 

Textbooks

Discrete Mathematics and Its Applications, 7th edition, by Rosen.  Published by McGraw-Hill

This course also requires the use of McGraw-Hill Connect Access for the textbook

You do not need to buy the physical textbook if you do not wish to. The only thing you need to purchase is the online Connect code for this book. This access code will give you access to an online ebook and online materials. Homework will be submitted for this class through the online site, so the access code is required . If you choose to purchase a new/used copy of the paper textbook, be sure that it comes with an unused Connect access code or you will be required to buy an access code anyway.

ISBN 13: 978-0-07-735352-0 for Connect access (includes the ebook version of the textbook)

ISBN 13: 978-0-07-791608-4 for Connect access bundled with a paper copy of the textbook (this is an option, NOT a requirement, for students who desire a paper copy in addition to the ebook version of the text).

 

Connect access may be purchased directly from the publisher.  Instructions for doing this and also for enrolling in Connect for this course will be provided within the course.

Please note: If you would like a physical copy of the textbook in addition to the eBook in Connect, you can purchase it directly from the publisher after purchasing the access and registering for the course.  Discounted purchasing information for the physical copy will be located on the course home page in Connect. Please note that the physical copy is not required; only the Access to Connect and the eBook is required for the course.

Course Description

Introduction to discrete mathematics topics including counting methods, graph theory, recursion, number theory, and writing proofs using direct and indirect reasoning and induction.  Prerequisite: ACT Math subscore ≥ 22, or a C or better in MA103 or MA103I, or by permission of Chair.

Course Objectives

By the end of this course students should possess a working knowledge of counting methods, mathematical logic, recursion, and graph theory.  Each student will also learn basic problem solving skills using mathematical skills.