CS:23022 Discrete Structures for CS Spring 2016
MW 9:15 - 10:30 am @ LCM 101
|Heather M. Michaud
||MW 11AM-12PM @ MSB 352, and by appointment
Discrete Structures for Computer Scientists with a focus on: mathematical reasoning, combinatorial analysis, discrete structures, algorithmic thinking, application and modeling. Specific topics include: logic, sets, functions, relations, algorithms, proof techniques, counting, graphs, trees, Boolean algebra, grammars and languages.
Students will learn (i) useful mathematics for CS majors, including logic, sets, functions, relations, Boolean algebra, probability; (ii) basics of mathematical reasoning and different proof techniques; (iii) combinatorial analysis and different counting techniques; (iv) discrete structures such as graphs, trees, grammars and languages; their modeling and applications, and develop algorithmic thinking.
Math 11010 and Math 11022 or else alternatives (See Catalog Listing)
Kenneth H. Rosen, Discrete Mathematics and Its Applications, McGraw-Hill, 2012. (Website)
Topics will include, in various depth:
- Logic, Sets, and Functions: Logic, Propositional Equivalences, Predicates and Quantifiers, Nested Quantifiers, Methods of proof, Sets, Set Operations, Functions.
- Mathematical Reasoning, Induction, and Recursion:
Art and Strategy of Proof, Sequences and Sums, Mathematical Induction, Recursive Definitions and Structural Definition, Program Correctness.
The Basics of Counting, The Pigeonhole Principle, Permutations and Combinations, Binomial Coefficients, Generalized Permutations and Combinations, Generating Permutations and Combinations.
- Discrete Probability:
An Introduction to Discrete Probability, Probability Theory, Expected Value and Variance
Relations and Their Properties, n-ary Relations and Their Applications, Representing Relations, Closures of Relations, Equivalence Relations, Partial Orderings.
Introduction to Graphs, Graph Terminology, Representing Graphs and Graph Isomorphism, Connectivity, Euler and Hamilton Paths, Shortest Path Problems, Planar Graphs, Graph Coloring.
Introduction to Trees, Applications of Trees, Tree Traversal, Spanning Trees, Minimum Spanning Trees.
- Boolean Algebra:
Boolean Functions, Representing Boolean Functions, Logic Gates, Minimization of Circuits.
- Modeling Computation:
Languages and Grammars, Finite-State Machines, Language Recognition, Turing Machines.
|Extra Credit Problems
|Final Exam (Wednesday May, 11th 10:15-12:30pm)
Homework is very important. It is expected that most of your learning will come from the process of solving the homework problems. Exams will in large part be based on the homework.
Milestones for successful completion of the course
- Attend the classes regularly
- Perform the homework thoroughly and independently
- Read the book carefully and several times
Make-up and Late policy
Attendance at times exams are given is a course requirement. Missed tests are only excused if absence was essential and can be fully documented. Homework must be turned in before class on due date (otherwise, there will be some penalty points). Unexcused late homework is normally not accepted after 11:59 pm of due date. Class extensions on homework will be announced in class. They may also be announced by email and at the course website.
Homework and Collaboration
You will need to devote a considerable amount of time to homework. You may discuss the homework with other students, but you must write your solutions independently. Study groups should limit their size to 2-3 so that each collaborator can participate in solution. If you obtain a solution to a homework problem through research (e.g., from books or journals), you are expected to acknowledge your sources in your writeup and also to write up your solution independently.
The official registration deadline for this course is Sunday, Jan. 24. University policy requires all students to be officially registered in each class they are attending. Students who are not officially registered for a course by published deadlines should not be attending classes and will not receive credit or a grade for the course. Each student must confirm enrollment by checking his/her class schedule (using Student Tools in FlashFast) prior to the deadline indicated. Registration errors must be corrected prior to the deadline. The last day to withdraw is Sunday, April 3.
Student Accessibility Policy
University Policy 3342-3-01.3 requires that students with disabilities be provided reasonable accommodations to ensure their equal access to course content. If you have a documented disability and require accommodations, please contact the instructor at the beginning of the semester to make arrangements for necessary classroom adjustments. Please note, you must first verify your eligibility for these through Student Accessibility Services (contact 330-672-3391 or visit www.kent.edu/sas for more information on registration procedures).
STUDENT CHEATING AND PLAGIARISM
This is a condensed version. For the complete policy and procedure, view the administrative policy.
Cheating and plagiarism constitute fraudulent misrepresentation for which no credit can be given and for which appropriate sanctions are warranted and will be applied. The university affirms that acts of cheating and plagiarism by students constitute a subversion of the goals of the institution, have no place in the university and are serious offenses to academic goals and objectives, as well as to the rights of fellow students.
"Cheat" means to intentionally misrepresent the source, nature, or other conditions of academic work so as to accrue undeserved credit, or to cooperate with someone else in such misrepresentation. Cheating includes, but is not limited to:
- Obtaining or retaining partial or whole copies of examinations, tests or quizzes before these are distributed for student use;
- Using notes, textbooks or other information in examinations, tests and quizzes, except as expressly permitted;
- Obtaining confidential information about examinations, tests or quizzes other than that released by the instructor;
- Securing, giving or exchanging information during examinations;
- Presenting data or other material gathered by another person or group as one's own;
- Falsifying experimental data or information;
- Having another person take one's place for any academic performance without the specific knowledge and permission of the instructor;
- Cooperating with another to do one or more of the above;
- Using a substantial portion of a piece of work previously submitted for another course or program to meet the requirements of the present course or program without notifying the instructor to whom the work is presented; and
- Presenting falsified information in order to postpone or avoid examinations, tests, quizzes, or other academic work.
`Plagiarize` means to take and present as one`s own a material portion of the ideas or words of another or to present as one`s own an idea or work derived from an existing source without full and proper credit to the source of the ideas, words, or works. As defined, plagiarize includes, but is not limited to:
- The copying of words, sentences and paragraphs directly from the work of another without proper credit;
- The copying of illustrations, figures, photographs, drawings, models, or other visual and nonverbal materials, including recordings of another without proper credit; and
- The presentation of work prepared by another in final or draft form as one's own without citing the source, such as the use of purchased research papers.
Academic Sanctions (from Section D). The following academic sanctions are provided by this rule for offenses of cheating or plagiarism. Kent campus instructors shall notify the department chairperson and the student conduct office each time a sanction is imposed. Regional campus instructors shall notify the regional campus dean and the student conduct officer each time a sanction is imposed. Regional campus student conduct officer shall notify the Kent student conduct office each time a sanction is imposed by a regional campus Instructor. The following academic sanctions are provided by this rule for offenses of cheating or plagiarism. In those cases the instructor may:
- Refuse to accept the work for credit; or
- Assign a grade of "F" or zero for the project, test, paper, examination or other work in which the cheating or plagiarism took place; or
- Assign a grade of "F" for the course in which the cheating or plagiarism took place; and/or;
- Recommend to the department chair or regional campus dean that further action specified in the rule be taken. The department chairperson or regional campus dean shall determine whether or not to forward to the academic dean or to the vice president for the extended university a recommendation for further sanction under this rule.
Procedures for invoking sanctions (from Section E).
Academic administrative procedures pertaining to paragraph (D)(1)(a) of this rule. In the event that an instructor determines that it is more probable than not that a student in a course or program under the instructor's supervision has presented work for university credit which involves an act of cheating, plagiarism or cooperation in either, then the instructor shall:
- Inform the student as soon as is practical, in person or by mail, of the belief that an act of cheating or plagiarism has occurred. If the student cannot be reached in a reasonable period of time, the instructor may proceed with sanctions, notifying the student in writing as promptly as possible of the belief and the procedural steps the instructor has taken.
- Provide the student an opportunity to explain orally, in writing, or both, why the student believes the evaluation of the facts is erroneous.
- If the explanation is deemed by the instructor to be inadequate or if no explanation is offered, the instructor may impose one of the academic sanctions listed in paragraph (D)(1)(a) of this rule. Where appropriate, the instructor may recommend the imposition of academic sanctions listed in paragraph (D)(1)(b) of this rule. In addition, the instructor may refer the matter to the dean of the college, campus, or school in which the student is enrolled for imposition of academic sanctions listed in paragraph (D)(1)(b) of this rule.
- The instructor shall notify the office of judicial affairs of the circumstances and action taken. Such notification will be used as background information in the event that formal conduct charges are initiated against the student.
- The instructor shall inform the student in writing of the right to appeal, and the procedure to follow.
- The instructor shall keep the evidence of cheating or plagiarism in a secure place and provide it upon request to any appeals officer or the conduct officer. The instructor shall provide copies on request to the student at the student's expense.
- The instructor shall cooperate with academic and student conduct personnel in any appeal of the decision, and/or in adjudication of any disciplinary proceedings.