1. No category

Discrete Structures
CMSC 2123
Document:
Revised:
Course Title:
Course Number:
Section:
Instructor:
Office Hours:
Text:
References:
Prerequisites:
Course due dates:
Course Scoring:
Grading:
Notice:
CRN 21389
Course Administration
Spring 2015
Discrete Structures Course Administration
April 20, 2015
Discrete Structures
CMSC 2123
CRN 21389, 11:00 – 11:50 a.m. Monday, Wednesday, and Friday. MCS
113
Dr. Thomas R. Turner; Office: MCS 134; Work Phone: 974-5383, e-mail:
[email protected]
Time
Monday
Wednesday
Friday
9:00 – 9:50 a.m.
MCS 134
MCS 134
MCS 134
Time
Tuesday
Thursday
5:30 – 6:30 p.m.
MCS 134
MCS 134
Please make an appointment to visit me during my office hours.
1. Rosen, Discrete Mathematics and Its Applications 7th Ed. McGrawHill Higher Education 2007 ISBN 978-0-07-338309-5.
1. Malik and Sen, Discrete Mathematical Structures: Theory and
Applications, Thomson Course Technology, 2004, ISBN 0-61921558-5.
2. Horstmann and Budd Big C++ John Wiley & Sons, Inc. 2005 ISBN 0471-47063-5
3. Stroustrup, B. The C++ Programming Language 3rd Ed.; AddisonWesley 1997 ISBN 0-201-88954-4
4. Johnsonbaugh, Discrete Mathematics 4th Ed. Prentice Hall 1997 ISBN
0-13-518242-5
1. One year of High School Algebra II and Trigonometry OR
MATH 1513 College Algebra AND
MATH 1593 Plane Trigonometry OR
MATH 1555 College Algebra and Trigonometry
2. CMSC 1613, Programming I
All assignments, projects, reports and quizzes are due at the beginning
of class on the date given in this document unless otherwise specified.
Exams that are administered in class are due at the end of the class
period.
Task
Date
Value
Test 1
2-20
150
Test 2
4-8
150
Final Test
5-4
300
Projects
Table 2
150
Reports
Table 3
50
Assignments
Table 4
100
Total
900
A: 90% (810-900); B: 80-89% (720-809); C: 70-79% (630-719); D: 60-69%
(540-629); F: 59% (0-539) and below.
Beepers and cellular phones are prohibited in class.
1
Discrete Structures
CMSC 2123
CRN 21389
Caveat:
Course Administration
Spring 2015
This lecture schedule, projects, reports, quizzes, tests, and due dates are
all subject to change. Changes are presented in class You are
responsible for the material presented in class.
Class Web Page:
The course administration and assignments can be found on URL
http://www.comsc.uco.edu/~trt/cs2123.html
Course Directory
The course directory is on the department computer (cs.uco.edu). You
can find project test data files in the course directory. ~tt/cs2123/
Student Disabilities:
Students with disabilities who require accommodations may contact
Disability Support Services. http://bronze.uco.edu/disability_support/
Absences:
1. A 45-point bonus is awarded to any student having no recorded
absences. The attendance bonus will be denied to any student who
is absent for any reason. The attendance bonus will not be granted
to any student having an excused absence.
2. A student may be absent for up to three (3) classes without penalty:
these three classes are counted as excused absences. No
notification or documentation is required except when a test is
given.
3. Fifteen (15) points will be deducted from the student’s final score
for the fourth and every subsequent class for which the student is
recorded absent.
4. A student will receive a zero on an examination unless written
justification is presented to the instructor. Acceptable justification
includes university sanctioned travel, military obligation, serious
illness or injury, or death or serious illness in the immediate family.
Work-related conflicts are not acceptable excuses.
Academic
Honesty Students are encouraged to collaborate. However, each student must
and Collaboration:
make a unique contribution to any joint effort and that unique
contribution must be visible in the work submitted by the student.
Partially or completely copied assignments shall be considered a prima
facie case for academic dishonesty.
2
Discrete Structures
CMSC 2123
Class
1
Date
1-12
2
3
4
1-14
1-16
1-21
5
1-23
6
1-26
7
1-28
8
1-30
9
2-2
10
2-4
11
2-6
12
2-9
13
2-11
14
2-13
15
16
2-16
2-18
17
18
19
20
2-20
2-23
2-25
2-27
21
3-2
22
3-4
CRN 21389
Table 1. Lecture Schedule
Topic
Course administration
Administrative Overview
1.1 Propositional Logic
Submit Assignment a01
1.2 Applications of Propositional Logic
1.3 Propositional Equivalences
Submit Assignment a02
1.4 Predicates and Quantifiers
Submit Assignment a03
1.5 Nested Quantifiers
Submit Assignment a04
1.6 Rules of Inference
Submit Assignment a05
1.7 Introduction to Proofs
Submit Assignment a06
2.1 Sets
Submit Assignment a07
Project p01 overview
Submit Assignment a08
2.2 Set Operations
Submit Project p01, Tautology
Project p02 overview
Submit Assignment a09
Project p02 overview
Submit Report r01
2.3 Functions
Submit Project p02, Cartesian Product
Class cancelled - Weather
2.4 Sequences and Summations
Submit Assignment a10
Margin
Test 1
Test 1 reprise
Time Complexity: 𝑻𝑻(𝒏𝒏), Counting the Cost
Time Complexity: 𝑻𝑻(𝒏𝒏), Examples
Submit Assignment a11
Validating 𝑻𝑻(𝒏𝒏)
Submit Assignment a12.
Class cancelled - Weather
3
Course Administration
Spring 2015
Reference
Lecture Notes
Lecture 0. Lecture notes
Lecture 1. Ch. 1. p 1-16
Class presentation
Lecture 2. Ch. 1. p 16-25
Lecture 3. Ch. 1. p 25-36
Lecture 4. Ch. 1. p 36-57
Lecture 5. Ch. 1. p 57-69
Lecture 6. Ch. 1. p 69-80
Lecture 7. Ch. 1. p 80-92
Lecture 8. Ch. 2. p 115-127
Lecture 9. Lecture notes
Lecture 10. Ch. 2. p 127-138
Lecture 11. Lecture notes.
Lecture 11. Lecture notes.
Lecture 12. Ch. 2. p 138-156
Lecture 13. Ch. 2. p 156-170
Chapters 1-2
Lecture 14. Lecture notes.
Lecture 15. Lecture notes.
Lecture 16. Lecture notes
Discrete Structures
CMSC 2123
Class
23
24
Date
3-6
3-9
25
3-11
26
3-13
27
3-23
28
3-25
29
3-27
30
3-30
31
4-1
32
4-3
33
4-6
34
35
36
4-8
4-10
4-13
37
4-15
38
39
4-17
4-20
40
4-22
41
4-24
42
4-27
43
4-29
CRN 21389
Course Administration
Spring 2015
Table 1. Lecture Schedule (Continued)
Topic
Reference
Project p03 Overview
Lecture 17. Lecture notes
Lecture 18. Lecture notes
𝑶𝑶�𝒇𝒇(𝒏𝒏)�, 𝛀𝛀�𝒇𝒇(𝒏𝒏)�, 𝚯𝚯(𝒇𝒇(𝒏𝒏))
Submit project p03, Code fragment 1
Lecture 19. Lecture notes
𝑶𝑶�𝒇𝒇(𝒏𝒏)�, 𝛀𝛀�𝒇𝒇(𝒏𝒏)�, 𝚯𝚯(𝒇𝒇(𝒏𝒏)) Examples
Submit project p04 Code fragment 2
4.1 The Divisibility and Modular Arithmetic Lecture 20. Ch. 4. p 237-245
Submit project p05, Code fragment 3
4.2
Integer
Representations
and Lecture 21. Ch. 4. p 245-257
Algorithms
Submit Assignment a13
4.3 Primes and the Greatest Common Lecture 22. Ch. 4. p 257-274
Divisor
Submit Assignment a14
4.4 Solving Congruences
Lecture 23. Ch. 4. P 274-287
Submit Assignment a15
5.1 Mathematical Induction
Lecture 24. Ch. 5. p 311-333
Submit Assignment a16
5.2 Strong Induction and Well-Ordering
Lecture 25. Ch. 5. p 333-344
Submit Assignment a17
Distribute Summary Score Sheets
5.3 Recursive Definitions and Structural Lecture 26. Ch. 5. 344-360
Induction
Submit Assignment a18
5.4 Recursive Algorithms
Lecture 27. Ch. 5. 360-372
Submit Assignment a19
Test 2
Time Complexity, Ch. 4
Test 2 reprise
6.1 The Basics of Counting
Lecture 28. Ch. 6. p 385-399
Submit Assignment a20
6.2 The Pigeonhole Principle
Lecture 29. Ch. 6. p 399-407
Submit Assignment a21
No class
6.3 Permutations and Combinations
Lecture 30. Ch. 6. p 407-415
Submit Assignment a22
6.4 Binomial Coefficients and Identities
Lecture 31. Ch. 6. p 415-423
Submit Assignment a23
6.5 Generalized Permutations and Lecture 32. Ch. 6. p 423-434
Combinations
Submit Assignment a24
No Class
Lecture 33. Ch. 10. p 641 – 651
Submit Assignment a25
No Class
4
Discrete Structures
CMSC 2123
Class
44
Date
5-1
45
5-4
CRN 21389
Course Administration
Spring 2015
Table 1. Lecture Schedule (Continued)
Topic
Reference
Student Perception on Instructor
Effectiveness
(Teacher
Evaluations)
Summary Score Sheets.
Final Exam, 11:00 – 12:50 p.m., Monday, Comprehensive
May 4, 2015
Table 1. Lecture Schedule (Continued)
Project
p01
p02
p03
p04
p05
Total
Due
2-6
2-13
3-9
3-11
3-13
Value
30
30
30
30
30
150
Report
r01
Total
Due
2-11
Value
50
50
Assignment
a01
a02
a03
a04
a05
a06
a07
a08
a09
a10
a11
a12
a13
a14
a15
a16
a17
a18
a19
a20
Due
1-14
1-21
1-23
1-26
1-28
1-30
2-2
2-4
2-9
2-18
2-27
3-2
3-23
3-25
3-27
3-30
4-1
4-3
4-10
4-13
Table 2. Projects
Description
Tautologies
Cartesian Product
Code Fragment 1 Time Complexity
Code Fragment 2 Time Complexity
Code Fragment 3 Time Complexity
Table 3. Reports
Description
Library research report
Table 4. Assignments
Value Description
4
1.1 Propositional Logic
4
1.2 Applications of Propositional Logic
4
1.3 Propositional Equivalences
4
1.4 Predicates and Quantifiers
4
1.5 Nested Quantifiers
4
1.6 Rules of Inference
4
1.7 Introduction to Proofs
4
2.1 Sets
4
2.2 Set Operations
4
2.3 Functions
4
2.4 Sequences and Summations
4
Computing 𝑻𝑻(𝒏𝒏)
4
4.1 The Divisibility and Modular Arithmetic
4
4.2 Integer Representations and Algorithms
4
4.3 Primes and the Greatest Common Divisor
4
4.4 Solving Congruences
4
5.1 Mathematical Induction
4
5.2 Strong Induction and Well-Ordering
4
8.1 Applications of Recurrence Relations
4
8.2 Solving Linear Recurrence Relations
5
Discrete Structures
CMSC 2123
Assignment
a21
a22
a23
a24
a25
CRN 21389
Due
4-15
4-20
4-22
4-24
4-27
Course Administration
Spring 2015
Table 4. Assignments (continued)
Value Description
4
6.1 The Basics of Counting
4
6.2 The Pigeonhole Principle
4
6.3 Permutations and Combination
4
6.4 Binomial Coefficients
4
6.5 Generalized Permutations and Combinations
100
6