COURSE CREDIT: 3 hrs. credit PREREQUISITES: CSC 216 and MAT 122
OFFICE HOURS: Posted at http://www.mc.edu/~mwiggins.
TEXT: Discrete Mathematics and Its Applications, 4th Edition
Kenneth H. Rosen
DESCRIPTION: Concepts of algorithms, induction, recursion, proofs, topics from logic, set theory, combinatorics, graph theory, and automata theory fundamental to the study of computer science.
RATIONALE: This course is required of all CSC majors and is a prerequisite for graduate study in Computer Science.
LEARNING OBJECTIVES: Following successful completion the student will have the necessary knowledge of discrete structures to take courses requiring its content and will have the necessary knowledge of discrete structures for graduate study.
EVALUATION: (The Instructor reserves the right to make changes as necessary.)
Exams: There will be three examinations worth 150 points each.
Assignments: There will be weekly problem sets and programs worth a total of 400 points.
Final Exam: There will be a comprehensive final examination given at the time specified by the college. This examination will be worth 150 points. Monday, May 1, 2000, 8:00a.m. - 10:00p.m.
Grading Scale: 895 - 1000 points A 595 - 694 points D
795 - 894 points B 0 - 594 points F
695 - 794 points C
INCOMPLETE GRADES: An Incomplete may be given to a student who has been providentially hindered from completing work required in a course, provided that:
1. semester attendance requirements have been met;
2. most of the required work has been done;
3. the student is doing passing work; and
4. the student has made prior arrangements with the professor to complete the remaining work at a later date.
The grade of I must be removed promptly or it becomes an F; it cannot be removed by repeating the course. (See "Removal of Incomplete Grades," below.)
CLASS ATTENDANCE: The student is expected to attend classes. Regulations for class attendance are given in the Class Schedule. Remember that 12 absences results in an automatic F in the course. It is also important that you come to class on time. Remember that 3 tardies count as 1 absence. (See page 43 in the catalog).
MAKE-UP WORK & TESTS: Students are expected to take tests on the day they are assigned. However, it is the student's responsibility to contact the instructor in case of an emergency illness or death in the family. At that time the student and instructor will agree on a time for the make-up exam. Assignments are to be turned in on the day they are due!! All work is due at the beginning of the class period. Any work not turned in will lose 10% credit for each school day until the third day. The due date at the beginning of class is day 1. No work will be accepted after the third day. Under no circumstances will work be accepted after the assignment has been graded and handed back in class
CHEATING: Problem sets and programs are designed for individual work. Students may find that they need to discuss general ideas, but discussion of specifics and copying of assignments and making minor changes is considered cheating. All work should be done individually. Your instructor is there to help. Feel free to contact me in person, by phone, or e-mail. .(Tomahawk; Undergrad. Bulletin, pp. 46; http://www.mc.edu/publications/policies/219.html)
SPECIAL ACCOMMODATIONS: If you need special accommodations due to learning, physical, psychological, or other disabilities, please contact Dr. Buddy Wagner in the Counseling and Career Development Center. He may be reached by phone at (601)925-3354 or by mail at P.O. Box 4013, Clinton, MS 39058.
DROPPING A COURSE: LAST DROP DATE - March 24
Students cannot withdraw after this date with a W (passing) unless the three following criteria are met:
- Extenuating circumstances (clearly outside the student's control)
- Passing the course at the time of withdrawal
- Does not have excessive absences at the time of withdrawal
Date | Text | Description | Assigned Problems |
W 1/12 | §1.1 | Introduction to class
Logic |
6acdf, 8acef, 20, 22f, 24e, 30d |
F 1/14 | §1.2 | Propositional Equivalences LAST ADD | 8ad, 10, 18, 31, 33 |
M 1/17 | §1.3 | Predicates and Qualifiers | 2, 8ace, 10acd, 14bfjn, 24ac, 28 |
W 1/19 | §1.4 | Sets | 2, 5ace, 6, 12, 16ad, 22a |
F 1/21 | §1.5 | Set Operations | 4, 12ac, 24, 38 |
M 1/24 | §1.6 | Functions | 2, 6aceh, 8, 10, 22, 44, 46 |
W 1/26 | §1.7 | Sequences and Summations | 2, 4, 10ace, 14, 18, 24 |
F 1/28 | §1.8 | The Growth of Functions | 2, 8ac, 20a, 22ace |
M 1/31 | §2.1 | Algorithms | 2,4,8,12 |
W 2/2 | §2.2 | Complexity of Algorithms | 2,6,10 |
F 2/4 | NO CLASS | MS SCIENCE & MATH TOURNAMENT | |
M 2/7 | §2.3 | The Integers and Division | 8ace, 10abd, 16a, 32, 40, 46 |
W 2/9 | §2.4
§2.5 |
Integers and Algorithms
Applications of Number Theory |
2ace, 8ac, 12ac, 18ac, 24. 32ad
2ac, 6, 26ad, 36 |
F 2/11 | §2.6 | Matrices | 2a, 4a, 6, 10ace, 18, 28 |
M 2/14 | §3.1 | Methods of Proof | 2, 8ac, 10ac, 16 |
W 2/16 | §3.2 | Mathematical Induction | 6, 16, 48 |
F 2/18 | Exam 1 | Chapters 1-2 | |
M 2/21 | §3.3 | Recursive Definitions | 4, 6bc, 16, 26 |
W 2/23 | §3.4 | Recursive Algorithms | 4, 16, 18 |
F 2/25 | §3.5 | Program Correctness | 2, 6 |
M 2/28 | §4.1 | The Basics of Counting | 2, 8, 12, 24, 26, 28adh, 46, 48 |
W 3/1 | §4.2 | The Pigeonhole Principle | 4, 16, 28, 34 |
F 3/3 | §4.3 | Permutations and Combinations | 4, 10, 16, 22, 44 |
M3/6 - F3/10 | NO CLASS | SPRING RECESS | |
M 3/13 | §4.4 | Discrete Probability | 2, 6, 10, 16, 22, 34 |
W 3/15 | §4.7 | Generating Permutations and Combinations | 2, 4, 10 |
F 3/17 | §5.1 | Recurrence Relations | 4bf, 6, 12, 18 |
M 3/20 | §5.3 | Divide and Conquer Relations | 2, 6, 8bd, 14 |
W 3/22 | §5.5 | Inclusion - Exclusion | 4, 8, 10, 16, 20 |
F 3/24 | Exam 2 | Chapters 3-4 ** LAST DROP DATE | |
M 3/27 | §6.1 | Relations and Their Properties | 2, 4, 8, 10, 12, 14 |
W 3/29 | §6.2 | n-ary Relations and Their Applications | 2, 4, 6, 8, 10 |
F 3/31 | §6.3 | Representing Relations | 2, 4, 8, 10, 14 |
M 4/3 | §6.5 | Equivalence Relations | 2ace, 4, 12, 14, 22, 26 |
W 4/5 | §10.1 | Languages and Grammar | 2, 4ace, 8, 12, 20, 22a |
F 4/7 | §10.2 | Finite State Machines with Output | 2, 4, 6, 8 |
M 4/10 | §10.3 | Finite State Machines without Output | 2, 10, 12, 14, 18 |
W 4/12 | §10.4 | Language Recognition | 2, 6, 8c, 10 |
F 4/14 | Exam 3 | Chapters 5-6 | |
M 4/17 | §10.5 | Turing Machines | 2bd, 4, 8, 12 |
W 4/19 | §9.1
§9.2 |
Boolean Functions
Representing Boolean Functions |
|
F 4/21 | NO CLASS | EASTER HOLIDAY | |
M 4/24 | §9.3
§9.4 |
Logic Gates
Minimization of Circuits |
|
W 4/26 | Wrap-Up and Review | ||
M 5/1 | Final Exam | 8:00 - 10:00 |