CSE 20

Instructor

Project Instructor

Teaching Assistant and Tutors

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 computer arithmetic, number systems, Boolean algebras, logic, proofs, 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.

You are welcome to browse around on this website. There is a lot of useful material on-line. In particular, all homework, homework solutions, and the in-class tests will be posted here, as will important announcements.

Course Description:

Please click here for a detailed course description as given in the undergraduate course listing.

Grading:

There will be four in-class tests worth a total 30% of the grade. Each test will cover one unit from the textbook. The tests will be given during the usual lecture time and place, in the first half of the lecture. No makeup tests will be given, but only the top three scores will be used (to accommodate one excused absence per student). No calculators or note sheets are allowed for the tests. The final exam will be worth 60% of the grade. One (double-sided) note sheet may be used during the final exam. The remaining 10% of the grade will be the highest between the following two options:

• Preclass reading quizzes: each week, short quizzes will be available on Ted. These short quizzes are based on the definitions introduced in the textbook section for the week. To receive credit for each quiz, you should complete and submit the quiz by 2pm on the assigned lecture day.
• iClicker Participation: peer instruction will be used during lectures to facilitate learning. Please register your iClickers on Ted. Participation in at least 80% of the questions will give full credit for that lecture.

Homework will be assigned but will not be collected. Homework questions will be posted regularly, followed by solutions. It is essential that you do the homework since this is the only way that you can gain mastery of the techniques we will study (and because the tests will be based in large part on the homework!).

We will compute a percentage score based on your coursework and then assign a letter grade as follows:
  A     88.0 - 100%
  B     75.0 - 87.9%
  C     60.0 - 74.9%
  D     50.0 - 59.9%
  F     below 50.0%
If the class median on a test is below 75% (which is typical), then we normalize all scores upward so that the median is 75%. We normalize by adding a fixed number of points to every score. Scores are not capped at 100%. If the median on an exam is above 75%, fantastic!

Projects: Many of the topics we'll be talking about in this class are the foundations of advanced and cutting-edge computer science problems. You will have the opportunity to explore these problems via a few extra credit projects throughout the quarter. Background material for the projects will be presented by Prof. Russell Impagliazzo in special discussion sections announced on the class Google calendar. Following each of these discussion sections, we will post detailed project information below.

Academic Integrity:

The Jacobs School of Engineering code of Academic Integrity is here. You should read it!

The most recent announcements will posted first. It is a good idea to check these from time to time to be aware of changes in schedule, etc.

- Final Exam information!
REC GYM Monday, 12/9 from 3:00 pm to 5:59 pm.
Note sheet allowed for exam.
Extra office hours are available Thursday 12/5 from 12:30pm to 3pm.

- The graded Test 3 papers can be picked up Wednesday November 20 in CSE4206 1-2pm , or PCYNH 122 2pm-3pm or 4pm-5. They can also be picked up Thursday November 21 in CSE4206 2pm-3pm. - You have the opportunity to submit corrected solutions for Question 3 on Test 3. Corrections must be on a new piece of paper (the exam should not be altered), and can earn back up to 50% of points lost. Corrections are due by 12pm Monday November 25 in CSE4206.

- The first test has been graded. You can pick up your tests from the TA in Discussion Section or from Prof. Minnes in office hours. Any regrade requests must be made by October 28. Overall, the test was very well done -- congratulations!

-A review sheet is now available for Test 1. The test will take place on Tuesday October 15 during the first portion of the lecture period. No aids (calculators, note sheets) are allowed during the test. The test covers the material in Unit BF (Homeworks 1 and 2).

- The lectures in this class will be podcast: find our links at podcast.ucsd.edu

The textbook material for this course is Lectures In Discrete Mathematics: First Course. The material can be found at the following links:

• Boolean Functions and Computer Arithmetic
• Logic
• Number Theory and Cryptography
• Equivalence and Order
• Inductions, Sequences, and Series

You may want to print out this material for easy reference. A paperback version on this material is available from Amazon for $6.50 (used). While we won't cover all of this material in the lectures, you should read it in any case. There are a number of other sources on the Web that cover this material. For example, you can look at: http://www.macalester.edu/~hutchinson/book/book.html or http://www.cse.iitd.ernet.in/~bagchi/courses/discrete-book/fullbook.pdf.