Discrete Mathematics
[Daily
schedule][Homework][Homepage]
Instructor:
Cary Lee, Ph.D.
Office:
70-211 (inside Tech mall)
Telephone: 644 -7894
Office Hours: Mon 12:30 -
1:30pm, Wed 3:00 - 4:00pm, T,Th 10:30am -
11:30am and 3:30 -4:30pm
e-mail:
cary.lee@gcccd.edu
website:
http://www.grossmont.edu/carylee
Discrete The first part of this word comes from the Latin
prefix dis-, which means "apart" or "away". The second half
comes from Latin cretus, the past participle of cernere, which means to
distinguish.
In nonmathematical English, discrete mathematics is the study of
numbers, objects, or processes that are distinct, apart or distinguishable. In
mathematical terms, it is the study of structures that are countable (i.e. can be put into
a one-to-one correspondence with the set of natural numbers) or even finite. One example
is the set of graphs with finite number of vertices. Two graphs are either isomorphic or
non-isomorphic and there is nothing in between such as almost isomorphic. Calculus on the
contrary is an example of continuous mathematics in which we can find two numbers on the
number line as close to each other as we want, or we can approximate a given
differentiable function over a compact interval by a polynomial to any degree of accuracy.
Many topics in discrete mathematics have been studied for a long period
of time but they are not prominent until high speed computers become more available in the
recent decades. This is due to the fact that most problems in discrete mathematics require
a large amount of computation that cannot be done by hand in a practical amount of time.
Some typical examples are coding, decoding and cryptography.
Discrete mathematics is a broad subject
and it is impossible to cover even just the introduction of every topic in this field in a
16 week semester. We can only expect to briefly touch on the following basic, typical, and
important topics in this interesting field.
Propositional Calculus
Predicate Calculus
Elementary Number Theory and Methods of Proofs
Sequences and Mathematical Induction
Elementary Set Theory
Relations
Functions
Recursion
Counting Techniques
Graphs and Trees.
Textbook:
Discrete Mathematics
with Applications
Forth edition
Susanna S. Epp
ISBN 0-534-35945-0 |
![Discrete Mathematics with Applications [Book] Discrete Mathematics with Applications [Book]](//books.google.com/books?id=PPc_2qUhXrAC&printsec=frontcover&img=1&zoom=1&l=220) |
References:
Instructor's Manual
Discrete Mathematics with
Applications
Susanna S. Epp
ISBN: 0-534-94449-3 |
|
Discrete Mathematics Numbers
and beyond
Stephen Barnett
Addison - Wesley
ISBN 0-201-34292-8 |
 |
Discrete Mathematics and its
Applications
fourth edition
Kenneth H. Rosen
WCB/McGraw-Hill
ISBN 0-07-289905-0 |
 |
Introduction to
Discrete Mathematics
Wayne M. Dymacek & Henry Sharp, Jr.
WCB/McGraw-Hill
ISBN 0-07-018566-2 |
 |
The first three of the above texts are
available in the Limited Loan section of our library, you are strongly encouraged to check
them at least once in the semester and read the examples in the relevant sections.
Course Prerequisite: The
basic requirement is a grade C or better in Math 280, but the concurrent enrollment of
Math 284 will be recommended.
Grades: This course is
offered for a grade of A, B, C, D, or F. The grade distribution is as follows:
| A |
......... |
85 - 100% |
| B |
......... |
75 - 84% |
| C |
......... |
65 - 74% |
| D |
......... |
55 - 64% |
| F |
......... |
00 - 54% |
Grades are
assigned on an absolute scale, and your work will not be graded on a curve.
You get what you earn,
and other people's performances have no affect on your grade. No
extra credit.
Assignments:
|
Homework |
100 |
|
5 short quizzes @25 pts |
125 |
|
2 one-hour exams @100 pts |
200 |
|
Final Exam
|
150 |
|
__________________________________ |
|
Total |
575 |
Homework will be assigned at the end of
each class meeting, and if you are eager to do the exercises in advance, you can get the
assignment from the next webpage (see top of page).
Late Homework will receive 2 point penalty per class day.
Expectation of Students:
- Attend all classes and take notes.
- Read the text book before and after each lecture. There is
so much material to be covered in this course that it is impossible for the lecturer to
include all the details in class.
- Work out the details and fill in the steps at home for the
examples discussed in class. You cannot expect to understand everything instantly during
lecture hours because the lectures will be conducted in a pace much faster than you have
ever encountered. You can only expect to grasp the main ideas first, and then slowly
digest the material through reading, thinking, and practicing later at home.
- Form study groups with fellow students, work together in
the library or outside school. This is the best way to learn and check your understanding.
- Do all assigned homework problems on a daily basis. Work
out the details and aim for perfection.
Supervised Tutoring Referral
-
Students requiring additional help or
resources to achieve the stated learning objectives of the courses
taken in a Mathematics course are referred to enroll in Math 198,
Supervised Tutoring. The department will provide Add Codes.
-
Students are referred to enroll in the
following supervised tutoring courses if the service indicated will
assist them in achieving or reinforcing the learning objectives of
this course:
·
IDS 198,
Supervised Tutoring to receive tutoring in general computer applications
in the Tech Mall;
·
English 198W,
Supervised Tutoring for assistance in the English Writing Center
(70-119); and/or
·
IDS 198T,
Supervised Tutoring to receive one-on-one tutoring in academic subjects
in the Tutoring Center (70-229).
To add any of these
courses, students may obtain Add Codes at the Information/Registration
Desk in the Tech Mall.
-
All Supervised Tutoring courses are
non-credit/non-fee. However, when a student registers for a
supervised tutoring course, and has no other classes, the student
will be charged the usual health fee.
Academic Integrity:
Any student who cheats on any of the tests, or disrupts
the class or hinders the progress of any other student will be dropped from the class.