Section 001: TR 9
Instructor
Jack Tompkins
E-mail: tompkinsj@uncw.edu
Office hours
(CI 2034) TR 11:10-11:50 am
Graduate Teaching Assistants
Dave Macurak
E-mail: ddm4756
Office hours (CI 2035) Wednesdays 10 - 11:45 am
Supplemental Instruction (SI) Session (CI 1012) Mondays 11 - 11:45 am
starting January 28.
Jazmin Capezza
E-mail: jlc4691
Office hour (CI 2055) Tuesdays 8:30 - 9:30 am
Introduction:
Welcome
to CSC 133, a course in discrete structures
with an emphasis on applications to computer science. Prerequisite: MAT
111 or
MAT 115 or equivalent. A basic understanding of discrete mathematical
topics is
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 particularly useful in
UNCW
classes that have CSC 133 as a prerequisite.

Text:
Discrete Mathematics with
Applications, 4th Edition,
Susanna
S. Epp ISBN-10: 0495391328 ISBN-13:
9780495391326 , 984 Pages CB, ©2011.
Companion website.
Mathematical Conventions / Mathematical Induction Formats
Proof Tips / Find the Mistake / Find the Mistake solutions
Graded
Work: There
will be two tests each counting 15%. There will be quizzes
covering assigned homework and lecture material. Quiz grades will be
averaged with collected homework and count 40%.
Your lowest quiz grade is dropped. The final examination (a
comprehensive exam) counts 30%. The
final may also be used to replace your lowest test grade if the final
is higher than your lowest test grade.
Grading
Scale:
|
90-100 A |
|
80-89.5 B |
|
70-79.5 C |
|
60-69.5 D |
When the
distribution of course grades
suggests that a borderline grade might be raised to the next higher
level, we
consider such factors as attendance and improvement.
Students
with Disabilities: 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 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.
Study
Strategies: We
will be learning how to think about a problem and
how to apply new concepts. This process takes time and works best if
spaced out
over short periods. To afford yourself the best opportunity for this
process to
be successful you have to keep up on a daily basis. Cramming does not
work. We
are not merely memorizing facts that can be easily applied the next
morning
during an exam. Each concept must be handled in your mind, manipulated,
and
finally placed in proper context with the many other concepts. You will
discover that many of these concepts are in fact identical or nearly
so. Tools
we master for one application will serve us well in the next.
Course Student Learning Outcomes available here
Minimal Competancies available here