News

61212
We expect finals to be graded by FRi.



Class Description

This course provides introduction to applications of discrete
mathematical systems.
The core topics covered in this course are:

Logic: propositions, proofs using propositional equivalences.

Sets and set operations.

Predicates, quantifiers.

Rules of inferene and mathematical proof methods.

Functions and relations, sequences and summations.

Mathematical induction.

Recursive definitions.

Introduction to solving recurrence relations, nary relations.

Counting arguments, pigeonhole principle, permutations and combinations.

Discrete probability, generalized permutations and
combination

Applications: Boolean algebra and logic circuits

Applications: Modular arithmetic

Applications: Algorithms
Optional topics include trees and incudction on trees,
generating functions, inclusionexclusion principle, and applications of the binomial coefficient and factorials.
Examples are drawn from computer science
and computer engineering.
Prerequisites:
Eligibility to enroll in Mathematics 19A
(completion of Mathematics 2B or 3 or Mathematics Placement Exam score
of 40 or higher) or completion of Mathematics 19A or 11A, or Applied
Mathematics and Statistics 11A, or Economics 11A.



Student Responsibilities

Students enrolled in this class are agreeing to the following:
 Work turned in for quizzes, exams, and extrapoint projects must
be the result of individual effort. Homeworks can be solved in teams,
but each student is responsible for submitting a homework report and learning how to solve each homework problem.
 To attend class, you can choose among the "classroom," or "open" options, and you must inform the instructor no later than Friday April 6.
 Classroom Option: Attendance to discussion sessions is mandatory.
You will be grading homeworks during discussion sections.
You must attend the same discussion section each week.
 Open Option: You do not attend discussion sections. However, your grade is derived entirely from the two exams (60%) and the final (40%).

If any work claimed by a student to be his/her own is found to be
shared with other students, that will be considered a violation of
academic integrity and will be handled accordingly.
 Students are also responsible for checking the class web page
frequently for class material, updates, schedule changes, and assignments.



Grading

The grading system takes into account class participation,
exams, homeworks, and rewards extra effort inside and outside the classroom.
If you choose to attend discussion sections, your grade will be computed as follows:
 Homeworks (20%): Weekly
 Two exams (40%) closed book
 Final Exam (40%) closed book
Again, if you choose not to attend discussion sections, your grade will be computed
as 60% from the two exams and 40% from the final.
Exams and the final will be closed book, closed notes, with some
allowance for onepage help notes.
There are no curves in this class! Your effort determines your
grade independently of how well other students do.
The grading scale for the class will be approximately: A+
(96%100%), A (92%96%), A (88%92%), B+ (84%88%), B (80%84%), B
(77%80%), C+ (74%77%), C (64%74%), D (60%64%), F (below 60%).
I will use my discretion to deal with borderline cases. Class
participation and extra effort will be taken into account.



Academic Integrity

In this course we encourage students to get involved in discussions
about the class material in and outside class. However, all work
submitted for the class is to be understood by each student. It is
fine to solve homework problems as a group, provided that each group
member understands the answers she/he submits.
Students should be familiar with the University Academic Intergity
Policies, violations of which will not be tolerated. Students who
violate University standards of academic integrity are subject to
disciplinary sanctions, including failure in the course accompanied by
a report which will be part of the student's file, and suspension from
the University.
If you have questions or doubts about the
UCSC Academic Integrity
policies, please see the instructor or the TA.



Textbook

Our textbook is: K.H. Rosen, Discrete Mathematics and Its
Applications, Sixth Edition, McGrawHill,
2006 ISBN 9780073229720
We will follow the textbook closely, but not necessarily in
order.
CAUTION: We are using the 6th edition! If you get the seventh edition
you will not have the correct problems for the homework and the
organization of the chapters and sections will be different. There
are several options for acquiring the text:

Buy a new or used version of the 6th Edition from ??? for ???
Make sure to check that the version you are buying has the correct chapters. In previous years, some students obtained an international version that was missing Chapter 6 (probability).

Buy a used version of the 6th Edition from the UCSC bookstore for $89.50.

Buy the custom version of the 6th Edition from the UCSC bookstore for $98.50.
This is a new softcover black and white version of the text with only Chapters 17,11, Appendices 1 and 2, and the answers to oddnumbered problems from the included chapters.

Buy the eBook color version of the custom text (ISBN 9781121258068) described above from McGraw Hill for $60.81.
Read this
for information on the eBook and how to purchase it.

Buy the eBook color version of the custom text described above from the UCSC bookstore for $71.50. (I believe this is the same thing as the choice above for $10.69 more.)



Syllabus

The following list maps the topics that we will cover in class to the
textbook sections and class dates. Remember this schedule will
be modified as we make progress in this course.
Check this page often.
 April 3: Quiz, Introduction to class, foundations of logic (Sec. 1.1)
Class notes
 April 5: Foundations of logic, propositional equivalences (Sec. 1.2)
Class notes
Doc cam notes
 April 10 (Tue): HW 1 due at the Tue discussion section or in class
Students will grade homeorks of classmates in their discussion sections.
Coordinate with your TA.
 April 10: Logical equivalences (Sec 1.3). Sets (Sec 2.1).
Class notes
 April 12:
Sets and set operations
(Sec. 2.1, 2.2).
Predicates and quantifiers (Sec 1.3, 1.4)
Class notes
Doc camera notes
 April 17:
HW 2 due
Students will grade HW 2 during discussion sections.
Coordinate with your TA.
 April 17:
Predicates, quantifiers and rules of inference (Sec 1.3, 1.4, 1.5).
Mathematical proof (1.6).
Class notes
Doc camera notes
 April 19:
Mathematical proof (1.6)
Continued with class notes from April 17
Doc camera notes
 April 24:
HW 3 due
 April 24:
Mathematical proof (1.7)
Class notes
Doc camera notes
 April 26:
Sequences, summations and products (2.4)
Mathematical induction (4.1).
Class notes
Doc camera notes
 May 1:
Exam 1 (Covers all material covered up to 42412)
Mathematical induction (4.1).
Class notes
 May 3:
Strong induction (4.2, 4.3).
Document Camera notes
 May 8:
HW 4 due
 May 8:
Recursive definitions (Sec. 4.2, 4.3). Recurrence relations (Sec 7.1)
Class notes
Document Camera notes
 May 10:
Recurrence relations, continued (Sec 7.2). Counting methods (Sec 5.1)
Class notes
 May 15:
HW 5 due
 May 15:
Counting methods (Sec. 5.2, 5.3)
Class notes
Document Camera notes
 May 17:
Counting methods (Sec. 5.4, 5.5). Probability (Sec. 6.1)
Class notes
Class notes with answers to problems
 May 22:
HW 6 due
 May 22:
Probability (Sec. 6.2, 6.3)
Class notes
Doc cam notes

May 24:
Probability, conclude (6.4).
Applications: Boolean algrebra and logic circuits (Sec. 11.1, 11.2, 11.3)
Class notes
Doc cam notes

May 29:
Exam 2 (Covers material up to 52212)
Countability of infinite sets and proofs by diagonalization (Sec. 2.4)

May 31:
Conclusion of Boolean algebra

June 5:
Applications: Division, primes, congruences (Sec. 3.4, 3.5)
Doc cam class notes

June 7: Applications: Algoritms, complexity (Sec. 3.1, 3.2, 3.3).
Short review
Doc cam class notes

June 12 (Tue):
FINAL EXAM (8:0011:00 AM)
Covers all material up to June 5.



Requesting Academic Accommodations

If you would like to request academic accommodations due to a
disability, please contact the Disability Resource Center, 146 Hahn
Student Services, (831)4592089 (voice) or (831) 4594806 (TDD/TTY). They
can authorize specific accommodations for you in this class on an
Accommodation Request Form. Please present this form to me early in
the quarter so that we can discuss the accommodations you might need
for class. You will need to see me again at least three weeks before
each exam to arrange for testing accommodations.



Grades OnLine

You can now access your grades in this course via eCommons.
You can login at
https://ecommons.ucsc.edu/xslportal with your CruzID.
Be advised that your password should be the CruzID Gold Password!
Go to eCommons Documentation and Tutorials at:
http://its.ucsc.edu/services/ecommons/documentation/
or ask your TA for instructions on how to use the system.
Our course is called: CMPE016 Applied Discrete Mathematics.



