Background
Research
Teaching
CISC 3310
CISC 2210

CISC 2210 - Introduction to Discrete Structures
Time:    M,W  12:50-2:05 P.M
Room:   238 NE
Term:    Spring 2016

INSTRUCTOR AND COMMUNICATION INFORMATION

Office: 541 NE
Office Hours: TBD
E-mail related to this course should be sent only to:
E-mail sent to any other address will be lost and you will

NOTEWORTHY DATES:
Midterm Exam - March 21, 2016: 12:50 P.M., Room 238NE

Final Exam -  May 23, 2016: 1:00-3:00 P.M., Room 238NE

COURSE DESCRIPTION

This course will introduce students to elementary set theory, functions, relations, propositional logic and proofs, Boolean algebras, proofs by induction and its relationship to loop invariants. The course will also include combinatorial computing, counting arguments, Big O and Big theta analysis, the pigeon-hole principle and the application to elementary probability theory. Topics in graph theory and matrices and their application to relations will also be covered.  Finally, special topics in the applications of discrete mathematics  and related algorithms will be introduced.

REQUIRED TEXTBOOK

Discrete Mathematics, 5th Edition

Kenneth Ross, Charles R.B. Wright
ISBN: 0-13-065247-4

There will be a Midterm and Final.
They will be weighted as 60% and 40%, whichever is in the students favor.
Homework problems will be reviewed at the beginning of each class before lecture.
Students are required to do Homework problems for each class
Midterm and Final will be based primarily on homework problems

SYLLABUS

Week                Book Sections                             Topic

1:                             1.3-1.4                   Sets, Set Operations, Algebra of Sets

2:      Rev HW         1.5-1.7                  Functions, Properties of Functions

3:      Rev HW         2.1-2.3                 Elementary Logic, Logic Circuits
4:      Rev HW         2.4-2.6
Methods of Proof

5:      Rev HW         3.1-3.3                Relations, Digraphs, Matrices

6:      Rev HW and for Midterm
7.
Midterm (Will cover everything from Chapter 1- Chapter 2)

8:      Rev HW         3.4-3.5                 Equivalence Relations, Mod p Arithmetic

9:      Rev HW         11.1                       Partially ordered Sets; Hasse Diagrams
10:     Rev HW         4.1-4.3                   Loop Invariants, Induction
11:     Rev HW         4.4-4.6

Big-Oh and Recursion, More Induction

12:     Rev HW         5.1, 5.3                Basic Counting Techniques, Inclusion-Exclusion

13:     Rev HW         5.2,                 Elementary probability, Binomial methods,
14:     Rev HW         5.5                                     Pigeon-Hole Principle

Final

Homework:

Chapter 1:

Exercises 1.3: 1-13, Optional-14,15.

Exercises 1.4: 1-6, 10, 11,12.

Exercises 1.5: 1, 2, 3, 7,  Read the book on floor and ceiling functions (1.1 pg 3)
and do problems 11, 12

Exercises 1.7:1, 2, 3, 6, 8, 9.

Chapter 2:
Exercises 2.1: 1,2,3,4,6,7,10,11,12,13
Exercises 2.2: 1, 2,3,8,9,10,11,13,14
Exercises 2.3: 1,2,5,6,7,9,10,11
Exercises 2.4: 1,3,5,6
Exercises 2.5: 1,2,3,4,5,6 (try)
Exercises 2.6: 1, 5, 6, 8, 13
Exercises 11.1: 1, 3, 8

Chapter 3 and 11:
Exercises 3.1: 1, 2, 3, 8(try), 11,
Exercises 3.2: 1, 2, 6
Exercises 3.3: 1, 2, 3, 4, 7, 15, 16

Exercises 11.3: 1, 3, 5, 6
Exercises 3.4: 1, 3,
Exercises 3.5: 1, 2, 5, 9

Chapter 4:
Exercises 4.1: 1, 3, 4, 9, 10, 12
Exercises 4.2: 5, 6
Exercises 4.3: 1, 3, 5, 8, 23
Exercises 4.4: 1, 3, 6

Chapter 5:

Exercises 5.1: 1, 3, 4, 5, 6, 14
Exercises 5.2: 1, 3
Exercises 5.3: 1, 3, 7, 15, 18
Exercises 5.5: 1, 2

COURSE POLICIES Student Conduct

Any acts of disruption that go beyond the normal rights of students to question and discuss with instructors the educational process relative to subject content will not be tolerated, in accordance with the Academic Code of Conduct described in the Student Handbook

Electronic Devices in Class Policy

Cellular telephones, pagers, CD players, radios, and similar devices are prohibited in the classroom. Calculators and computers are prohibited during examinations, unless specified.

Examination Policy

A midterm and final examination will be given in class. Please schedule your other activities in advance. No make-up exams will be allowed without prior arrangements being made.

To prepare for examinations, read the chapters, go over the notes you take in class, and do the assignments. 100 % of the questions are taken directly from the reading material and what is covered in class.

Incomplete Policy

Students will not be given an incomplete grade in the course without sound reason and documented evidence. In any case, for a student to receive an incomplete, he or she must be passing and must have completed a significant portion of the course.

Students are expected to uphold the school’s standard of conduct relating to academic honesty. Students assume full responsibility for the content and integrity of the academic work they submit. The guiding principle of academic integrity shall be that a student's submitted work, examinations, reports, and projects must be that of the student's own work. Students shall be guilty of violating the college’s policy if they:

• Represent the work of others as their own.
• Use or obtain unauthorized assistance in any academic work.
• Give unauthorized assistance to other students.
• Modify, without instructor approval, an examination, paper, record, or report for the purpose of obtaining additional credit.
• Misrepresent the content of submitted work.

Any student violating the colleges academic integrity policy is subject to receive a failing grade for the course and will be reported to the Office of Student Affairs. If a student is unclear about whether a particular situation may constitute violation, the student should meet with the instructor to discuss the situation.

For this class, it is permissible to assist classmates in general discussions of computing techniques. General advice and interaction are encouraged. Each person, however, must develop his or her own solutions to the assigned projects, assignments, and tasks. In other words, students may not "work together" on graded assignments. Such collaboration constitutes cheating. A student may not use or copy (by any means) another's work (or portions of it) and represent it as his/her own. If you need help on an assignment, contact your instructor, not other classmates

Disabilities Policy

In compliance with the Americans with Disabilities Act (ADA), all qualified students enrolled in this course are entitled to “reasonable accommodations.” Please notify the instructor during the first week of class of any accommodations needed for the course

1. COME TO CLASS
2. Take good notes.