This course is an introduction to discrete mathematics. If you have ever wondered “What sort of mathematics do I need for computer science?” this course will provide some answers. In particular, you will have the opportunity to learn basic concepts about boolean functions and number systems, predicate and propositional logic, elementary number theory, induction, equivalence and order. These are some of the essential ingredients in the toolkit of every computer scientist.

You are welcome to browse through this web site. There is a lot of useful material on-line. In particular, all homeworks, homework solutions, and the midterm exam will be posted here.

- Course Description from the General Catalog
- Textbook: All registered students are automatically enrolled in the
**Inclusive Access**program. (See Textbook page for details and**opt out**instructions.) If you are registered in the course and do nothing,**your UCSD Bookstore account will be charged $50.00 on April 14, 2018.** - Course Syllabus
- Schedule and Policies
- Lecture Podcasts: Sec A Sec B
- Course Calendar with Lecture Notes / Slides
- Homework Submission
**Announcements and Q&A**are through Piazza Site for CSE20 (sign up link http://piazza.com/ucsd/spring2018/cse20.)

**Contact:** The instructional team is regularly available on piazza and posting your questions on the discussion board is the best way to reach them. Confidential questions can be made as “private posts”. Instructor, TAs and Tutors will be available for group office hours as posted on piazza.

**Instructor:** Daniele Micciancio

**TAs:** Ivan Mikhailin, Christopher Tosh, Anisha Motwani, Ashutosh Parekh, Sakshi Shah

**Tutors:** David Hacker, Xinyi He

- Discrete Math on Wikipedia
- History of Mathematics
- List of Logic Symbols
- Textbook Companion Website
- Guide to Older Textbook Editions
- Free eBook on Discrete Math
- Another Free eBook

(c) Copyright 2018