CS317 Discrete Information Structures
Spring 2017, MW 1:00–1:50pm, PHY 135
http://www.cs.uwm.edu/classes/cs317
1
Prerequisite
Math Placement A; grade of C or better in CS 250.
2
Instructor Info
Instructor: Christine Cheng, EMS 1011, 229-5170, [email protected].
Office Hours: MW 11 AM to noon or by appointment.
3
Discussion Sections
You must be enrolled in one of these sections for this class:
DIS
DIS
DIS
DIS
4
601
602
603
604
2:00 PM-3:45 PM W PHY 142
12:00 PM-1:45 PM
R EMS E159
10:00 AM-11:45 AM F EMS E206
12:00 PM-1:45 PM
F EMS E206
TA: Ritankar Mandal
TA: John Ziman
TA: Ritankar Mandal
TA: Mary Ejiwale
Textbook
K. Rosen, Discrete Mathematics and its Applications, Seventh Edition, McGraw-Hill.
5
Objectives
CS 317 is one of the foundational classes in your CS curriculum. It is a direct or indirect prerequisite to courses in Algorithms, Theory of Computation/ Compilers, Artificial Intelligence, Data Security,
Computer Graphics, Operating Systems. The class has three major themes:
1. Mathematical Reasoning. You will learn logic and proof techniques so you can show that a mathematical statement is true.
2. Discrete Structures. You will learn important mathematical structures – used to represent objects
and their relationships – in Computer Science. These discrete structures include sets, functions and
relations, graphs, etc.
3. Counting and Probability. Yes, you will learn how to count! Once you know how, you will be able
to compute the probabilities of many events. Both skills are important for designing algorithms.
6
Grading
Grades will be posted on the D2L page of this class while homeworks will be posted on D2L and the class
website (see url above.)
1
The grade for the course will be computed as follows:
5% Quizzes
Short quizzes, sometimes unannounced, will be given in class or in section.
20% Homeworks
A homework consisting of about five problems will be assigned each week. It will be due the
following week in class. No late homeworks will be accepted. But the lowest two homework scores
will be dropped when the final homework average is computed.
It is best that you do the homeworks early (i.e., not just the night before or the morning of the
submission date) and on your own. If you’re stuck, email the instructor or your TA for clarification
or hints. Most of your learning occurs when you answer the problems on your own.
If you choose to collaborate with your peers, we will not stop you. If you choose to consult other
books, websites, etc., we will not stop you. However, you must (1) write up the solutions in your
own words and (2) cite your collaborators or the books and websites you consulted. In other words,
do not plagiarize by submitting other people’s work as your own. There will be a penalty if this
policy is violated.
50% Exams
Two in-class exams will be held during the semester, each worth 25% of the grade. The first one
covers the first third of the material, the second exam covers the second third of the material.
25% Final Exam
The final exam is on May 13, 2017 (Saturday) from 12:30 to 2:30 pm in the same room. The
coverage is cumulative.
Other than the quizzes, attendance is not checked. However, active participation in class will be taken
into account when the final score is in between two letter grades (e.g., between a B and a B-, etc.).
7
An Outline
• LOGIC
1.1 Propositional Logic, 1.2 Applications of Propositional Logic, 1.3 Propositional Equivalences, 1.4
Predicates and Quantifiers, 1.5 Nested Quantifiers.
• PROOFS
1.6 Rules of Inference, 1.7 Introduction to Proofs, 1.8 Proof Methods and Strategy.
• SETS, FUNCTIONS, and RELATIONS
2.1 Sets, 2.2 Set Operations, 2.3 Functions, 9.1 Relations and their properties, 9.5 Equivalence
Relations
• PROOFS CONTINUED
5.1 Mathematical Induction
• BASIC COUNTING
6.1 Basics of Counting, 6.3 Permutations and Combinations, 6.5 Generalized Permutations and
Combinations, 6.4 Binomial Coefficients
• DISCRETE PROBABILITY
7.1 An Introduction to Discrete Probability, 7.2 Probability Theory, 7.3 Bayes’ Theorem, 7.4 Expected Value and Variance
• GRAPHS
10.1 Graphs and Graph Models, 10.2 Graph Terminology and Special Types of Graphs, 10.3 Representing Graphs and Graph Isomorphism, 10.4 Connectivity, 10.5 Euler and Hamiltonian Paths,
10.8 Graph Coloring
8
Academic Misconduct
Students are responsible for the honest completion and representation of their work, for the appropriate
citation of sources and for respect of others’ academic endeavors. A more detailed description of Student
Academic Disciplinary Procedures may be found at
http://uwm.edu/academicaffairs/wp-content/uploads/sites/32/2015/02/uws14facdoc1686.pdf
9
Notes
In case of an emergency, contact the instructor at the earliest possible opportunity via e-mail or phone. No
arrangements will be made for missed exams unless these rules are followed, and an acceptable evidence
of legitimate emergency is submitted.
If you will be needing any accomodation in this course for any reason, please contact the instructor.
Please also be aware of the standard University policies at:
www4.uwm.edu/secu/news events/upload/Syllabus-Links.pdf.