Richard Johnsonbaugh. Discrete Mathematics, Seventh Edition (e-book version
available). Prentice Hall, 2008. Course Description. The purpose of this course ...
CSUS COLLEGE OF ENGINEERING AND COMPUTER SCIENCE Department of Computer Science CSc 28 Fall 2013 Faroughi
DISCRETE STRUCTURES FOR COMPUTER SCIENCE
Course Syllabus Instructor Gita Faroughi Office: RVR 5015 Office Hours: MW 2:50-3:30, F 11-12:30 Other times by appointment, at my convenience E-mail:
[email protected] Classroom : RVR 1013
Note:
portable phones and pagers can be very disruptive please make sure they are turned off during class time.
Text Richard Johnsonbaugh Discrete Mathematics, Seventh Edition (e-book version available) Prentice Hall, 2008. Course Description The purpose of this course is to help students understand the interrelationship between discrete mathematical structures and various areas of computer science. The mathematical material will be presented informally with emphasis on applications. Prerequisites Math 29 (Pre-Calculus) Csc 20 (Programming Concepts and Methodology II) which may be taken concurrently. Your Responsibilities You will be expected to think rather than learn by rote. I will put great effort into helping you but I cannot do it alone, you have to do your share. Be inquisitive, ask questions (there are no "dumb" questions, only dumb silences). Make an effort to understand the issues, in other words be an active participant in the learning process. Keep up with the course material on a regular basis. It is vitally important that you attend all classes, that you be there on time, and that you submit your work on time. The importance of timeliness will also be reflected in grade penalties. I certainly will try to help you if major and unforeseen circumstances keep you away from class, but you must understand that, unless you are willing to commit yourself seriously to this class both by participating and by working on it on a regular basis, you might as well not take it. The benefits you get from this class will be in direct proportion to the quality of your effort. Participating actively in classroom discussions also means that at times you will sometimes say things which, on further notice, you may feel embarrassed about. Please don't, we all on occasion go through such experiences. I hope you will never make fun of your classmates (or me for that matter), and that we will operate in an atmosphere of mutual respect. I much rather that you ask a question which reveals a gross misunderstanding, than see you bottle up major misconceptions. You are not expected to know everything, not even a lot of things but you are expected to be here to learn and think. By definition this means that you will make mistakes along the way.
1
Laboratories and Assignments General Guidelines You should expect to have some tasks to complete every week. This work may or may not be graded but it will prepare you for the quizzes and exams, and give you and me an idea of your progress. It is all right for you not to know or understand something (otherwise you would not be a student, right?) so do not feel embarrassed to ask for help. You must follow the instructions for each assignment precisely. If you do not understand what is required, ASK. I may alter the requirements of an assignment during lecture. In such cases, I will presume that one mention of the changes is all that is necessary. It is your responsibility to obtain that information if you are not present in class.. You are responsible for anything that is mentioned in class. All homework must be stapled and clearly labeled on the outside as follows:
CSC 28
Instructor: Gita Faroughi Your Name
Homework Description: assignment number (from assignment sheet) Make sure that questions are clearly labeled with Chapter (or page) # & question # Improperly labeled assignments will not be graded
Collaboration, Cheating Students are expected to do their own homework and write their own programs. Although discussions are encouraged, cheating will be severely penalized. Close similarity among programs will be considered cheating and subject to appropriate penalties. I reserve the right at anytime to ask you for explanations regarding any code you include in your program. You are responsible to take care of your code and not share it or allow others to gain access to it. Similar programs are BOTH subject to be penalized. Data security is a problem we all must be aware of when we deal with electronic forms of data. Do not leave your program on the hard disks in the labs. Exit your programs when you are through with a computer. Throw printouts away somewhere other than the labs, preferably off campus. Don't send a job to the printer unless you are going to be around long enough to be able to get it off the printer before you leave the lab. Exams General Guidelines There will be frequent quizzes (this could be nearly every week and they may or may not be announced), two midterms and a final.
Note: There will be no make-up exams except in cases where prior arrangements have been made for good reasons (prior to the scheduled exam date, that is), and even then only with a letter from your doctor or boss or some similar evidence of overwhelming need to miss the exam. Calculators are not allowed. Exam Contents The quizzes and exams will be based on lectures, handouts, textbook readings, including exercises from the textbook, and the homework assignments. In many cases, they will be taken from the reading material from the preceding week. (Note that the reading material for a given week in the schedule generally applies to the lectures and labs for the following week. I will make extensive use of the material in the text -- you are responsible for 2
reading and understanding the material in the text. These quizzes will be short, usually only a few questions. If you are present, you will always get at least one point for just putting your name on the page, so you are always better off to be present for a quiz, even if you don't know the material. Under no circumstances may any quiz be made up, although a student might possibly be excused from a quiz for medical or other extreme situations, provided these are documented. In general there will be no make up exam. You would have to have an extremely good reason for me to deviate from this policy. If you are in a situation where you need additional time, let me know so that I can accommodate.
Grading General Policy (I always reserve the right to make changes if something unusual occurs) The expected grading policy is Homework Quizzes Midterm(s) Final Attendance & Participation
approx. 15% approx. 15% approx. 25% approx. 35% approx..10%
Discrepancies in grade recording It will be the responsibility of each student to keep track of his/her points on all quizzes, assignments, etc If there is any discrepancy, you should bring it to my attention immediately. For this reason, it is STRONGLY advised that you retain all graded assignments, quizzes, etc., as proof in case of discrepancies. Furthermore, you should not erase any programming assignment from your diskette until the end of the semester. Incompletes Incompletes will be given ONLY to students who have a passing grade at the time that an OVERWHELMING and UNCONTROLLABLE problem, which is entirely out of their control, causes them to discontinue the course. Computer Science department policy governs the assigning of Incompletes, and they are not given lightly. I will follow department policy to the letter. Please do not ask me to do otherwise. Adds The deadline for adds is the fourth week of the semester, after that date no add are allowed. As a general practice it is recommended that you check your enrollment status on MySacState prior to the beginning of the fourth week. Drops The policy on dropping courses is established by the department, and it will be adhered to in this class. Unrestricted drops will be allowed only during the first six weeks of the semester. After that time, a drop will be allowed only for serious and compelling non-academic reasons, and supporting documentation will be required. After the first six weeks, no one will be allowed to drop unless they have a passing grade at the time. Toward the end of the semester, the rules get even more restrictive. During the last three weeks of the semester, absolutely no drops are allowed for any reason. Grade of ‘WU’ (Unofficial withdraw): I will give a ‘U’ to anyone who fails to drop this course and stops attending before the first midterm. If you take the first midterm and then stop attending without dropping the course, you will be given an ‘F’ for your final grade. A ‘U’ grade is averaged into your GPA the same as an ‘F’. Grade replacement If you are re-taking this course to replace a grade, you MUST file a repeat petition very early in the semester (third week). Second and subsequent repeats may not be allowed. If they are the grade you obtain will be averaged with earlier grades (except the first). Course Outline A course outline will be distributed and should give you an idea of the topics covered. Because I want to build solid foundations I may go more slowly than I plan, I will keep you up to date regularly. General Advice 3
I strongly encourage you to study in groups. If done intelligently (meaning that everybody contributes and participates) this is very useful in understanding the material. The point is that you need to ask questions. The other members of the group may ask questions you did not think of and which will clarify your ideas on the subject. Copying other people ideas without thinking is, of course, self defeating.
4
CSUS COLLEGE OF ENGINEERING AND COMPUTER SCIENCE Department of Computer Science CSc 28 Fall 2013 Gita Faroughi
DISCRETE STRUCTURES FOR COMPUTER SCIENCE Course Schedule (Tentative)
Textbook: Discrete Mathematics, seventh edition by Richard Johnsonbaugh, Prentice Hall, 2012
TOPICS
READING* Chapter 1 Section 1.1 Section 1.2 Section 1.3 Section 1.4 Section 1.5 Section 1.6 Chapter 2 Section 2.1 Section 2.2 Section 2.4 Chapter 3 Section 3.3 Section 3.4 Section 3.5 Section 3.6 Section 3.1
8
Sets & Logic Sets Propositions Conditional Propositions and Logical Equivalence Arguments and Rules of Inference Quantifiers Nested Quantifiers Proofs Direct Proofs Proofs by Contradiction Proof by Induction Relations, Functions, Relational Databases Relations Equivalence Relations Matrices of Relations Relational Databases Functions Midterm 1 on 10/7 Algorithms Recursion Representation of Non-Integer
9
Counting Methods and the Pigeonhole Principle
Chapter 6
Boolean Algebra & Circuits
Chapter 11
Mathematical Models of Computation & Finite State Automata
Chapter 12
WEEKS 1, 2 & 3
4
5&6
7
10, 11 & 12 13, 14 &15 *
Chapter 4 Section 4.4
This reading covers the topics listed for the week. The reading should be completed prior to your first lecture of the week in which the reading is listed, so you are prepared to get the most out of the lecture and to ask questions about the areas you find confusing.
1
