CSE 311 Syllabus

CSE Home

About Us

Search

Contact Info

Main page Administration  Syllabus  Lectures Assignments and exams  Assignments  Exams Communication  Anonymous feedback  Discussion board

Instructor Aram Harrow aram@cs Office hours: Thurs 10-11 in CSE 596 (or by appointment) TAs Jason Ganzhorn ganzhj@cs Office hours: Wed 12-1:30 in CSE 220 Priya Chagaleti priyarao@cs Office hours: Tues 9:30-10:30 and Fri 11:30-12:20 in CSE 220 Lecture MWF 1:30-2:20 EEB 037 Section AA Th 1:30-2:20 MGH 251 Section AB Th 2:30-3:20 EEB 037 Textbooks Discrete Mathematics and Its Applications (sixth edition), Rosen, required, on reserve More resources are available on the textbook website. [optional] Student’s Solutions Guide, Rosen [optional] Course Overview The course examines fundamentals of logic, set theory, induction, and algebraic structures with applications to computing; finite state machines; and limits of computability. The prerequisite is CSE143 and either MATH126 or MATH136. Grading 50% homework 20% midterm (in class, May 2) 30% final (EEB-037, June 6, 2:30-4:20) You may take one (8.5"x11", double-sided) sheet of notes to the midterm and two sheets to the final. Calculators aren't allowed. Late policy You have one free late day throughout the quarter, which means that you can turn in one assignment one lecture late (i.e. normally on the following Monday). Otherwise (meaning for assignments that are more than one lecture late, or for any late homework after the first one), no credit will be given for late assignments. Requesting academic accommodations If you require academic accommodations due to a disability, please contact Disabled Student Services, 448 Schmitz, 543-8924, (TTY) 543-8925, uwdss@u.washington.edu. They will give you a letter requesting academic accommodations. Please present the letter to the instructor and we will make the accommodations you need for class. Collaboration Unless we specifically state otherwise, we encourage collaboration on homework, provided (1) You spend at least 30 minutes on each and every problem alone, before discussing it with others, (2) You write the names of people you collaborated with for each problem, and (3) You write up each solution in your own writing, using your own words, and understand the solution fully. Cheating Copying someone else's homework is cheating, as is copying solutions from another source (the web, other classes, etc.). If you are caught cheating, you can expect a failing grade and initiation of a cheating case in the University system. If you're not caught, cheating will still undermine your education, even if it might not seem like it at first. If you feel that you are having a problem with the material, or don't have time to finish an assignment, or have any number of other reasons to cheat, then talk with the instructor or the TAs. Just don't cheat. To avoid creating situations where copying can arise, never e-mail or post your solutions. You can post general questions about interpretation and tools but limit your comments to these categories. If in doubt about what might constitute cheating, ask one of us describing the situation. Topics Logic and proofs Chap 1 Sets, functions and relations Chaps 2,8 Number theory Chap 3 Induction Chap 4 Relations Chap 8 Graphs and trees Chaps 9,10 Circuits Chap 11 Finite state machines and computability Chap 12

	Computer Science & Engineering University of Washington Box 352350 Seattle, WA  98195-2350 (206) 543-1695 voice, (206) 543-2969 FAX [comments to Aram Harrow]