This action might not be possible to undo. Are you sure you want to continue?
Summer 2012 May 07, 2012 – Aug 12, 2012 On-line Format 14 Weeks Monday, 6:00 - 7:30 PM Eastern
COURSE NAME: MCIS 502, Mathematics in Computing. INSTRUCTOR: Dr. William Hartman, Ph.D. Graduate School of Computer and Information Sciences Nova Southeastern University 3301 College Ave. Ft. Lauderdale FL 33314-7796 Email: firstname.lastname@example.org (preferred method) Home Page: http://www.scis.nova.edu/~whartman Phone: 954-262-2077 (O) Phone: 305-822-3365 (H) (leave message) Fax: 954-262-3915 Office Hours: Although distance precludes normal office hours, email is always available (preferred) and telephone conferences can be scheduled as needed via email. An on-line office hours schedule will be posted at Blackboard Announcements.
REQUIRED TEXT: . Rosen, Kenneth H. (2011). Discrete Mathematics and its Applications, (7th Ed). New York: McGraw-Hill. Text only. ISBN 13: 978-0-07-338309-5 RECOMMENDED TEXT:
Grade distribution and a critique of each exam will be provided before the next class session. state models and abstract algebraic structures. Weekly electronic classroom (ECR) sessions and all assignments will use NSU's Blackboard system. It is recommended as a general aid for all distance-learning students and particularly for students that feel they might need additional assistance. ISBN 13: 978-0-07-735350-6 The guide provides solutions for odd-numbered problems. logical systems. EXIT COMPETENCIES: The student will demonstrate subjective and objective skills in differentiation. weekly ECRs and four exams. state models and abstract algebraic structure. computability theory. computability theory. The general theme is the application of mathematical structures and processes for the efficient computation by algorithmic methods in computer applications. lattices. COURSE OVERVIEW AND OBJECTIVES: The course is an introduction to the concepts and techniques of discrete mathematics structures used in the theory and application of Computer Science. The class consists of assigned readings and problems. matrices. production systems. The student is responsible for all scheduled readings. Boolean algebra problems. Topics include logic. algebraic structures. COURSE DESCRIPTION: Graph theory. The student must be familiar with both tools.Rosen. recurrence relations. recursive function theory. INSTRUCTIONAL METHODS: The class utilizes computer-based distance learning concepts and facilities. McGraw-Hill. assigned problems. All correspondence must be conducted via NSU's E-Mail facility. relations. binary and value matrices. Class Notes content as well as all content in ECR sessions and any formal Blackboard discussions. Student Solutions Guide for Discrete Mathematics and its Applications (7th Ed. Boolean algebra. logical systems.). Additional material and processes will be presented and discussed in an effort to add currency and relevance to the course or to augment the text. functions. Kenneth. (2011). and graph theory. and recursive functions. selection and calculating solutions to graph theory. set theory. production systems. .
Submitting Assignments: .
Assignments without a name will be processed last.Orientation presentations and tutorials.Examinations will be distributed and submitted via Blackboard. New student presentations may be found at: http://www.access to live and archived sessions. Blackboard will .Assignment Manager. View the “new student” presentations.the official guide to the class .a quick look at posted grades Questions on Blackboard operation and problems should be directed to Desk. The class’ Blackboard area is available before the first day of class to all students registered for this class. Blackboard provides: .edu/ NSU’s Blackboard is used as the primary on-line class delivery system. Note: A student may not do additional work or repeat an examination to raise a grade. After logging into the class' Blackboard area. Exceptions and extensions may occur due to service outages or other problems. exam info.nova. Assignment. Submit all examinations to Blackboard . Class.verification for appropriate browser and version.Blackboard (virtual) Electronic ClassRoom (ECR) Collaboration tool . the student will see individual links to: . grades and feedback Grade Center . LOGISTICS ISSUES: The student must be familiar with NSU and GSCIS policies. ECR Schedule. A late penalty will be assessed at-five points per day (maximum 2 days and 10 points).scis.. Java applets necessary for proper operation .Assignment Manager – assignments. exam critiques. Additionally.Announcements – instructor’s bulletin board. Students will be notified via EMail. Downloadable versions are available. etc . etc.Syllabus . all on-line submissions. tutorials. . Official submission date of “no name” assignments is determined by the date of the assignment’s identification. Examinations will not be accepted after the stated cutoff date. NSU’s Help - - This class will have traditional lecture-type classes delivered via Blackboard-Class Tools – Elluminate Live Electronic ClassRoom (ECR) sessions. Exam submissions must include the following information on the first page: Name.Assignment Manager. dates. Blackboard requires use of an up-to-date browser which is available via the Blackboard site. Date. The policies are available on the NSU and GSCIS web pages. Note that Blackboard will not add any identification to your submission.
7. 2. dates and content. Homework problems will not be submitted for grade. 1 (Problems in subchapters 1.is 70.Announcements identifying meeting time. all communications must use NSU email.6. For example. GRADE DISTRIBUTION: Grades will be based on four exams. 1.2 should be completed and ready for discussion by the start of the Week 2 session. Ch.000 to 72.) For example: C. In accordance with NSU’s “NSU email only” policy. ECR’s will not be held on “exam due” nights. ECR sessions falling on scheduled holidays will be recorded at another time – TBD. Grade Distribution: Test 1 Test 2 Test 3 Test 4 20% 25% 30% 25% Grade Scale: (all numbers inclusive.1 and 2. Blackboard email will not be used.9999 Grade Range F < 70 C70-72 C 73-76 C+ 77-79 B80-82 B 83-86 B+ 87-89 A90-92 A =>93 CLASS OUTLINE: NOTE: Students should complete their assignments/problems for the upcoming week. The ECR schedule is posted in Blackboard .be used as a dynamic bulletin board for Announcements. . Assignments and grade postings.
3. Matrices 3.6 Integers and Algorithms 3. 1) HOLIDAY 2. 2. 1 Foundations 1.1-3. 3 Algorithms. Additionally.3 Predicates and Quantifiers – Assn DUE Read Tutorials Ch 1. 1.1.1 Sets 2. Sequences.7 Read only 6 06/11 7 06/18 EXAM 2 DUE (Ch..2 Probability Theory 4. Logic 1.1 Algorithms 3. 1) EXAM 1 DUE (Ch. Functions.1-3 This class will have traditional lecture-type classes delivered via Blackboard-Class Tools – Elluminate Live Electronic ClassRoom (ECR) sessions.4 Ch 3.2 3 05/21 4 05/28 Exam 1 Due (Ch. 2 & 3) Ch 4 Number Theory and Cryptology 4.6 Intro to Proofs READ 1.2 Growth of Functions Ch.5. Blackboard will .6 .6 Ch 7. 2 and 3) Ch 2.1.1 .8 Matrices Exam 2 Due (Ch.2 Prop Equivalence 1.8 Ch.7 Prof Methods & Strategy – READ Ch. Week Class 1 05/07 Topic Introduction Orientation Ch.3.4 Sequences and Summations Ch.5 Applications of Congruence 4. Integers. 2 Sets.3 Functions 2.1 Divisibility and Modular Arithmatic 4.7 Applications of Number Theory 3.2 Integers and Division 4.1. 4.2 5 06/04 Ch 3.3.7 Ch. Sums 2. 3.3 2 05/14 1.6 Cryptology Ch 7 Discrete Probability 7.1 Introduction 7.3 Primes and GCD 4.1 Prop.6.2 Set operations – Ch.
5 Induction and Reasoning 5.4 Recursive Algorithms 5.9) Ch 10 Graphs 10.6 Application of Inclusion-Exclusion 10 07/09 Ch.2 Terminology 10.9 A/R Ch.3 Bayes’ Theorem 8 06/25 Ch.2 Solving Linear Relations 8.5 Euler & Hamilton Paths 10.5 Equivalence Relations Exam 3 Due (Ch.2 Pigeonhole Principle 6.3 Recursive Definitions 5.5 Program Correctness Ch.4 Connectivity 10.1 Relations and their Properties 9.1 Induction 5. 6 Counting 6. 8 Ch. 11 . 4 .3 Isomorphism 10.3 Representing Relations 9. 4 .5 Inclusion-Exclusion 8.1 Introduction Ch.9) Ch. Advanced Counting Techniques 8.2 n-ary relations 9.1 Recurrence Relations 8. 10 13 07/30 Ch.1 Basics of Counting 6.3 Permutations & Combinations 6.6 Generalized Perm & Comb 9 07/02 Ch 8.7.6 Shortest Path Problems Ch 11 Trees 11.4 Binomial Coefficients 6. 9 Relations 9. 5 11 07/16 12 07/23 EXAM 3 DUE (Ch.3 Divide-and-Conquer Algorithms 8.1 Graphs and Graph Matrices 10.
Blackboard will .184.108.40.206: 220.127.116.11.1: 1.15. CHAPTER 1 . Ch 2.33. Ch 18.104.22.168.22.214.171.124.31.19. Do not submit these problems.126.96.36.199. Ch 5. Ch 6.31. Validate several values Table 188.8.131.52.3: 1.9.5 Minimum Spanning Trees 14 08/06 08/20 08/27 Exam 4 .184.108.40.206.7(try).4: 45. Suppl: 220.127.116.11.3.3.55(try).35.41. Ch 2.DISCRETE PROBABILITY: Ch 7.FOUNDATIONS: Ch 18.104.22.168: 1. Ch. 6.3. Ch 4.25.3: 1.5: 1.17. Solutions to assigned even numbered questions will be provided.22.214.171.124.29.39.1: 1.3.FUNDAMENTALS: Ch 126.96.36.199.7.29. Ch 6.13. CHAPTER 4 .3.1: Ch 7.17.2: 1.NUMBER THEORY and CRYPTOLOGY: Ch 41:1. Ch 2.COUNTING: Ch 188.8.131.52(try).184.108.40.206.220.127.116.11.39.9.15. Suppl: 18.104.22.168.22.214.171.124.126.96.36.199ab.11.25. Suppl: 188.8.131.52.35.3.2: 1.19(try)27.2: 1.33.4:184.108.40.206: CHAPTER 6 .21.9. Ch 5.15.2: 1. CHAPTER 3 .3.1: 1.17.9220.127.116.11.11.29.1: 18.104.22.168.22.214.171.124.13.19. 1. Ch 3. Ch 126.96.36.199.31. Additionally. Ch 7.5.23(try).STRUCTURES: Ch 2. Ch.3.43.2: 1.4 Spanning Trees 11.15.41(try).188.8.131.52.184.108.40.206.33. 33. Ch 6.21. This class will have traditional lecture-type classes delivered via Blackboard-Class Tools – Elluminate Live Electronic ClassRoom (ECR) sessions.2 Applications 11.4: 1. 220.127.116.11. Ch 4.9.3: 18.104.22.168. 1. 22.214.171.124.3.5: 1.7: 126.96.36.199.188.8.131.52: 1. Ch 1. Suppl: 1.6: 1. 10 & 11 Exam 4 End of Term Grades Posted (latest) EXAM 4 DUE (Ch.15(try).6: 1.11. Suppl: 184.108.40.206. 1. Suppl: 5.41.3: CHAPTER 2 .10 & 11) EXAM 4 DUE END OF TERM GRADES POSTED MCIS 502 MATHEMATICS IN COMPUTING PROBLEM SETS These problems are assigned as learning and review exercises.220.127.116.11 Tree Traversal 18.104.22.168.22.214.171.124.126.96.36.199.19. CHAPTER 7 .Ch.49(try).5. Ch 188.8.131.52. CHAPTER 5 – INDUCTION and RECURSION: Ch 184.108.40.206.35.
3.3ab.3.9.5. . Ch 10.9(try). Ch 8.4: 220.127.116.11: 1-23 odd only.18.104.22.168.7.19.57a.5: 22.214.171.124. Suppl: 126.96.36.199: 1.15. Ch 10.3.31. CHAPTER 10 -GRAPHS: Ch 10.3.9.2: 1.37.13(try). Ch 10.17.21.5.188.8.131.52.3: 1.9. Ch 10.5.5.25.15.15. Ch 10. Suppl: 1.3.35.Ch 9.17.6: 184.108.40.206.3: 1. Ch 5.5. Ch 220.127.116.11.18.104.22.168.CHAPTER 8 .22.214.171.124(try).ADVANCED COUNTING: Ch 8. CHAPTER 9 .11. Suppl: 1.RELATIONS: Ch 126.96.36.199.188.8.131.52: 1.19.6: 184.108.40.206.7.5: 1.2: 1.3.25(try).220.127.116.11a. Ch 9.23.2: 1.3.1: 1.63. Ch 8.7.11.
29. Charkraborty.1: 1.13.7. ISBN 978-0-71-670000-5 Basic but good high-school level text. (7th ed. Short Course in Discrete Mathematics.9.7. Discrete Mathematics: an Introduction to Proofs and Combinatorics.23. (4th ed).13. (2012).17. K. (2011). ISBN 978-1-4496-0442-6 Focus is on mathematical thinking in computer science topics such as graph theory. (2008). problem/solutions and explanations.4: 1.TREES: Ch 11.35 on Fig3.28. Ch 11.7. Johnsonbaugh.3. Discrete Mathematics Demystified.19.24(try). R. D. Order is by published date. Crisler.3: 1.7. (2008). Blackboard will . Krantz.11. Lipschute. Helps readers understand and construct proofs.2: 1. (2005).5.7. S. Ch 11.9. Discrete Mathematics through Applications.23. (2008).CHAPTER 11 . Nice paperback edition. Bender. ISBN 978-0-49-539132-6 Good intro text forms nice foundation for CS students. S.3. Interesting but sophisticated text. recursion. and number theory.19. Discrete mathematics with Applications. The authors use many examples to demonstrate core principals. ISBN 978-0-61-841538-0 Contains a balance of theory and applications with mathematical rigor and good writing style. S.3. N. Hunter. ISBN 978-0-48-643946-4 This class will have traditional lecture-type classes delivered via Blackboard-Class Tools – Elluminate Live Electronic ClassRoom (ECR) sessions. (2005).29(try). 978-0-07-154978-6 Krantz is the author of several “demystified” math-based texts. Concentration is in computer-based practical applications.27(try).17. Discrete Mathematics.Ch 11. C. ISBN 978-0-07-161586-0 Typical helpful and complete Schaum’s text… very well done. (2010).5: 1.23.21. Ferland. BIBLIOGRAPHY These texts are presented as resources to the student to provide additional views and approaches.15.) ISBN 978-0-13-159318-3. S.19. Essentials of Discrete Mathematics.25. Nice linking of modern applications with discrete mathematics theory.25.5. Epp. E. Discrete Mathematics ISBN 978-0-19-806543-2 Advanced content nicely presented. (2009).3. Additionally. and Williamson. Schaum’s Outline of Discrete Mathematics. Ch 11.3.5.
and Dossy. (2005).A. and Use SCHOOL AND UNIVERSITY’S POLICY AND PROCEDURES Students must comply with the policies pulished in the school’s Graduate Catalog and the NSU Student Handbook. and using unauthorized materials. during an examination) 4.Not engage in cheating (e . combinatorics and number theory. Standards of Academic Integrity For the university-wide policy on academic standards. Strong emphasis is independent of any specific programming language. proper caution. Each student is responsible for maintaining academic integrity and intellectual honesty in his or her academic work. graph theory. (2ed ed).Undergraduate text computer science based discrete mathematics. ISBN 978-0-19-850717-8 Advanced text for the serious student. other. Dossy.pdf 1. such as notes. giving or receiving help during examinations.edu/NSS/pdf. (5th ed). see the section Code of Student Conduct and Academic Responsibility in the NSU Student Handbook . and textual definition and concepts. J. not that of another person 2. ISBN 978-0-47-147602-3 Interesting asides relating to game and puzzle influences on today’s involved mathematics applications. ISBN 978-0-13-065247-8 Handy tool for CS students that features utility grade computer discrete math tools. Reader should have a basic grasp of calculus. It is the policy of the school that each student must: 1. (2002)..A. Also see the section Student Misconduct in the GSCIS catalog. Emsley.g. Discrete Mathematics.Submit his or her own work. J.W.S.The catalog is at http://www. D. The text allows students to concentrate on fundamental problem solving. Be aware that some definitions from European.Not falsify data or records (including admission materials) 3. some of which are included or referenced below. Discrete Mathematics. Biggs. Ross.pdf The handbook is at http://www.scis. See also webopedia for specific topics. N. K.edu/cwis/studentaffairs/forms/ustudenthandbook. The text is the final source for any differences. (2001).nova.Not receive or give aid on assigned work that requires independent effort . (2002). J. sources may differ slightly from the U. Discrete Mathematics. Discrete Mathematics. and Crawley.nova.documents/Catalog. ISBN 978-0-32-107912-1.A. acquiring and/or transmitting test questions prior to an examination.
”) (see Crediting the Words or Ideas of Others below) ’ Crediting the Words or Ideas of Others When using the exact words of another. quotation marks must be used for short quotations (fewer than 40 words).Not use term paper writing services or consult such services for the purpose of obtaining assistance in the preparation of materials to be submitted in courses or for theses or dissertations 7.Properly credit the words or ideas of others according to accepted standards for professional publications (see Crediting the Words or Ideas of Others ) 6. Blackboard will . and block quotation style must be used for longer quotations. Additionally. Fifth Edition. pp. proper citation must also be provided. This class will have traditional lecture-type classes delivered via Blackboard-Class Tools – Elluminate Live Electronic ClassRoom (ECR) sessions. The Publication Manual of the American Psychological Association. (2001. 117 and 292) contains standards and examples on quotation methods. In either case.5.Not commit plagiarism ( Merriam-Webster s Collegiate Dictionary (1996) defines plagiarism as “stealing or passing off ideas or words of another as one’s own””and “the use of a created production without crediting the source.
Work that is not properly edited will be rejected.com for review. papers. Rather than make changes of this nature.The New Shorter Oxford English Dictionary (1993) defines paraphrase as “An expression in other words. Work is not original when it has been copied or partially copied from any other source. and writing that fails to express ideas clearly will affect their grades and the completion of the academic programs. or unless copying. or work) in other words. Original Work Assignments. including another student. in both form and content. Fifth Edition.. deleting words. should be letter-perfect. phrase.Writing Skills Students must demonstrate proficiency in the use of the English language. they should refrain from using outside editors that redo their work.. exams. usually fuller and clearer. reexamination.”. At all times. Exams and tests are original work when no unauthorized aid is given. Students requests for accommodation based on ADA will be considered on an individual basis.. not that of another person. sharing.. but such thoughts or words must be identified using quotation marks or indentation and must properly identify the source (see the previous section Crediting the Words or Ideas of Others). Consequently. of the sense of a written or spoken passage or text . must be the original work of the student. Grammatical errors. a proper citation must be provided. students are expected to comply with the school’s accepted citation practice and policy. usually with the object of clarification. passage.. unless such copying is acknowledged by the person submitting the work for the credit at the time the work is being submitted. Original work may include the thoughts and words of others. or substituting synonyms is not acceptable paraphrasing .When paraphrasing (summarizing or rewriting) the words or ideas of another. and/or remediation. The university’s detailed policy on disabilities is contained in the NSU Student Handbook. Student requests for accommodation based on ADA will be considered on an individual basis. 2. The school and its faculty are committed to maintaining high standards of academic integrity. dissertations. etc. The faculty will not provide remedial help concerning grammatical errors or other writing difficulties.it is plagiarism.. or joint authorship is an express part of the assignment. projects. (The Publication Manual of the American Psychological Association.Changing word order. spelling errors. . theses.Disabilities and ADA NSU complies with the American with Disabilities Act (ADA). It is the student’s responsibility to proofread and edit his or her work which. even when properly cited. (2001) contains standards and examples of citation methods (pp. 3. Student work will be routinely submitted to plagiarism detection tools (such as those at www. received.turnitin. Work is not original when it has been submitted previously by the author or by anyone else for academic credit. or used before or during the course of the examination. Express the meaning (of a word. It is university policy that students submit their own work. the source should be quoted as written. 207-214)..
the grade will be changed automatically from I to F. Withdrawals sent by email must be sent from the student’s assigned NSU email account. GSCIS uses various course management tools that use private internal email systems. the student may be This class will have traditional lecture-type classes delivered via Blackboard-Class Tools – Elluminate Live Electronic ClassRoom (ECR) sessions. In no case may the completion date extend beyond 30 days from the last day of the term for master’s courses or beyond 60 days from the last day of the term for doctoral courses. Students who forward their NSU-generated email to other email accounts do so at their own risk. faculty and staff members will send mail only to NSU email accounts using NSU-recognized usernames.scis.. The incomplete contract must contain a description of the work to be completed and a timetable.edu/NSS/pdf_documents/AcadCal. course or program. the student must: (1) provide a rationale. Students with four withdrawals will be dismissed from the program. No student may graduate with an I on his or her record. Depending on the date of withdrawal. The completion period should be the shortest possible. Blackboard will . 5. Failure to attend class or participate in course activities will not automatically drop or withdraw a student from the class or the university. When communicating with students via email.g. (2) demonstrate that he/she has been making a sincere effort to complete the assignments during the term.The Temporary Grade of Incomplete (I) The temporary grade of Incomplete (I) will be granted only in cases of extreme hardship. The incomplete contract will accompany the submission of the professor’s final grade roster to the program office.Grade Policy Regarding Withdrawals Course withdrawal requests must be submitted to the program office in writing by the student. If a change-of-grade form is not submitted by the scheduled completion date.Students with disabilities should discuss their needs with their academic advisors before the commencement of classes if possible. Requests for withdrawal must be received by the program office by the calendar midpoint of the course (see dates in the academic calendar in the catalog and program brochures or at: http://www.m. When a withdrawal request is approved.pdf) . Additionally. Requests for withdrawal received after 11:59 p.Communication by Email Students must use their NSU email accounts when sending email to faculty and staff and must clearly identify their names and other appropriate information. EST on the withdrawal deadline date will not be accepted. Should the course professor agree. and (3) explain how all the possibilities to complete the assignments on time have been exhausted. A student desiring an incomplete must submit a written appeal to the course professor at least two weeks prior to the end of the term. an incomplete contract will be prepared by the student and signed by both student and professor. The program office will monitor each incomplete contract . Students enrolled in courses using these tools should check both the private internal email system and NSU’s regular email system. which may be granted only when there is evidence of just cause. In the appeal. Students are encouraged to check their NSU email account daily. 4. 6. e. NSU offers students web-based email access. Students do not have a right to an incomplete. Students who have not withdrawn by the withdrawal deadline will receive letter grades that reflect their performance in the course.nova. the transcript will show a grade of W ( Withdrawn ) for the course.
Academic Progress. ’ Students must be familiar 10.eligible for a partial refund (see the appropriate catalog section Refund Policy Regarding Withdrawals).Acceptable Use of Computing Resources Students must comply with the university s Policy on Acceptable use of Computing Resources (see NSU Student Handbook ). Payment and refund policies are based on the view that a student registering for a class is reserving a place in that class and that tuition and fees cover the opportunity to secure that place in the class. Since no other person can purchase that place. employer or agency refusal to pay. Maintained by: W Hartman © Copyright 2012 All rights reserved. ’ 8. and/or referral to a collection agency. Simply not attending does not constitute a reason for non-payment. Grade Requirements and Academic Standing Students must be familiar with the school s policy which are contained in its catalog.Student Research Involving Human Subjects with the university s policy (See paragraph in catalog). ’ 9. 7. cancelled credit cards. ineligibility for financial aid. Returned checks.Responsibility for Payment of Tuition and Fees Once registered. students are personally responsible for the payment of their tuition and fees. and other reasons for non-payment may result in direct bill the student. Nova Southeastern University to . the student is responsible for the tuition and fees associated with it.
This action might not be possible to undo. Are you sure you want to continue?
We've moved you to where you read on your other device.
Get the full title to continue reading from where you left off, or restart the preview.