CS/APMA 202, Spring 2005Tu/Th 3:30-4:45Olsson Hall room 120Instructor: Aaron Bloomfield. Office: Olsson Hall, room 228D ( ).Course web page: http://www.cs.virginia.edu/~asb/cs202/Introduction: This class will probably be different than any other math class you have taken. You are invited(encouraged, even) to work together on the homeworks. The homeworks count for very little of the grade, but areone of the primary means for learning the material. There will be two finals at the end of the semester, a writtenfinal and an oral final.Course objectives:1. Logic: Introduce a formal system (propositional and predicate logic) which mathematical reasoning is based on.(sections 1.1-1.4)2. Proofs: Develop an understanding of how to read and construct valid mathematical arguments (proofs) andunderstand mathematical statements (theorems), including inductive proofs. Also, introduce and work withvarious problem solving strategies and techniques. (sections 1.5, 3.1, 3.3, 3.4) 3. Counting: Introduce the basics of integer theory, combinatorics, and counting principles, including a briefintroduction to discrete probability. (sections 2.4, 4.1-4.4, 5.1)4. Structures: Introduce and work with important discrete data structures such as sets, relations, sequences, anddiscrete functions. (sections 1.6-1.8, 2.7, 3.2, 7.1, 7.3-7.6)5. Applications: Gain an understanding of some application areas of the material covered in the course. (sections2.6, 3.6, 10.3)Office hours: Tu/Th 1-2:30, or by appointment. TA office hours will beposted on the website.Pre-requisites: C- or higher in CS 101 or APMA 111Textbook: Kenneth Rosen, Discrete Math and Its Applications, 5th edition.McGraw Hill, 2003. ISBN 0072930330. This book is required for thecourse. We will be covering sections 1.1-1.8, 2.4, 2.6, 2.7, 3.1-3.4, 3.6, 4.1-4.4, 5.1, 7.1, 7.3-7.6, and 10.3 (although this may change slightly as thecourse progresses). A tentative schedule is available on the website (underthe Syllabus section). Also see the book’s website athttp://www.mhhe.com/rosen.Optional textbook: Kenneth Rosen, Student's Solutions Guide foruse with Discrete Mathematics and Its Applications, 5th edition. McGrawHill, 2002. ISBN 0072474777. This book has full solutions to all the odd-numbered problems in the textbook. It will also be available on reserve inthe Engineering library.Make sure to get the 5th edition of both texts!Philosophy: I believe this course should be hard but fair. The test questions will be difficult, but the curve willensure that the average grade is in the B range. If for any reason you feel the course is not being fair (too muchwork, too much expected of the students, to harsh grading, a bad grading curve, etc.), let me know and I will do mybest to correct it. I believe in being available for the students so they can learn the material. My preference is forstudents to come to office hours, but if you cannot make those, I will make sure to find the time (with sufficientnotice, of course) to meet outside my office hours.Grades: Grades will be calculated by the following formula:● 20%: Midterm 1● 20%: Midterm 2● 25%: Final written exam● 15%: Final oral exam● 20%: HomeworksThe grades will follow a standard curve: once the final numerical grade has been computed according to theabove formula, the average grade will be somewhere in the B range. Doing significantly better than the average willreceive an A. Doing significantly worse than the average will receive an F. I reserve the right to modify thisformula slightly by adding quizzes (more on this later).Homeworks: There will be approximately 25 homeworks throughout the semester. As there are 28 lectures, thatmeans one homework will be due at almost every class (no homework the first day or the two test days). Eachhomework will generally consist of four or so problems from one section of the course textbook, and will usuallycover or augment material gone over in lecture. They will generally be assigned during the lecture in which thematerial is covered (although they may appear on the website prior to that), and will be due one week later. Thus,there may be multiple homeworks assigned at any one time, although only one will be due on any given class date.You are invited to work together on the homeworks, although each student must submit their own copy. However,copying the homeworks will keep you from learning the material for the exams, and the exams are worth a total of80% of your grade. Of the homework questions given, some (but not necessarily all!) will be graded for the gradefor that homework. As you are allowed to work with each other on the homeworks, they will not be pledged.Homeworks are due at the BEGINNING of class. This means that by 3:35, if your homework is not in, it is late.If you cannot make class, you can turn it in to me before hand, or to the CS secretaries (Ginny Hilton in Olsson 205or Brenda Perkins in Olsson 204). Any homework handed in after class starts (or slipped under my office doorduring class) will receive 25 off (out of 100). Any homework turned in the following day will receive 50 points off;no homeworks will be accepted more than one day late. The solutions to the homeworks will be posted to thewebsite after the due date.Exams: There will be a total of four exams. All exams will be pledged. The two midterms will be during class on24 February and 7 April. There will be two finals, a written exam (Saturday, 7 May from 9:00 a.m. to 12:00 noon)and an individual oral exam to be scheduled during finals week. The oral exam will consist of the studentexplaining the solution to 5 (or so) problems in a 20 minute period. The exams will focus on the most recentmaterial taught, but will include all the material covered so far in class. The Engineering School Dean has veryexplicit rules about missing or rescheduling exams. This class will abide by those rules. If you are going to miss anexam, make every effort to notify me before the exam. Note that the first exam will be returned before the SEASdrop date.Problem sets: There will be three different types of problems given out during the course. Although most willcome from the textbook, there may be some non-textbook problems as well. The first set is the problems given foreach homework assignment. The second set of problems will be those presented in class. The last set