M325K Spring 2014
Unique #: 56590
Lecture : TTh 11:00-12:30 in RLM 5.122
Textbook: Grimaldi, "Discrete and Combinatorial Mathematics",
5th edition
Syllabus: Chapters I-VII, with some additions and deletions
Office Hours: TTH 2:00-3:30 in RLM 12.130.
Link to this file: www.ma.utexas.edu/users/kbi/COURSES/TERM/14S/325K/325K.html
This course makes use of the web-based Quest content delivery and homework server system maintained by the College of Natural Sciences.
This homework service will require a $25 charge per student per class for its use, with no student being charged more than $50 a semester.
This goes toward the maintenance and operation of the resource. Please go to
http://quest.cns.utexas.edu to log in to the Quest system for this class.
After the 12th day of class, when you log into Quest you will be asked to pay via credit card on a secure payment site.
Quest provides mandatory instructional material for this course, just as is your textbook, etc.
For payment questions, email
quest.billing@cns.utexas.edu.
Grading Scheme
During most lectures I will give short multiple-choice quizzes,
which will count 15% towards the course grade.
They cover topics from the current and previous lectures.
For the quizzes you will need to
own
and
register an iClicker and to
enroll in this course.
Read about Quest here.
At every lecture I shall assign homework, which is to be turned in
on the Thursday of the following week. I will not accept late homework,
but I will drop the three lowest or missed homeworks.
The homework counts 15% towards the course grade.
You are encouraged to collaborate in groups on the homework
and further study, and to turn in only one homework per group.
The groups can be arbitrarily large;
in fact, I will not accept homework with fewer than two names on it.
There will be three (3) midterm tests, each worth 15% and covering
the material presented prior to the test.
The comprehensive final test counts 25%.
The worst (or missed) midterm test is replaced by the score from
the final test if that improves the total.
I can't allow you to miss two or more of the midterm tests, though, and
there will be NO make-up test.
I do not like to grade on the curve, so the grading scheme is this:
90-100: A, 80-89.9: B, 70-79.9: C, 60-69.9: D.
However, since most students prefer to be graded on the curve I will
modify this scheme a little: I'll give grades A-, B-, C-,D- at cutoff
points lower than 90, 80, 70, 60, respectively, so as to approximate
a curve.
Regrades and Disputes:
I grade very leniently. If I make a mistake in
grading please let me know and I'll fix it--provided the request
to change a score is made within one week of the test or homework
in dispute being returned to the class.
However, the way I apportion partial credit is my prerogative and
I will not change it. I will not entertain arguments about it;
they merely generate ill will.
Just in case disputes over your record should arise
keep all tests, homeworks, quizzes etc.
I am not permitted to change this grading scheme, for example by
assigning extra work if a few points are missing for a higher grade.
Also, I do not cook the books,
not even for the most charming, needy, or pushy student.
The midterm tests are scheduled
on the following Thursdays during class time:
February 20, March 27, and May 1.
The
final test is scheduled for
Monday May 12 at 2:00 PM in NOA 1.102.
Put these dates on your calendar now!
Most test problems are taken from the book, perhaps slightly altered.
There are usually 5-6 problems per test, 7-10 for the final test.
The test questions are
taken from the book, possibly slightly modified to make them easier.
How to learn:
The most efficient way to learn the material is to
collaborate
and to read ahead.
I will post slides covering the next one or two lectures on the web.
They can serve as your notes, so you won't have to scribble along.
You save a lot of time by reading them in advance,
so you can ask questions during the lecture.
Also, think how much easier it is to answer a quiz
if you have thought about it beforehand.
Make use of the
Sanger Learning and Career Center!
Also, the University of Texas at Austin provides upon request appropriate
accommodations for qualified students with disabilities;
for more information contact the Office of the Dean of Students
at 471-6259, 471-4641 TTY.
[an error occurred while processing this directive]
Here is a practice exam in pdf format.
Here is a Practice Final
in dvi format,
in postscript format,
in pdf format.
Here is a plan of the course.
A course is a living and unpredictable thing.
Therefore this plan is highly preliminary
and will change as the course develops!
Tuesday January 14:
[QL] First Principles and Examples of Counting.
Lecture 1.
HW1a, Due 01/23: Sections 1.1&1.2 # 6, 8, 10, 12, 14a, 16.
Thursday January 16:
[QL] Binomial Theorem, Multinomial Theorem.
Lecture 2.
HW1b, Due 01/23: Section 1.3 # 2, 4, 8, 14, 26, 30.
Tuesday January 21:
[QL] Selection with Repetition, Some Diophantine Equations.
Lecture 3.
HW2a, Due 01/30: Section 1.4 # 2, 4, 12, 16.
Thursday January 23:
[QL] Elementary Logic, Statements, Truth Tables.
Lecture 4.
HW2b, Due 01/30: Section 2.1 # 2, 4, 6, 8, 10; Section 2.2 # 4, 6, 10, 14.
Tuesday January 28:
UT closed for weather.
Thursday January 30:
[QL] The Laws of Logic, Logical Equivalence and Implication.
Lecture 5.
HW3b, Due 02/06: Section 2.3 # 2, 4.
Tuesday February 04:
[QL] Rules of Inference, Quantifiers.
Lecture 6.
HW4a, Due 02/13: Section 2.4 # 2, 4.
Thursday February 06:
[QL] Set Theory.
Lecture 7.
Read this for fun.
HW4b, Due 02/13: Section 3.1 # 8, 14; Section 3.2 # 8, 18.
Tuesday February 11:
[QL] The Laws of Set Theory, Venn Diagrams, Examples of Proofs.
Lecture 8.
HW5a, Due 02/20: Section 3.3 # 8, 10.
Thursday February 13:
[QL] Introduction to Probability.
Lecture 9.
HW5b, Due 02/20: Section 3.4 # 2, 4, 8; Section 3.5 # 4.
[QL] Conditional Probability, Bayes' Theorem.
Lecture 10.
Read this.
HW6a, Due 02/27: Section 3.6 # 4, 6.
Tuesday February 18:
[QL]
Review
Thursday February 20:
Test 1
Tuesday February 25:
[QL] The Integers; Mathematical Induction.
Lecture 11.
Here is an illustration.
HW7a, Due 03/06: Section 4.1 # 2, 4, 6a, 8.
Thursday February 27:
[QL] Recursive Definitions; Division Algorithm.
Lecture 12.
HW7b, Due 03/06: Section 4.2 # 2, 4, 6, 8, 12.
Tuesday March 04:
[QL] Division Algorithm, Ideals.
Lecture 13.
HW8a, Due 03/20: Section 4.3 # 2, 4, 8, 12.
Thursday March 06:
[QL] Ideals, Greatest Common Divisor.
Lecture 14.
HW8b, Due 03/20: Compute a generator of ((840,1001))
and write it as a linear combination of 840 and 1001;
Section 4.4 # 2, 4, 6, 8, 10, 12.
Tuesday March 11: Spring Break
Thursday March 13: Spring Break
Tuesday March 18:
[QL] The Fundamental Theorem of Arithmetic.
Lecture 15.
HW9a, Due 03/27: Section 4.5 # 2, 4, 6.
Thursday March 20:
[QL] Relations and Functions.
Lecture 16.
HW9b, Due 03/27: Section 5.1 # 2, 4, 12.
Tuesday March 25:
[QL] Review
Thursday March 27:
Test 2
Tuesday April 01:
[QL] Surjective Functions.
Lecture 17.
HW10a, Due 04/10: Section 5.2 # 2, 4, 8,12, 15, 16, 17;
Section 5.3 # 2, 4, 6, 8.
Thursday April 03:
[QL] Special Functions, Binary operations. The Pidgeon Hole Principle.
Lecture 18.
HW10b, Due 04/10: Section 5.4 # 2, 4, 6, 8, 12; Section 5.5 # 2, 4, 12, 14.
Tuesday April 08:
[QL] Composition of Functions, Inverses.
Lecture 19.
HW11a, Due 04/17: Section 5.6 # 4, 6, 8, 10, 12, 14, 16, 18 a-c.
Thursday April 10:
[QL] Relations Revisited.
Lecture 20.
HW11b, Due 04/17: Section 7.1 # 2, 4, 6.
Tuesday April 15:
[QL] Graphs and Incidence Matrices.
Lecture 21.
HW12a, Due 04/24: Section 7.2 # 2, 4, 6, 10, 18, 22.
Thursday April 17:
[QL] Partial Orders on Finite Sets; Topological Sorting.
Lecture 22.
HW12b, Due 04/24: Section 7.3 # 6, 10, 14.
Tuesday April 22:
[QL] Topological Sorting.
Lecture 23.
HW13a, Do by 05/01: Section 7.3 # 2, 4, 22. Section 7.4 # 2, 4, 6, 12.
Thursday April 24:
[QL] Equivalence Relations.
Lecture 24.
HW13b, Do by 05/01: Section 7.3 # 2, 4, 22. Section 7.4 # 2, 4, 6, 12.
Tuesday April 29:
[QL] Review
Thursday May 1:
Test 3
Monday May 12: 2:00 PM Final Test in NOA 1.102.
Click here for the
Past Quizzes.