Math 326 - Discrete Mathematics

Math 326

Discrete Mathematics
Fall 2010 - Class Number 14944
Class Meeting Time/Location: TuTh 5:30 - Chaparral (CR) 5114

Quick Links: Homework | Schedule | Lecture notes | Chapter Reviews
Formula Sheet (.pdf) (.tex) | Tests: Test 1, Test 2, Test3
Homework Solutions: Ch 2.1-3.2, Ch 3.3-3.8, Ch 4, Ch 5

Announcements

Final grades have been submitted to SOLAR effective 12/20/2010.
They should be visible to you after the next database update in a few days, possibly as early as tomorrow.

Have a safe and happy holiday!

MATH 326.* DISCRETE MATHEMATICS (3). Prerequisites: MATH 150B; PHIL 230. Propositional calculus, predicate calculus, set algebra, relations, functions, mappings, fields, number systems.

*Catalog description. Coverage of propositional and predicate logic will be minimal as students have already been exposed to these topics in the pre-requisite (PHIL 230). Students who have taken ECE 320 but not PHIL 230 may find this material challenging and may require extra study.

**This class is not appropriate for mathematics majors, who should take Math 320 instead. This class is intended for students majoring in Computer Science. Please see the schedule of classes Class Notes: 7613 Enrollment limited to students not majoring in Mathematics.

Instructor:	Bruce E. Shapiro bruce.e.shapiro at csun.edu The best way to reach me is by email. I may respond from a different email address. If your ISP has a spam blocker then don't expect any reply. I will sometimes send emails to the entire class, but those emails will only be sent to the official CSUN address you have listed on SOLAR. If you don't check your CSUN email you should set up email forwarding to your regular email address. A phone number will be provided in class. My day job is at Caltech so don't expect to find me in my CSUN office.

Class Web Page:	http://beshapiro.com/math326/ Assignments and announcements will be posted on the web page so you should check it regularly.

Office Hours:	Hours and location will be announced in class. Most people find Santa Susanna Hall pretty creepy and I do not hold my office hours there; it will either be in the bookstore (2nd floor) or Sierra center.

Textbook:	Discrete Mathematics with Applications, 3rd Edition by Susanna S. Epp, Cengage (2004) $190.99 List Price (ouch). [ Publisher close out price: $134.49 ] ISBN 9780534359454. Publisher's Web Site Look for a copy on the internet Errata (author's web page) The book weighs about a gazillion pounds. You are not required to bring it to class. The fourth edition, released in mid-August, is what the bookstore ended up with. Either the 3rd or 4th edition can be used. I still have not had a chance to examine the 4th edition in any detail because the publisher refused to send me an advance copy and my desk copy was stolen from the math department mail room before I even knew it was there. $201.99 from Publsher $229.95 from Matador Bookstore Here is list of other books that you might want to look at, as if the text book isn't already heavy enough to carry around with you.

Grades:	• 3 midterms given in class on Tues 9/14, Tues 10/12, Tues. 11/16.* • Mandatory Final Exam (counts as two midterms). • Homework* (counts as one midterm). • Attendance (required). • No computing projects are planned. Exam dates are subject to change. Makeup exams will not be given. If you have a valid excuse for missing an exam (e.g., a note from a doctor) the proportions of the other exams will increase. The final exam is scheduled for DEC 14, 2010, 05:30 PM - 07:30 PM, attendance is mandatory, The date and time cannot be changed (unless you make arrangements through DRES). This time was set by the university, and not by me. If you know are unable to attend at that time, do not take the class. If you miss the final you will fail the class. **25% Bonus if typed. See my LaTeX notes if you want help getting started with LaTeX.

Attendance:	Attending every class is required. Roll will be taken. Your grade will be significantly penalized for missing classes without a valid excuse. As per university policy, if you miss both classes during the first week of the semester you will be administratively dropped.

Student Learning Outcomes:	The student will be able to: Construct mathematical proofs using formal logic. Understand, distinguish between, and apply the different methods of mathematical proof, such as direct proof, proof by contradiction, disproof by counter-example, and proof by mathematical induction. Apply the basic concepts of number theory, set theory, counting, sequences, functions and relations to problems in computer science. Prove the correctness and efficiency of computer algorithms.

Topics Covered:	Different methods of proof will be presented (1-4) along with examples illustrating their use in different application areas (5-11). Direct and algebraic Proof. Proof or disproof by counterexample. Proofs by contradition and contraposition. Mathematical induction and well ordering. Sequences and series. Elementary number theory. Basic concepts of set theory. Counting. Functions and relations. Recursion. Efficiency of algorithms.

Permission Numbers:	I will not provide permission numbers before the first week of class. Please do not email me asking for a permission number. First time students (students who have not taken the class before) have registration priority; this is university policy, and I will not violate that policy regardless of your reason for wanting to take the class. Qualified students will be allowed to add the class on a space-available basis after the semester starts, but only if you attend classes during the first week of the semester.

Special Needs:	If you have special learning needs please make arrangements through DRES. I will make a reasonable effort to make accommodation for your needs.

Academic Dishonesty:	Is not permitted. For more detail see the Student Conduct Code. I ask students to sign a contract agreeing to abide by the student coduct code. If this makes you uncomfortable, don't take the class. If you don't plan on cheating it shouldn't be a problem.

Cookies:	Bring enough for the whole class. Keebler Grasshoppers are my favorite, but any kind of chocolate chip are also good. No Oreos, please! (This also applies to burgers as they stink up the class. I especially like Charburgers from the Habit, no cheese).