Discrete Mathematical Structures: Mathematics 243
Lecture TuTh 1:30–2:45 in PSA 308
Line # 00000
Instructor
Office PSA xxx (phone 965-xxxx)
Office Hours MW 1:00–2:00, TuTh 3:00-4:00, and by appointment.
E-mail xxxx@[Link] (Please include “math 243” in the subject line.)
Home page [Link]
Description Logic, sets, functions, elementary number theory and combi-
natorics, recursive algorithms, and mathematical reasoning, including
induction. Emphasizes connections to computer science.
Class time will be devoted to lecture. Students will perform example
computations and prove basic propositions related to the material in
homework and computer aided project assignments.
The prerequisites for this course are minimum sophomore standing,
and MAT 210, MAT 251, MAT 265, or MAT 270.
Required Text Discrete Mathematics and Its Applications, 7th Edition, by
Kenneth H. Rosen, Chapters 1 – 9.
Grading Course grades will be computed according to the following weights:
20% Homework average
10% Project average
40% Tests (2 @20%)
30% Final Exam
The following table gives the minimum course average to earn a given
grade.
A+ A A- B+ B B- C+ C D
97 92 90 87 82 80 77 70 60
Homework and Projects Homework will be assigned weekly, and collected
one week after it is assigned. There will be two computer projects
assigned during the semester; each will be due two weeks after it is
assigned.
An assignment is due at the beginning of class on its due date. Late
submissions will not be accepted.
Tests Midterm exams will be given in class on 19 February and 2 April.
The final exam will be comprehensive and will take place in our usual
classroom at the time published in the ASU final examination calendar.
A graphing calculator may be used during tests. All other electronic
devices, including phones, must be turned off and stored where they
are not visible. Use of books or notes is prohibited.
Academic Integrity Policy for this class will comply with ASU regulations.
“Academic honesty is expected of all students in all examinations, pa-
pers, laboratory work, academic transactions and records. The possi-
ble sanctions include, but are not limited to, appropriate grade penal-
ties, course failure (indicated on the transcript as a grade of E), course
failure due to academic dishonesty (indicated on the transcript as a
grade of XE), loss of registration privileges, disqualification and dis-
missal.” For more information, see [Link]/academicintegrity.
Disability Accommodations Policy for this class will comply with ASU reg-
ulations. “Qualified students with disabilities who will require dis-
ability accommodations in this class are encouraged to make their re-
quests at the beginning of the semester either during office hours or
by appointment. Note: Prior to receiving disability accommodations,
verification of eligibility from the Disability Resource Center (DRC) is
required. Disability information is confidential.”
Students who feel they will need disability accommodations in this
class but have not registered with the Disability Resource Center (DRC)
should contact DRC immediately. Their office is located on the first
floor of the Matthews Center Building. DRC staff can also be reached
at: 480-965-1234 (V), 480-965-9000 (TTY). Their hours are 8:00 AM
to 5:00 PM, Monday through Friday. For additional information, visit
[Link]/studentaffairs/ed/drc.
Weekly Schedule
Please read the listed section(s) of the text before the corresponding class
meeting.
Date Text Topic
1/8, 1/10 1.1 – 1.3 propositional logic, applications of propositional
logic, propositional equivalences
1/15, 1/17 1.4 – 1.5 predicates and quantifiers, nested quantifiers
1/22, 1/24 1.7 – 1.8 introduction to proofs, proof methods and strategy
1/29, 1/31 2.1 – 2.3 sets, set operations, functions
2/5, 2/7 2.3, 2.5. functions, cardinality of sets
2/12, 2/14 3.1 – 3.2 algorithms, the growth of functions
2/19, 2/21 4.1 Test 1, divisibility and modular arithmetic
2/26, 2/28 4.3 – 4.4 primes and greatest common divisors, solving con-
gruences
3/5, 3/7 5.1 – 5.3 mathematical induction, strong induction and
well-ordering, recursive definitions
3/12, 3/14 Spring Break
3/19, 3/21 6.1 – 6.3 the basics of counting, the Pidgeonhole Principle,
permutations and combinations
3/26, 3/28 6.3 – 6.4, 7.1 permutations and combinations, binomial coeffi-
cients and identities, an introduction to discrete
probability
4/2, 4/4 8.1 – 8.2 Test 2, applications of recurrence relations, solv-
ing linear recurrence relations,
4/9, 4/11 8.5, 9.1 inclusion- exclusion, relations and their properties
4/16, 4/18 9.5 equivalence relations
4/23, 4/25 9.6 partial orderings
4/30 review for final
