This instructor is available by email at firstname.lastname@example.org, by telephone (962-4261), and during office hours (CI 2042). Office hours are posted on the instructor’s home page and located on the door to his office. In addition, students can arrange to meet with the professor outside of normal office hours by contacting him via email or phone or schedule using Outlook.
You are expected to take an active role
in your learning in this course. This includes mandatory attendance, in class participation and discourse, reading the textbook, and completing all course
requirements. You are encouraged to study with your classmates outside of
class, make use of the TA (Paul Martin CIS 2055), and seek help from the instructor outside of class.
Prerequisites: MAT 111 or 115, or equivalent.
Corequisite: CSC 121.
Textbook: Discrete Mathematics with Applications, 3rd Edition, Susanna S. Epp. ISBN: 0534359450.
Course Description: Introduction to discrete mathematics applicable to computer science. Propositional and predicate logic, basic proof techniques, set algebra and Boolean algebra, recursion and induction, trees and graphs, and introductory combinatorics. Four lecture hours each week.
CSC 133 provides a basic understanding of discrete mathematical topics that are fundamental for academic work in computer science. Many students of this course will find they have familiarity with some of the topics: for instance, truth tables, logical propositions, elements of set theory, as well as basic notions of functions and mathematical induction. Prior work in these areas is not assumed. In this course we will discover that logical propositions are the underlying model of discrete systems. From this modest beginning we develop algorithms and prove their efficacy. Topics include propositional and predicate logic, basic proof techniques, set algebra and Boolean algebra, recursion and induction, trees and graphs, introductory combinatorics, and matrix algebra. The knowledge gained will be extremely useful in upper-level UNCW computer science classes. Students should expect to spend 5 to 8 hours per week on the course outside of class time.
Exit Goals: This course has a set of minimal competencies that every student will have a level of mastery of if he/she expects to pass the course. The level of mastery is indicated by the final grade recieved by the student. See minimal competency.
Participation: Regular class attendance is required. Student will not be allowed to makeup quizzes or exams. The lowest two quiz grades will be dropped. The final exam can replace a missed exam or the lowest exam grade. The final is comprehensive.
The following algorithm can be used to compute your final grade based on your before final average:
if (finalExam < lowestTest) grade = (finalExam + 5 * beforeFinal) / 6;
else grade = (5 * beforeFinal - lowestTest + 2 * finalExam) / 6;
Numeric Score Letter Grade Quality Points
90.0 - 100 A 4.00
80.0 - 89.5 B 3.00
70.0 - 79.5 C 2.00
60.0 - 69.5 D 1.00
00.0 - 59.5 F 0.00
If you have a disability and need reasonable accommodation in this course, you should inform the instructor of this fact in writing within the first week of class or as soon as possible. If you have not already done so, you must register with the Office of Disability Services in Westside Hall (extension 3746) and obtain a copy of your Accommodation Letter. You should then meet with your instructor to make mutually agreeable arrangements based on the recommendations of the Accommodation Letter.
Students are responsible for submitting their own work. Students who cooperate on oral or written examinations or work without authorization share the responsibility for violation of academic principles, and the students are subject to disciplinary action even when one of the students is not enrolled in the course where the violation occurred.