COSC 311 — Discrete Structures
a student of mathematics to hear someone talk about mathematics
does hardly any more good than for a student of swimming to hear
someone talk about swimming. You can’t learn swimming techniques
by having someone tell you where to put your arms and legs; and
you can’t learn to solve problems by having someone tell you to
complete the square or to substitute sin u for y. — Paul Halmos (1975)
Bruce MacLennan, PhD
Office: Min H. Kao 550
Hours: MW 1:30–2:30 or make an
Office: Min Kao 204
Hours: R 1:30–3:30 or make an
zmahoor at utk.edu
Classes: MWF 11:15–12:05, Min H. Kao 404
Office: Min Kao 204
Hours: T 3:00–5:00 or make an
amcbri10 at utk.edu
This page: http://web.eecs.utk.edu/~mclennan/Classes/311
Sets, functions, relations, equivalence relations, partial orderings
and proof techniques, especially mathematical induction. Application
of proof techniques to prove correctness of algorithms. Introduction
to basic counting and combinatorics.
(RE) COSC 140, MAT 142. (DE) COSC 160.
- Ralph P. Grimaldi: Discrete and Combinatorial
Mathematics: An Applied Introduction (5th ed.),
Addison-Wesley, 2003. ISBN-10: 0201726343, ISBN-13:
978-0201726343. New copies are available through Amazon.com
for $135, used copies from $56. You can probably get by with an
older edition, but there are some differences.
- Recommended text on proof techniques: Unless you have
significant prior experience with proving mathematical theorems,
I strongly recommend
that you get a copy of How to
Read and Do Proofs by Daniel Solow (Wiley), ISBN-10:
0470392169, ISBN-13: 978-0470392164. A new copy of the latest
edition costs $66
at Amazon, but you can get used copies of this and earlier
editions for much less (down
to $39 last time I checked). It does not matter which
edition you get.
A similar book is How to
Think Like a Mathematician by Kevin Houston (Cambridge,
2009). It costs $58
new at Amazon, and used copies are available for a few
dollars less. Also good is The
Nuts and Bolts of Proofs by Antonella Cupillari (3rd
ed., Elsevier, 2012). It is $74
new at Amazon, with used copies about the same. Older,
less expensive editions of these books are just as good.
- Fundamentals of Logic [Grimaldi, ch. 2]
- Mathematical Proof and Problem Solving [Solow, chs. 2, 4–11,
- Fundamental Principles of Counting [G(rimaldi) 1.1–1.4]
- Set Theory [G 3.1–3.4, 3.8]
- Properties of the Integers and Induction [G 4.1–4.2; Solow 12;
perhaps G 4.3–4.5]
- Relations and Functions [G 5.1–5.5; perhaps 5.6–5.8, 7.1–7.4]
- Supplementary Topics:
- Normal Forms [G 15.1]
- Countable and Uncountable Sets [G App. 3]
- Limitations of Predicate Logic
- Recurrence Relations [G 9, 10.1–10.4]
SUBJECT TO CHANGE!
- Propositional logic [G2.1–2.3] (“G2.1” refers to section 2.1
- Logical connectives [G2.1]
- Truth tables [G2.1–2,1]
- Normal forms (conjunctive and disjunctive) [G15.1]
- Validity [G2.1, 2.3]
- Predicate logic [G2.4]
- Universal and existential quantification [G2.4–2.5]
- Modus ponens and modus tollens [G2.3]
- Limitations of predicate logic [G3.8 + additional material]
- Apply formal methods of symbolic propositional and predicate
- Describe how formal tools of symbolic logic are used to model
real-life situations, including those arising in computing
contexts such as program correctness, database queries, and
- Use formal logic proofs and/or informal but rigorous logical
reasoning to, for example, predict the behavior of software or
to solve problems such as puzzles.
- Describe the importance and limitations of predicate logic.
- Notions of implication, converse, inverse, contrapositive,
negation, and contradiction [G2.2]
- The structure of mathematical proofs [G2.3; S2, 11, 13]
- Direct proofs [G2.3; S4–7]
- Proof by counterexample [G2.3; S8]
- Proof by contradiction [G2.3; S9–10]
- Mathematical induction [G4.1; S12]
- Recursive mathematical definitions [G4.2]
- Well orderings [G4.1]
- Outline the basic structure of and give examples of each
proof technique described in this unit.
- Discuss which type of proof is best for a given problem.
- Relate the ideas of mathematical induction to recursion and
recursively defined structures.
- Use proof techniques to prove properties about data
structures and algorithms presented in CS140.
- Use proof techniques to prove various properties about
- Functions [G5.2–5.4]
- Relations [G5.1; perhaps G7.1–7.4]
- Sets (Venn diagrams, complements, Cartesian products, power
- Pigeonhole principle [G5.5]
- Cardinality and countability [G A3]
- Explain with examples the basic terminology of functions,
relations, and sets.
- Perform the operations associated with sets, functions, and
- Relate practical examples, such as relational databases, to
the appropriate set, function, or relation model, and interpret
the associated operations and terminology in context.
Topics (Time permitting, to be covered more extensively
in COSC 312). Some of the topics, denoted in italic, are optional
and may be covered at the instructor’s discretion:
- Counting arguments [G1]
- Sum and product rule [G1.1]
- Inclusion-exclusion principle [G3.3]
- Arithmetic and geometric progressions
- The pigeonhole principle [G5.5]
- Permutations and combinations [G1.2–1.3]
- The binomial theorem [G1.3]
- Solving recurrence relations [G9–10]
- The Master theorem
- Compute permutations and combinations of a set, and interpret
the meaning in the context of the particular application.
- Solve a variety of basic recurrence equations.
- Analyze a problem to create relevant recurrence equations or
to identify important counting questions.
Homework and Tests
SUBJECT TO CHANGE! We will assign (approximately) weekly
homework, which will count a total of 15% of your Homework + Test average.
Late homework policy: In
order to allow me to discuss homework in class and to be fair to all
students, we have the following late homework policy. First, the
presumption is that you will normally turn in homework on time. The
individual homeworks are designed to be easily doable in the
(approximate) week allocated to each. Also, if you get behind in the
homework it will be difficult to catch up, since the material is
cumulative. Turning homework in on time means at the beginning of class on the day it
is due. Homework turned in after I have started lecturing is
considered late. (Of course I will consider extenuating
circumstances, such as being run over by a bus on the way to class!)
I will take off a letter grade for each day late, including
weekends. And the date will be determined by when the TA or I
receives the work, not by when you deposit it. (We can’t be
responsible if you turn it in after we’ve left for the day or if
we’re not on campus.) Of course, I will consider extenuating
circumstances. I hate to sound so legalistic, but experience shows
that is pays to be explicit.
Collaboration policy: In order to improve your learning, you
can collaborate on homework, provided you keep the following in
- “Collaboration” does not mean “copying.” You can discuss
problems and solutions with your classmates, provided that you
write up your answers individually.
- You must write on your paper that you have
collaborated and name those with whom you have collaborated.
- Remember that there is no collaboration on tests!
Homework provides an opportunity for you to practice the skills
that you will need to do well on the tests. Therefore you will
be better prepared for the tests if you work as many problems as
you can on your own.
In addition to homework, there will be three tests, each of which
will count 25% of your Homework
+ Test average.
Finally, there will be a quiz over the last chapter we cover,
counting 10% of your Homework
+ Test average.
- Due Aug. 30: §2.1: 4, 6, 8, 10.
- Due Sept. 6: §2.2: 4, 6, 10, 12; §2.3: 4, 6a, 10.
- Due Sept. 11: §2.4: 2, 8, 12a, 18, 22, 24; §2.5: 6, 12, 14,
- Due Sept. 18: [pdf]
- Due Sept. 25: [pdf]
- Due Oct. 7: §1.1&1.2: 4, 6, 10, 16, 20, 30, 34, 38.
- Due Oct. 14: §1.3: 8, 12, 14, 16, 18, 26; §1.4: 2, 4, 8,
10, 12, 18.
- Due Oct. 21: §3.1: 2, 8, 10, 12, 18; §3.2: 2, 4, 6a, 8, 14.
- Due Oct. 28: §3.3: 2, 4, 6, 8; §3.4: 6, 8, 12, 14.
- Due Nov. 1 (not late until after Nov. 6): §4.1: 2, 8, 10, 14,
18, 24; §4.2: 12, 14, 16.
- Due Nov. 8: §4.1: 12, 16, 26; §4.2: 2, 4, 10, 20; Suppl.: 6.
- Due Nov. 15: §5.1: 2, 4, 10, 12; §5.2: 4, 6, 8, 16, 20; §5.3:
2, 4, 8, 10, 12.
- Due Nov. 22: §5.4: 2, 4, 6, 12; §5.5: 2, 6, 18, 20, 24.
- Due Dec. 2: §5.6: 4, 8, 10, 12, 14, 20a, 22.
Tentative Test Schedule:
- Oct. 2 (ch. 2)
- Nov. 4 (chs. 1, 3)
- Nov. 27 (§§ 4.1–4.2, 5.1–5.3)
- Dec. 2 (quiz: §§ 5.4–5.6, 6.1)
Final Exam and Grading
SUBJECT TO CHANGE! It is anticipated that your grade will be
50% Homework + Tests
and 50% Final Exam. However, if you are satisfied with your Homework + Test average,
you will not have to take the Final Exam. Furthermore, if your Final
Exam grade is better than your Homework + Tests average, then it will count
for 95% of your grade.
The Final Exam is Mon., Dec. 9, 12:30–2:30. The
cumulative Final Exam will be two hours worth of questions similar
in difficulty to those on the Tests.
For Students with Disabilities
The Office of Disability Services and the Campus Disability Monitors
have asked us to pass this statement along in our syllabi:
Students who have a disability that require
accommodation(s) should make an appointment with the Office of
Disability Services (974-6087) to discuss their specific needs as
well as schedule an appointment with me during my office hours.
Some charts to help you with mathematical proofs:
- The Laws of Logic (pp. 58–9) from Grimaldi [pdf]
- Table 2.19 (Rules of Inference) from Grimaldi [pdf]
- Steps from Polya’s How to
Solve It [pdf]
- Summary of proof techniques from Solow [pdf]
Guide to Proof Strategies by Daniel J. Velleman (opens in
new window). You may find the Proof
Designer (opens in new window) by Velleman helpful; use it
as a learning tool, not a crutch. It goes with his book How to Prove It.
There is a supplemental handout [pdf]
with problems for practice in writing inductive proofs.
Return to MacLennan's
to Bruce MacLennan / MacLennan@eecs.utk.edu
This page is web.eecs.utk.edu/~mclennan/Classes/311
Last updated: 2013-12-03.