NOTE: You are responsible for the information on this handout. Please read it.
The goals for a Discrete Mathematics course for computer scientists are
two fold. The first is to teach you the basic elements of discrete mathematics,
like predicate logic, induction proofs, recursive definitions, functions,
counting, graphs, and all the other cool stuff we will talk about this quarter,
and with them also ways to recognize them in everyday problems. That in itself
is very interesting as all those topics are in one way or another related to
many disciplines in computer science, and programming in particular. But the
second goal is equally, if not more important: to engage you in thinking about
and generating mathematical proofs, which besides being intellectually
stimulating, sets the pace for more advanced classes and research work. I hope
we will achieve both goals and that you will enjoy them equally.
Forum: Please use forum in smartsite to post questions and have
discussions.
The chat group can also be used, although we will not check it---we will check
the forum.
However, on the chat group you may get quick answers from other students.
Posting and Email Policy: All general questions related to curriculum
must be posted to the forum.
Only topics of a personal nature can be emailed to TA, reader, or the
instructor.
Such emails should have "ECS20" in the subject line. Emails not following these
rules will
probably end up in our SPAM folders, and may not be read.
TR, 12:10-1:30 pm in 226 Wellman
F, 2:10-3:00 pm in 226 Wellman
The exams in this class will be closed notes and closed book. A page of notes will be allowed.
Schaum's Outlines Discrete Mathematics, 3rd Edition. by Lipschoutz and Lipson. McGraw Hill
Much of what one learns in this course comes from trying to solve the
homework problems, so work hard on them.
Doing a conscientious job on the homeworks is the best preparation for the
exams. We hope that you will ultimately
solve the majority of the problems, but don't be surprised if some of them stump
you; some of the problems may be
quite challenging.
Your solutions should be terse, correct, and legible. Understandability of
the solution is as necessary as correctness.
Expect to lose points if you provide a "correct" solution with a not-so-good
writeup. As with an English paper,
you can't expect to turn in a first draft: it takes refinement to describe
something well.
Typeset solutions are always appreciated.
If you can't solve a problem, briefly indicate what you've tried and where the difficulty lies. Don't try to pull one over on us.
If you think a problem was misgraded, please see the grader first.
(The grader(s) will hold 1 office hour per week; time will be announced later.)
Collaboration on homework problems is encouraged to the extent that it
helps you learn how to solve them for yourself.
But if you use someone else’s ideas to solve the homework you should properly
give them credit. That will not affect your grade.
Otherwise, copying of any kind on the homework, quizzes, or exams will be dealt
in accordance with our school’s academic dishonesty policy.