CS 381(CRN 10919) Introduction to Discrete Structures
Fall 2011
Instructor: D. Kaneko
Office: Dragas 1100B
Telephone: 683-3915
Office Hours: posted at http://www.cs.odu.edu/~dkaneko
E-mail : dkaneko@odu.edu
Class Schedule:
MW 4:20 – 5:35
Dragas 1117
Catalog Course Description: Lecture 3 hours; Recitation 1 hour; 3 credits.
Prerequisites: CS 150 and MATH 163
Topics include prepositional and predicate logic, rules of inference, methods of proof, set operations,
functions, complexity of algorithms, growth of functions, induction, counting, relations, equivalence
relations and graphs.
Course Objectives: This course will provide an introduction to discrete mathematics. At the
conclusion of this course the student should be able to:
Read and understand the notation used in computer science
Express ideas precisely, using formal computer science vocabulary and notation
Explain the terminology and perform operations with sets, functions, relations and graphs.
Formally prove the properties of discrete structures and algorithms
Analyze the performance of algorithms
Textbook: Required
Discrete Mathematics and Its Applications, 6th edition , Kenneth Rosen, McGraw Hill.
Student Solutions Manual
Assignments: Lecture quizzes, the midterm test, and the final exam will be closed book, closed
notes; calculators will not be permitted. Dates for lecture quizzes and the midterm test are included in the
Tentative Course Outline. The final exam will be given according to the registrar’s schedule. For the
midterm test, you will be given the entire class period. Quizzes will usually be about 20 minutes in
length; topics for quizzes will be announced in lecture prior to the quiz. Working exercises will help you
to understand the concepts we discuss in class. A list of exercises from the text is given on the last page of
this document. In addition, you can use the assessments at the text website to determine whether or not
you understand the concepts presented.
http://highered.mcgraw-hill.com/sites/0072880082/student_view0/index.html
Blackboard: You should check Blackboard for announcements concerning course assignments.
Grades from lecture quizzes and tests will be posted on blackboard. It is the student’s responsibility to inform
the instructor of misreported grades within one week after they are posted on blackboard.
Attendance/Classroom decorum: You should arrive on time; habitual tardiness is disruptive.
Eating and drinking is not permitted in class. It is the student’s responsibility to obtain the information that
was presented during a class that was missed. Cell phones and other electronic devices should be turned off
prior to the beginning of class. Attendance will be recorded.
MakeUp policy: You may not make up quizzes, the midterm test, or the final exam without prior
arrangements, a written medical excuse or a documented emergency.
1
Tentative Course Outline
Week /Date
Topics
Text sections
1 8/29
Propositional logic, propositional
equivalences
Predicates and quantifiers
1.1 and 1.2
2 9/5
no class Mon
3 9/12
Rules of inference; introduction to
proofs
4 9/19
Proofs; sets
5 9/26
Set operations; functions, sequences,
summations
6
10/3
Algorithms, growth of functions,
complexity of algorithms
7 10/10
Integers and division, primes, greatest
no class Mon common factors, matrices
8 10/17
Mathematical induction
Tests
/quizzes
1.3 and 1.4
1.5 and 1.6
Quiz 1 Mon
1.7 and 2.1
2.2, 2.3 and 2.4
Quiz 2 Mon
3.1, 3.2, and 3.3
3.4, 3.5, 3.8
4.1
Quiz 3 Mon
Recursive definitions, Recursive
algorithms
4.3,4.4
Midterm test
Monday 10/24
10 10/31
11 11/7
12 11/14
13 11/21
no class Wed
14 11/28
15 12/5
Counting basics, pigeonhole principle
Permutation, combinations, relations
Equivalence relations, graphs
graphs
5.1 and 5.2
5.3 and 8.1
8.3, 8.5 and 9.1
9.2, 9.3 and 9.4
Trees
Trees ;review for final
10.1 and 10.2
Mon 12/12
Final exam 3:45 – 6:45 in classroom
9
10/24
Sections 1.1 – 3.5
Quiz 4 Mon
Quiz 5 Wed
Final exam is
comprehensive
Grading Policy
Grades: Each of the following components will contribute the indicated percentage to your overall grade.
Attendance/class participation
5 quizzes
1 midterm test
final exam
10%
50%
20%
20%
100%
2
Grading Scale:
B+
C+
D+
F
87% - 89%
77% - 79%
67% - 69%
< 60%
A
B
C
D
93% - 100%
83% - 86%
73% - 76%
63% - 66%
ABCD-
90% - 92%
80% - 82%
70% - 72%
60% - 62%
Academic dishonesty: The Honor System at Old Dominion University is based upon the integrity of
each student. Any form of dishonesty or deception such as lying, cheating, and plagiarism constitutes a
violation of the Honor System. All material submitted for grading by a student during the course is to be
the student's own personal work. Any violations may be referred to the honor council for resolution.
Special needs: For students who need accommodations in this class, please contact me personally and
provide a letter from Disability Services to support your request. Please present a letter as soon as
possible; retroactive accommodations cannot be made.
Disclaimer: This syllabus is intended to give the student guidance in what may be covered during the
semester and will be followed as closely as possible. However, the professor reserves the right to modify,
supplement and make changes as course needs arise.
3
Text exercises (6th edition)
Section 1.1
1, 5, 9, 11, 13, 17, 19, 21, 23, 25, 27, 31, 33, 47, 48, 49, 50
Section 1.2
5, 7, 9, 15, 17, 19, 23, 29, 35, 46, 47, 48,49, 55
Section 1.3
1, 3, 5, 7, 9, 13, 17, 25, 33, 35
Section 1.4
1, 3, 7, 9, 13abcdegj, 25,27, 33
Section 1.5
3, 5, 7, 9 bcf, 13ac, 15, 17, 23
Section 1.6
1, 2, 3, 6, 15, 16, 17a, 18, 19, 26
Section 1.7
2, 3, 9, 37,38
Section 2.1
1, 4, 5, 6, 7, 9, 15, 16, 17, 19, 22, 23, 29, 33
Section 2.2
3, 4, 14,15,17, 25, 32, 48b, 50,51,52,56
Chapter 2 Supplementary
1,4, 11,13
Section 2.3
9, 10, 11,15, 19, 27, 32, 33, 49, 55, 56, 57,69
Section 2.4
3, 7, 9, 13, 15ab, 17b, 23, 27ab
Section 3.1
2, 4, 9, 11, 13, 14, 34, 35, 41, 42
Section 3.2
1abcd, 2abcd, 3, 9, 14,15, 19ab, 22abcd, 23abcd
Section 3.3
7,8,27
Section 3.4
2,3,4, 9, 17, 19, 26, 27, 28, 29, 31
Section 3.5
3,5,11, 21, 23, 24, 25
Section 3.8
2a, 3,5,10,18,29
Section 4.1
3, 4, 5, 6, 10, 16, 18, 21, 32, 52
Section 4.2
12
Section 4.3
1,2,5,6,7,9,10,12, 18,48,49,50
Section 4.4
7,8, 28
Section 5.1
1, 2, 3, 7, 8, 9 ,10, 11, 12, 15, 23, 27, 38, 39, 41, 43, 46, 52
Section 5.2
1, 2, 5, 9 ,17, 30, 40
Section 5.3
1, 2, 3, 4, 5, 6, 9, 11, 15, 20, 27,30,33
Section 8.1
1, 3, 4, 9, 10, 33, 39, 40, 41, 42
Section 8.3
3a,5,7,9,23,27
Section 8.5
1, 2, 21, 23, 26, 27, 41, 43, 47
Section 9.1
3 ,4, 5, 6, 7, 8, 9, 15,21
Section 9.2
4, 7, 9, 20acde, 21,22,23,24,25, 27, 29ad,30,35,49,54,55,56
Section 9.3
1, 3, 5, 7, 9abc,11, 12, 17, 21
Section 9.4
1,2,4,5,11, 24ab, 25ab, 29,31
Section 10.1
1, 2 7, 17, 18, 19, 20, 27, 28, 45
Section 10.2
19, 20, 21, 22, 23, 24
4