General Information Cis375 Fall2015
General Information Cis375 Fall2015
Instructor Information
Prof. Kishan Mehrotra (mehrotra@syr.edu)
Office: CST 4-177, x2811
Office hours: Mondays (2-4 PM) or by appointment
TA Information
TA Zhiruo Zhao (More information later)
Recitation sections for lecture section M007:
Wed
Wed
Library.
Course Objectives
There are two primary goals of this course. The first goal is to introduce you to the fundamental
mathematical structures used throughout computer science and computer engineering, such as sets,
functions, relations, and graphs. These structures arise again and again in different settings, including
algorithms, artificial intelligence, databases, digital design, operating systems, security, and software
and hardware verification. The second goal is to help you develop the reasoning skills necessary for
learning-and evaluating claims about-new computing concepts. Given the dynamic nature of the
computing field, such skills are essential for success.
Prerequisites
In the pre-requisite course PHI 251 (Logic), you worked with both propositional and predicate logic,
studying notions of validity, logical consequence, and formal proof. This course builds on those
foundations to provide precise definitions of discrete structures used in computing and to support rigorous
(but not always formal) proof and analysis of the structures' properties.
Course Outcomes
After successfully completing this course, you should be able to do the following:
Translate between predicate (or propositional) logic and informal (but precise) English.
Be able to specify and manipulate basic mathematical objects, including sets, functions, and
relations.
Be able to construct and verify mathematical proofs.
When given a property about sets, functions, or relations, determine its validity and p r o v i d e
either a rigorous proof or a counter-example.
Use induction to prove simple mathematical properties of a variety of discrete structures.
When given a set, determine whether it is countable and provide convincing support for that
answer.
Outcome Measurement
Your final grade will be based on a variety of activities:
Homework assignments (25% of final grade)
Homeworks are intended to give you practice with course material, as well as feedback on your
efforts: be sure to pick up and look at your graded assignments. There will be a homework
assignment approximately every week: all homeworks are equally weighted, and I will drop the
lowest homework grade at the end of the semester. Occasionally, students may be asked to
explain their homework to me or to the TA: in such cases, the homework grade will be based on
the results of this explanation.
Homeworks assignments should be turned in the class, in the beginning. Assignments are due by
the date and time specified on them: Late assignment will NOT be accepted.
Pop Quizzes and Participation (10% of final grade)
On occasion I may give an unannounced, brief quiz. These quizzes will be graded on the following
scale:
Points Meaning
3
Substantially correct
Partially correct
Course Topics
Propositional logic, truth tables, and derivations. Predicate logic and the use of quantifiers. Basic proof
strategies. Elementary set theory: set operations, subsets, power sets. Functions and relations,
including equivalence relations and partial orders. Cardinality and notions of infinity. Recursive
definitions. Mathematical induction. Graphs (time permitting).
Other Information
Academic Integrity
Accommodations
Our community values diversity and seeks to promote meaningful access to educational
opportunities for all students. Syracuse University and I are committed to your success and to
supporting Section 504 of the Rehabilitation Act of 1973 as amended and the Americans with
Disabilities Act (1990). This means that in general no individual who is otherwise qualified shall
be excluded from participation in, be denied benefits of, or be subjected to discrimination under
any program or activity, solely by reason of having a disability.
If you believe that you need accommodations for a disability, please contact the Office of
Honor Policy
As stated in the course syllabus, every student is expected to behave with academic integrity: do
not cheat, plagiarize, or commit fraud.
Fraud includes altering previously graded work; plagiarism includes using someone else's work
without proper credit. The following guidelines further detail these definitions:
If you happen to find a solution to a problem in a written source (e.g., in a textbook or on
the web) and use that solution, you should state the original source.
If you get help from someone (either a classmate or someone else) on a problem, you
should state that (and give their name).
In this course, it is legitimate to discuss problems with each other at a conceptual level: for
example, it's okay to figure out how to break a problem up into smaller, easier-to-solve pieces,
or to discuss general approaches to solving a problem.
However, the final solution must be your own: it is not legitimate to share code or other
written solutions with anyone else. All participants in improper sharing are culpable: if
person A sends/gives work to person B, both parties are in violation of the academic
integrity policy.
If you are unsure whether a certain action constitutes an academic-integrity violation, assume
that it does and then ask us for clarification.
Honor Pledge
I have read and understood the course Honor Policy, and I hereby promise to abide by
it. I realize that the penalty for breaking this policy is a failing grade (XF) for the course.
Printed Name:
--------------------------Signature: _
Date:
Email Address :
Fall 2015