MCS-256: Discrete Calculus and Probability (Spring 2014)
Overview
This course covers discrete mathematics,
except graph theory,
that are needed in computer science.
Specifically we will learn
proofs by induction,
recurrence relations,
summation techniques,
generating functions,
asymptotics,
enumerative combinatorics (how to count without counting),
and discrete probability.
Mathematics majors will learn how to think and work with
discrete structures to complement their training in
the continuous math.
Computer Science majors will learn about mathematics techniques
necessary for the design and analysis of algorithms.
Prerequisite
MCS-119 or MCS-121 (Calculus I), and either
MCS-220 (Introduction to Analysis) or
MCS-236 (Graph Theory).
Textbooks
There is no official textbook in this course.
The following textbooks are useful.
-
Combinatorial Methods with Computer Applications,
Jonathan L. Gross,
Chapman & Hall/CRC,
2008.
-
Discrete Mathematics and Its Applications 7/e,,
Kenneth H. Rosen,
McGraw Hill, 2012.
- Schaum's Outline of
Theory and Problems of Calculus of Finite Differences
and Difference Equations, Murray R. Spiegel,
McGraw-Hill, 1971.
- Introduction to Probability, Grinstead & Snell
(available for free download).
Additional reference on reserve
- Concrete Mathematics 2/e, Graham, Knuth, and Patashnik,
QA39.2.G733 1994.
Exams
There will be four unit exams and one comprehensive final examination.
Most exams are in-class but
some unit exams may be take-home.
In either case, you must work individually;
no cooperation or help is allowed.
In-class exams are closed-book, and closed-notes.
You may, however, use a single 8 1/2" x 11" sheet of paper
with hand-written notes for reference.
Both sides of the sheet may be used.
Homework
Homeworks are due at the start of class on the due date.
However, you may submit your solution several times before
the official due date.
I'll take a quick look at your work and
give as much feedback as possible
as to whether you're on the right track.
To get fast response and maximum benefit
from these early submissions,
I strongly suggest you meet with me one-on-one
to discuss your answer.
You are allowed (even encouraged)
to cooperate on homework problems.
However, all answers must be entirely in your own words.
If you work as a team or receive help from a classmate,
acknowledge it.
Acknowledgment should appear at the top of your
problem solution.
Homework writeups should follow the
homework guidelines.
Late homework policy
Turn in homework on time.
Each class day late reduces the possible points by 25%.
Grading
Exams are worth 72% of total grade.
There are five exams: four unit exams and a comprehensive final.
The best four will count 16% each;
the lowest score will count 8%.
Homework is worth 28% of total grade.
The lowest homework assignment score will be discarded.
If you earn at least 93% of the possible points, you will receive an A,
at least 88% for an A-, at least 83% for a B+ and down by
5 percentage points each to the lowest passing grade of at least 48 for a D.
There is no curve, although I
reserve the right to adjust your grade at the end of the course.
Grade adjustment will be based on class participation,
and my perception of your effort to learn.
Attendance
If you miss a class you are still responsible for the materials covered.
Any handouts distributed in class will also appear in the drop box
in front of my office.
Honor
You are expected to be familiar with the college academic honesty
honor code policy,
and to comply with that policy.
If you have any questions about it, please ask.
In doing an assignment,
you may discuss the problems and their solutions with fellow students,
but you should make an effort to solve each problem on your own.
Give credit to the people and/or reading sources
that help you find the solutions,
be they textbooks,
journals,
or internet postings.
Be explicit and acknowledge clearly what sort of help you received.
Failure to do so will be considered cheating.
A first violation of the honor code will result in a grade of 0
on the homework or exam in question.
Any further violation will result in an automatic F for the course
and a notification to the Office of the Provost.
Disability Services
Gustavus Adolphus College is committed to ensuring the full participation
of all students in its programs. If you have a documented disability
(or you think you may have a disability of any nature) and, as a result,
need reasonable academic accommodation to participate in class, take tests
or benefit from the College's services, then you should speak with
the Disability Services Coordinator, for a confidential discussion of
your needs and appropriate plans. Course requirements cannot be waived,
but reasonable accommodations may be provided based on disability documentation
and course outcomes. Accommodations cannot be made retroactively; therefore,
to maximize your academic success at Gustavus, please contact Disability Services
as early as possible.
Disability Services
is located in the Advising and Counseling Center.
Disability Services Coordinator, Laurie Bickett,
(lbickett@gustavus.edu or x6286)
and Disability Specialist, Kelly Hanson,
(khanso10@gustavus.edu or x7138)
can provide further information.
Help for Students Whose First Language is not English
Support for English Language Learners and Multilingual students is available
through the Academic Support Center and the Multilingual/English Language
Learner Academic Support Specialist,
Laura Lindell (x7197).
She can meet individually with students for tutoring in writing, consulting
about academic tasks and helping students connect with the College's support systems.
When requested, she can consult with faculty regarding effective classroom strategies
for ELL and multilingual students. Laura can provide students with a letter to
a professor that explains and supports appropriate academic arrangements
(e.g. additional time on tests, additional revisions for papers).
Professors make decisions based on those recommendations at their own discretion.
In addition, ELL and multilingual students can seek help from peer tutors in
the Writing Center.
Week
| Class Dates
| Topics
| Tests
|
1
| Feb. 10-14
| Introduction: recurrence, induction, discrete math
|
|
2
| Feb. 17-21
| Difference calculus
|
|
3
| Feb. 24-28
| Difference calculus
| Fri Feb. 28
|
4
| Mar. 3--7
| Summation calculus
|
|
5
| Mar. 10-14
| How to count
|
|
6
| Mar. 17-21
| Combinatorics
| Fri Feb. 21
|
7
| Mar. 24-28
| Probability
|
|
Break
| Mar. 31-Apr. 4
| Spring Break
|
|
8
| Apr. 7-11
| Random variables, special distributions
|
|
9
| Apr. 14-18
| Expectations
| Fri Apr. 18
|
10
| Apr. 21-25
| Generating functions
|
|
11
| Apr. 28-May 2
| Recurrence relations
|
|
12
| May 5-9
| Asymptotics
| Fri May 9
|
13
| May 12-16
| Applications
|
|
14
| May 19-20
| Wrap-up, and review
|
|
15
|
| Final exam
| M May 26, 1:00–3:00pm
|
This is a tentative syllabus.
Back to MCS 256 home page