CSE20 - Discrete Mathematics for Computer Science, Fall 2016
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.
Section A: class MWF 10-10:50am, Center 212; discussion W 8-8:50pm, Center 105
Section B: class MWF 11-11:50am, Center 119; discussion M 5-5:50pm, Center 212
We follow an online book. Please sign up at zyBooks, Enter code UCSDCSE20LovettFall2016, click "Subscribe".
The cost to subscribe is set at $48; any applicable returning student discounts will be applied automatically. Subscriptions will be valid through 12/16/16.
Other optional textbooks which cover similar material:
Essentials of discrete mathematics, by Hunter.
Discrete Mathematics and Its Applications, by Rosen.
Discrete Mathematics with Applications, by Epp.
Fundamentals of Discrete Math for Computer Science: A Problem-Solving Primer, by Jenkyns and Stephenson.
The book is available for free download from a UCSD internet connection
Homework is due on Mondays, except for weeks with midterms. Submission is online via Gradescope
(you should be enrolled already; if not, enroll using your UCSD email and the code M458W9).
Homework should be solved in groups of 3-4 students (you can change groups for different homeworks).
Submit only one submission per group.
No collaboration or discussion outside the groups is allowed (but if you are stuck on a problem, please come to discussion or office hours).