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 2-2:50, Center 113; discussion W 5-5:50, Ledden auditorium
Section B: class MWF 3-3:50, Center 113; discussion M 9-9:50, Center 105
Section C: class MWF 8-8:50, Center 105; discussion M 4-4:50, Center 212
Instructor (sections A,B)
Prof. Shachar Lovett
M,F 10-11, CSE 4234
Instructor (section C)
Prof. Miles Jones
W 10-11, 2-3, CSE 2128
T 4-6, CSE 4217
Th 2-4, CSE 4217
M 12-2, CSE basement B260a
F 12-2, CSE basement
T 10-12, CSE basement B275
Th 4-6, CSE 4217
Rachel Ann Keirouz
Th 11-1, CSE basement
M 12-1 and 5-6, CSE basement B275
We use an online book. Please sign up at zyBooks, Enter code UCSDCSE20Fall2015, click "Subscribe".
The cost to subscribe is set at $40; any applicable returning student discounts will be applied automatically. Subscriptions will be valid through 01/02/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 Tuesdays, except for weeks with midterms. Homework should be solved in groups of 3-4 students. Submission is online via
one submission per group. No collaboration or discussion is allowed outside the groups.