CMPE 016 - Applied Discrete Mathematics

Instructor:
J.J. Garcia-Luna-Aceves
(jj "a_t" soe. ucsc. edu)
Office: E2 317
or E2 315 (CCRG Lab)
Office Hours: T Th 3:50 to 5:00 pm
You can email me to meet at different times
TA: Patrick Ellis
(pbellis "at" soe.ucsc.edu)
TA: Jane Li ˜
(zhil@ "at" soe.ucsc.edu)
MSI Tutor: Priera Panescu
( ppanescu "at" ucsc.edu)
Lecture
Location:
Baskin Engineering 152
Time:
T Th 2:00 pm - 3:45 pm
Discussion (01A)
Location:
Kresge 323
Time:
Tu 10:00 am-11:10 am
Patrick
Discussion (01B)
Location:
N. Sci. Annex 103
Time:
W 9:30-10:40 pm
Jane
Discussion (01C)
Location:
Kresge 323
Time:
Thu 8:30 am-9:40 am
Patrick
Discussion (01D)
Location:
N. Sci. Annex 102
Time:
Fri 2:00 pm-3:10 pm
Jane

MSI Session
Location:
Soc Sci II 171
Time:
Tue 4:00 to 5:15pm
Priera
MSI Session
Location:
BE 169
Time:
Wed 3:30 to 4:40pm
Priera
MSI Session
Location:
Soc Sci II 363
Time:
Thu 12:00 to 1:15pm
Priera

News| Class Description| Grading| Student Responsibilities| Academic Integrity| Forums will be done through eCommons | Textbook| Syllabus| Homeworks | Homework Solutions | Requesting Academic Accommodations | On-Line Grades

Please report any problems to JJ.
News

6-12-12

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, n-ary 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, inclusion-exclusion 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 extra-point 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 one-page 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, McGraw-Hill, 2006 ISBN 978-0073229720

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 1-7,11, Appendices 1 and 2, and the answers to odd-numbered 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.

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)459-2089 (voice) or (831) 459-4806 (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 On-Line

You can now access your grades in this course via eCommons. You can login at
https://ecommons.ucsc.edu/xsl-portal 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: CMPE-016 Applied Discrete Mathematics.