MATH 241: DISCRETE MATHEMATICS FOR COMPUTER SCIENCE, Winter CLASSROOM: Alumni Hall 112 Tuesdays and Thursdays, 6:00-8:15 pm

Transcription

1 MATH 241: DISCRETE MATHEMATICS FOR COMPUTER SCIENCE, Winter PROFESSOR: Melody Rashidian CLASSROOM: Alumni Hall 112 TIME: Tuesdays and Thursdays, 6:00-8:15 pm CONTACT INFORMATION: WEB PAGE: OFFICE HOURS: Tuesdays and Thursdays, 8:15-8:30 pm, Alumni Hall 112 TEXTBOOK: Kenneth H. Rosen, Discrete Mathematics and Its Application, Sixth Edition My teaching philosophy focuses on meeting your needs during this course by providing a stimulation environment, building self-steam, open communication, and practicing a blend of independent and cooperative learning style. COURSE DESCRIPTION This is a 4-unit course that covers mathematical concepts and techniques useful to computer science majors. Topics include logic, sets, counting, probability, relations and function, induction, recurrences, and graphs and trees. COURSE OUTCOMES Discrete Mathematics consists of discussions and graded group-learning sessions. Upon successful completion of Discrete Mathematics (Math 241) the student will be able to: o Identify, interpret, assess, and evaluate relevant information. o Recognize premises, assumptions, and point(s) of view underlying an argument, theory or selection of information. o Reach fair-minded conclusions that are well-reasoned and well-supported. o Demonstrate comprehension of field-specific content. o Analyze issues, problems, and/or questions based on disciplinary knowledge and experience, which may include real world or laboratory situations. EXERCISES o There will be about 8 homework assignments. o The material in this class can only be learned by doing lots of problems, so the homework is very important.

2 o Exercises are intended to reinforce the concepts and techniques discussed in class, as well as help students gain mastery of the material. o Selected problems on each assignment will be graded and credited. o It is your responsibility to have all of the problems correctly completed by the following class meeting. Before the lecture, you may ask question regarding the homework exercises. o Late homework will not be graded and will be counted as ZERO. No make-up homework. GROUP WORK o Group problem solving is one the primary methods of instruction for this class. o You will work in groups of 3 to 5 each class meeting on an assignment. o At the end of the class all of the papers will be collected, but only one paper from each group will be graded. o Everyone in the group received that score. Each group work assignment is worth five points. o If you have to leave class early, you will receive a zero point for that day s work. o You must work in a group of 3 to 5, or your paper will not be graded. o Group work cannot be made up. EXAMS: o All exams are closed-book, not notes allowed. o The lowest of the three test scores will automatically be replaced with score on the final exam. o There will be no early or late makeup exams. Grading: Your final grade will be determined by the following: Component percentage Tests 50% Homework and Group work 20% Final Exam 30% [93-100] A [88-90) B+ [80-83) B- [73-78) C [60-70) D [90-93) A- [83-88) B [78-80) C+ [70-73) C- [0-60) F

3 TENTATIVE COURSE SCHEDULE 11/23 Tuesday o Introduction o 1.1 Propositional Logic 11/30 Tuesday o 1.2 Propositional Equivalence o 1.3 Predicates and Quantifiers 12/02 Thursday o 2.1 Sets o 2.2 Set Operations 12/07 Tuesday o 2.3 Functions o 2.4 Sequences and Summations o Homework assignment #1, Due 12/09 Thursday o 3.1 Algorithms o 3.2 The Growth of Functions 12/14 Tuesday o 3.3 Complexity of Algorithms o Review o Homework assignment #2, Due 12/16 Thursday o Exam #1 o Homework assignment #3, Due 01/04 Tuesday o 3.4 The integers and Division o 3.5 Primes and Greatest Common division 01/06 Thursday o 3.6 Integers and Algorithms o 1.6 Introduction to proofs 01/11 Tuesday o 4.1 Mathematical Induction o 4.2 strong Induction and Well-Ordering o Homework assignment #4, Due.

4 01/13 Thursday o 4.3 Recursive definitions and Structural Induction o 4.4 Recursive Algorithms o Homework assignment #5, Due. 01/18 Tuesday o 5.1 The Basics of Counting o 5.2 The Pigeonhole Principle 01/20 Thursday o 5.3 Permutations and Combinations o 5.4 Binomial Coefficients o Homework assignment #6, Due. 01/25 Tuesday o Exam #2 01/27 Thursday o 6.1 An Introduction to Discrete Probability 02/01 Tuesday o 7.1 Recurrence Relations o Homework assignment #7, Due. 02/03 Thursday o 7.2 Solving Linear recurrence Relations 02/08 Tuesday o Exam #3 o Homework assignment #8, Due. 02/10 Thursday o Review for Final 02/15 o Final Exam Due to the Thanksgiving Holiday, we will have a make-up session at January 14 th. This is going to be a blackboard discussion. Everybody is required to participate. The subject and the time of discussion will be announced at the later date.

5 COURSE EVALUATIONS STATEMENT: All course evaluations are now conducted online. Your feedback is important to us. You will receive an message reminding you when the website is open for your feedback. The link is: DISABILITY STATEMENT: California Lutheran University is committed to providing reasonable accommodation in compliance with ADA of 1990 and Section 504 of the Rehabilitation Act of 1973 to students with documented disabilities. If you are a student requesting accommodations for this course, please contact your professor at the beginning of the semester and register with the Accessibility Resource coordinator for the facilitation and verification of need. The accessibility Resource Coordinator is located in the Center for Academics and Accessibility Resources (CAAR) office in Pearson Library, and can be contacted by calling or ing wperkins@callutheran.edu. ACADEMIC HONESTY: The educational programs of California Lutheran University are designed and dedicate to achieve academic excellence, honesty and integrity at every level of student life. Part of CLU s dedication to academic excellence is our commitment to academic honesty. Students,faculty, staff and administration share the responsibility for maintaining high levels of scholarship on campus. Any behavior or act which might be defined ad deceitful or dishonest will meet with appropriate disciplinary sanctions, including dismissal from the University, suspension, grade F in a course or various forms of academic probation. Policies and procedures regarding academic honesty are contained in the faculty and student handbooks. Plagiarism, cheating, unethical computer use and facilitation academic dishonest are examples of behavior which will result in disciplinary sanctions. Plagiarism includes, but is not limit to: o Word for word copying without using quotation marks or presenting the work as yours. o Using the ideas or work of others without acknowledgement. o Not citing quoted material. Students must cite sources for any information that is not either the result of original research or common knowledge. PEARSON LIBRARY At Cal Lutheran we won t tell you what to think-we ll teach you how to think. You ll learn how to gather information, analyze and synthesize. Don t worry about the gathering that s the easy part. We have technicians, information specialists, and trainers to help you find the information you need. Pearson Library provides access to scholarly books, journals, ebooks, and databases of full text articles form scholarly journals. To begin using these materials, visit the library web page Librarians are available to assist you at the Thousand Oaks campus or via Meebo chat on the Library s home page or ing CLULibrary@callutheran.edu. You may contact the library at (805) If you attend

6 classes at one of CLU s satellite locations, see Callutheran.edu/iss/research/satellite.php for the full range of services provided. CLU WRITING CENTER Experience Writing Center tutors help CLU s undergraduate and graduate students with their writing projects: reading free writes to find the best ideas, refining thesis statements; showing students how to structure paragraphs, and using specific exercises to improve sentence syntax. They work with whole classes as well as with individual students on the style guidelines required for papers in the various disciplines. All enrolled CLU students are invited to make use of our services. For additional information, please visit call , book online at GenBook, or stop by the Writing Center (The Darling Collaboration Suite in the library) to schedule an appointment. STUDY HINTS: Read the appropriate sections after each class carefully and then do all the homework assignments before next class. This is an important step to successfully learn the material. The general rule of success requires that you spend 3 hours studying for each one hour you spend in class. Team-up with a classmate for study outside of the class time. Actively participate in class by asking questions when you need more explanation, provide answers to questions asked during class. Always remain calm, and keep a positive mental attitude toward the course. Attendance and participation are required for success. Students should work enough each week to meet weekly progress goals. The goals become very difficult to meet if you fall behind, so you must budget enough time to complete weekly expectations IMPORTANT DUNIVERSITY DATES: November 25 Thursday Thanksgiving Day (no classes) December 6 Monday Last day to add; last day to drip (without a W ) December 20 Monday Christmas break begins January 3 Monday Classes resume January 17 Monday Last day to withdraw without academic penalty February Monday-Thurs Final Exams