UNCW Home UNCW HomeBreaking News! Click here for details.
 CSC 133 - Discrete Mathematical Structures - Fall 2009  
 
Schedule and Assignments
133-001 TR 08:00am - 09:40am CI 1012  

Instructors:
Curry Guinn Office: CI 2045  Phone: 962-7937
Office Hours: MWF 12:00pm-1:00pm, TR 10:00am-11:00am
  and by appointment.
Email:  guinnc@uncw.edu

UNCW CATALOGUE DESCRIPTION

CSC 133. Discrete Mathematical Structures (4) Prerequisite: MAT 111 or 115, or equivalent. Corequisite: CSC 121. 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.

GENERAL COURSE INFORMATION

This (along with CSC 100 and CSC 121) is the among the first required courses for Computer Science majors. Students may declare a major in Computer Science after completion of CSC 100, 121, 133, and 221 with a grade point average of at least 2.5 on these 4 courses.

Students intending to major in Computer Science are encouraged to take CSC 100 (Orientation to Computer Science) and CSC 121 (Discrete Structures) during the same semester as CSC 133. CSC 100 is a required course for majors and minors starting in Fall 2007. 

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.  

CSC 133 is not an easy course, but students find it rewarding and well worth the effort. Students should expect to spend 5 to 8 hours per week on the course outside of class time.

REQUIRED TEXTBOOK AND CHAPTERS COVERED

Discrete Mathematics with Applications, 3rd Edition,  Susanna S. Epp. ISBN: 0534359450. 

     Publisher Website

     Author Website (with lots of helpful links)

 

 

STUDENT RESOURCES 

COURSE REQUIREMENTS AND GRADING CRITERIA