Please note the following:
Name  Role 
Mia Minnes  Instructor 
Srinivas Avireddy  Teaching Assistant 
Justin Lazarow  Teaching Assistant 
Shaida Masoumi  Teaching Assistant 
Candice Yang  Teaching Assistant 
Angel Zhang  Teaching Assistant 
Asha Camper Singh  Tutor 
Rachel Keirouz  Tutor 
Benjamin Levin  Tutor 
Timothy Nguyen  Tutor 
Jenny Nguyen  Tutor 
Maya Nyayapati  Tutor 
Diana Zhou  Tutor 
Jimmy Ye  Tutor 
Oscar Song  Tutor 
Xingda Jiang  Tutor 
Su Jin Heo  Tutor 
We will be communicating with you and making announcements through an online question and answer platform called Piazza (sign up link: piazza.com/ucsd/winter2016/cse20). We ask that when you have a question about the class that might be relevant to other students, you post your question on Piazza instead of emailing us. That way, everyone can benefit from the response. You should not post about graded homework questions on Piazza. The best way for us to answer homework questions is in office hours. The exceptions to this rule are if you suspect a typo in the assignment, or if you don't understand what the question is asking you to do. In those cases only, you may post about homework questions on Piazza. You can also post private messages to instructors on Piazza, which we prefer to email.
Our office hours can be found in the calendar above.
Welcome to CSE20! If you ever wondered "What sort of mathematics do I need for computer science?", this course will provide some of the answers. In particular, you will have the opportunity to learn basic concepts about algorithms, computer arithmetic, number systems, Boolean algebras, logic, proofs, program correctness, loop invariants, modular arithmetic, linear and partial orders, recurrences, and induction, among other things. These are some of the essential ingredients in the toolkit of every computer scientist.
Please click here for a course description as given in the undergraduate course listing.
Course grades will be computed using the following weights.
Grading  
Exams  65% 
Homework and participation  35% 
You must have a passing score on the final exam (50%) in order to pass the course.
Homework should be done in groups of one to three people. You are free to change group members at any time throughout the quarter. Problems should be solved together, not divided up between partners.
Homework solutions should be neatly written or typed and turned in through Gradescope by 11:59pm on the due date. No late homeworks will be accepted for any reason. You will be able to look at your scanned work before submitting it. Please ensure that your submission is legible (neatly written and not too faint) or your homework may not be graded. Submit only one submission per group. One representative group member can upload the submission through their gradescope account and then add the other group member(s) to the Gradescope submission: make sure to select their names when you "Add Group Members" to the submission; it's not enough to just list their names on the page. For stepbystep instructions on scanning and uploading your homework, see this handout.
Students should consult their textbook, class notes, lecture slides, instructors, TAs, and tutors when they need help with homework. Students should not look for answers to homework problems in other texts or sources, including the internet. Only post about graded homework questions on Piazza if you suspect a typo in the assignment, or if you don't understand what the question is asking you to do. Other questions are best addressed in office hours.
The 5% of the grade that may be earned through participation will consist of the higher score between the following two options:
After your weighted average is calculated, letter grades will be assigned
based on the following curved grading scale:
A+, A, A  B+, B, B  C+, C, C  D, F 
10088  8775  7460  Below 60 
The required textbook for this course is
This book is available in hardcopy at the UCSD Bookstore or many online retailers. You are also able to purchase an online copy of the book through McGraw Hill Connect.
We acknowledge that there are not many differences between the 7th edition and other recent editions, so you may be able to save some money by purchasing an older edition of the textbook. All posted reading assignments will refer to the chapter and section numbers of the 7th edition, but we have put together this guide so that you can easily find the corresponding sections in the 5th and 6th editions. Please be aware that while this textbook does not vary too much from edition to edition, the content of the older books might not be exactly the same as the 7th edition.
The texbook's companion website has extra practice problems and resources. In particular, the Self Assessments and the Extra Examples for each chapter are great practice materials. Access the companion website here.
You may also wish to look at the following textbook as a supplementary resource.
The full pdf of this book is available for free download from a UCSD internet connection at:
In addition to this course website, we will be using these external websites for various purposes throughout the quarter:
Date  Time  Location  
Lecture A00  Tu, Th  11:00am  12:20pm  WLH 2001 
Lecture B00  Tu, Th  12:30pm  1:50pm  PCYNH 106 
Discussion A01  Monday  1:00pm  1:50pm  WLH 2205 
Discussion A02  Monday  2:00pm  2:50pm  WLH 2205 
Discussion A03  Monday  3:00pm  3:50pm  WLH 2205 
Discussion A04  Monday  4:00pm  4:50pm  WLH 2205 
Discussion A05  Monday  7:00pm  7:50pm  WLH 2205 
Discussion B01  Monday  1:00pm  1:50pm  CENTR 222 
Discussion B02  Monday  2:00pm  2:50pm  CENTR 222 
Discussion B03  Monday  3:00pm  3:50pm  CENTR 222 
Discussion B04  Monday  4:00pm  4:50pm  CENTR 222 
First Midterm Exam  Tues Jan 26  In lecture  In lecture 
Second Midterm Exam  Tues Feb 23  In lecture  In lecture 
Final Exam A00  Thursday Mar 17  11:30am  2:30pm  TBA 
Final Exam B00  Tuesday Mar 15  11:30am  2:30pm  TBA 
Discussion section signups will be done through UCSD's Sections Tool on a firstcome, firstserved basis. You can sign up for any discussion section that still has room, regardless of which lecture you are enrolled in. Signups open at 3pm on Tuesday, January 5, the first day of class.
NOTE: This schedule is subject to change.
Date  Day  Subject  Reference  Due Dates 
1/5/16  Tues  Algorithms: pseudocode and tracing  Rosen 3.1 + Appendix 3 JS 1.1 Slides (revised after class) 
Extra worked examples from Rosen 
1/7/16  Thur  Number systems: representations and algorithms  Rosen 4.2 (+ 4.1) JS 1.2, 1.3 Slides (revised after class to fix error in one clicker question) 
Extra worked examples from Rosen 
1/8/16  Fri  HW 1 due.  
1/11/16  Mon  Discussion Section.  Rosen 4.2 # 13,14,21,22,23,24  
1/12/16  Tues  Number systems: conversions and logical operations  Rosen 4.2 + 1.1 JS 1.2, 1.3 Slides (revised after class) 

1/14/16  Thur  Propositional Logic: the connectives  Rosen 1.1 JS 3.2 Slides (typos fixed after class) 

1/15/16  Fri  HW 2 due. (File updated 1/12.)  
1/18/16  Mon  No Discussion Section.  Rosen 4.2 #14, 1.1 #49  In observance of MLK day. 
1/19/16  Tues  Propositional logic: equivalences  Rosen 1.2 + 1.3 JS 3.2 Slides (typos fixed after class) 

1/21/16  Thur  Predicates and quantifiers.  Rosen 1.4 JS 3.3 Slides 

1/22/16  Fri  HW 3 due.  
1/25/16  Mon  Discussion Section.  Review for first exam.  
1/26/16  Tues  First exam.  Exam today, covers everything before predicates (through Jan 19).  
1/28/16  Thur  Nested quantifiers  Rosen 1.5 JS 3.3 Slides 

2/1/16  Mon  Discussion Section.  Rosen 1.4 #19,29  
2/2/16  Tues  Proof strategies  Rosen 1.7+1.8 JS 3.4 + 3.5 Slides (filled in after class) 

2/4/16  Thur  Sets  Rosen 2.1 + 2.2 JS 2.1 Slides (filled in after class) 

2/5/16  Fri  HW 4 due.  
2/8/16  Mon  Discussion Section.  Rosen 2.1 #9, 17  
2/9/16  Tues  Sets  Rosen 2.1 + 2.2
Slides 

2/11/16  Thur  Induction, inequalities and constructions  Rosen 5.1 + 5.2 JS 3.6 + 3.7 Slides (updated after class) 

2/12/16  Fri  HW 5 due.  
2/15/16  Mon  No discussion Section.  Rosen 2.2 #47, 5.1 #19  In observance of Presidents' Day 
2/16/16  Tues  Recursive definitions and structural induction  Rosen 5.3 JS 2.2 Slides 

2/18/16  Thur  Structural and strong induction  Rosen 2.3 JS 2.1.2 Slides (updated after class to fix Fibonacci bound) 

2/19/16  Fri  HW 6 due.  
2/22/16  Mon  Discussion Section.  Practice exam + HW review  
2/23/16  Tues  Second exam.  Exam today, covers through Feb 16.  
2/25/16  Thur  Functions and cardinality of sets  Rosen 2.3, 2.5
Slides 

2/29/16  Mon  Discussion Section.  Rosen 5.2 # 3, 5.3 #32.  
3/1/16  Tues  Cardinality of sets and relations  Rosen 2.5, 9.1
Slides 

3/2/16  Wed  HW 7 due.  
3/3/16  Thur  Relations: equivalence relations and posets  Rosen Ch 9 JS Ch 6 Slides 

3/7/16  Mon  Discussion Section.  Rosen 9.1 #49, 9.6 #23a, 9.5 #1b,3a  
3/8/16  Tues  Modular arithmetic  Rosen 4.1, 9.4
Slides 

3/10/16  Thursday (note change!)  HW 8 due.  
3/10/16  Thur  Review day. 
Slides 

3/15/16  Tues  Lec B00 Final exam.  Final exam today at 11:30.  
3/17/16  Thurs  Lec A00 Final exam.  Final exam today at 11:30. 