Class Description:

Introduction to applications of discrete mathematical systems. Topics include sets, functions, relations, graphs, predicate calculus, mathematical proof methods (induction, contraposition, contradiction), counting methods (permutations, combinations), and recurrences. Examples are drawn from computer science and computer engineering. Knowledge of computer programming is useful before taking this course. Students who do not have prior programing experience are strongly recommended to take Computer Science 5C, 5J, or 5P before taking this course.  Prerequisite(s): Mathematics 19A or 11B or Applied Mathematics and Statistics 11B or 15B or Economics 11B.

Lecture Times and Location:

MWF     8:00am - 9:10am
Jack Baskin Auditorium 101

Discussion Section Times and Locations:

01A    M    11:00AM-12:10PM    J Baskin Engr 372
01B    M    12:30PM- 1:40PM    J Baskin Engr 372
01C    Tu    8:30AM-  9:40AM    J Baskin Engr 372
01D    W     2:00PM- 3:10PM    J Baskin Engr 372
01E    Th    4:00PM-  5:10PM    J Baskin Engr 372
01F    F    11:00AM-12:10PM    J Baskin Engr 372

Discussion Sections do not meet first week of class.
They start week of 4/6/15.


Delbert D. Bailey (
Phone: 831-459-3250
Office: E2-231
Office Hours:  Monday/Wednesday 9:30am-11:00am and by appointment.

Teaching Assistants:

Brian Chen (
Office Hours: Wednesdays   3:30 - 4:30  BE Rm 312C/D

Ehsan Hemmati (
Office Hours: Tuesday 3:00 - 4:00  E2 Rm 480

MSI (Modified Supplemental Instruction) Learning Assistant:

Hadley Black (

MSI Schedule:

Monday 2:00 - 3:10: Porter 250
Wednesday 12:30 - 1:40: Crown 201
Thursday 2:00 - 3:30Oakes Learning Center

Text Book:

Discrete Mathematics and Its Applications, Seventh Edition, Kenneth H. Rosen
McGraw Hill 2012, ISBN 978-0-07-338309-5

Note: Earlier editions and the so-called International Edition are NOT advised. They have significantly different content.


(Subject to change)
Logic and Proofs
Sets and Functions
Sequences and Summations
Number Theory
Induction and Recursion
Counting: Permutations and Combinations
Discrete Probability
Recurrence Relations
More Relations

 Examination Schedule:

Midterm 1           April 17
Midterm 2           May 8
Final                     june 8      8:00am - 11:00am                  

    All the exams are in the classroom. The examination schedule is fixed. In particular, requests for changes in the schedule will not be accommodated; if you have conflicts with this schedule, please do not enroll in the class. Also, no time extension will be given for late arrivals on quiz day or examination day.


Homework (15%).
Two Midterm Exams (20% each).
Final Exam (45%).

N.B. A passing grade on all factors of the evaluation is necessary to pass this class. This means, if you fail any one of the  coomponents of the evaluation (homework, midterms, or final), you will not pass. This policy is intended primariliy to prevent students from "blowing off" any of the required work because it only counts for a small percentage of the grade.

Academic Integrity:

No form of academic dishonesty will be tolerated. Incidents of academic dishonesty will be reported according to UCSC's policy on academic integrity, the full text of which can be found at Student Guide to Academic Integrity. Specifically, if you are caught submitting work as your own in this class, that is not solely your own, or assisting others in doing so, a formal written report will be sent to your Department, the School of Engineering, and to your Provost and academic preceptor. Furthermore you will get a failing grade for the course and the incident will be noted in your evaluation.



We will use ecommons to make general announements and ecommons forums to answer clearification questions on homework assignments but not solutions.

Questions on how to solve specific homework problems are to be addressed in the Discussion Sections and in office hours. Do not allow other students to read or copy your solutions and do not read or copy solutions of others.