Dr. Glenn Wiggins
Purpose: The purpose of this course is to present the concepts of
discrete mathematical structures necessary to understand and appreciate the
more theoretical fundamental concepts in computer science. In particular, the
space-time continuum is divided into discrete, finite components, which become
the objects of discovery. The computer itself is a finite state machine and, as
such is directly incapable of representing the abstract concept of
infinity and continuity. The mathematics of the computer and its instructions
and the subsequent analysis of computer performance and computer program
performance require a discrete approach. If we are to push the frontiers in the
discipline beyond where we are we have to be able to extend the theoretical
foundations of the discipline, then discrete structures provides the
vehicle. Topics to be covered will include but not restricted to the following:
sets, relations, functions, permutations, combinatorics, graphs, trees,
Boolean algebra, recurrence relations, group theory, and finite-state automata.
Text: The text is mandatory. Discrete Mathematics , 6th ed. by Richard Johnsonbaugh, Prentice Hall
Attendance: Mandatory. Refer to Mississippi College Policies and Procedures for details. Since this is a MWF class, you may not miss more than 25%, 12 classes, without penality of an automatic grade of F. When a student must miss class for whatever reason, it is his/her responsibility to present a valid excuse to the instructor as soon as possible. All previously assigned work, exams, and quizzes are to be made up within one week. If missed assignments or exams or tests are not made up within the week, then the student will get a grade of 0 on the requirement. Should the student find it impossible to make up the requirements within one week upon returning to normal class attendance, then a mutual agreement with the instructor of the class must be obtained as soon as reasonable regarding times for completion of the delinquent course requirements. The last day to drop this course is Friday, March 24, 2006. Courtesy dictates that when a planned absence is known in advance, the instructor should be apprised as soon as possible and a mutual agreement on make-up work can be set. Failure to do so can result in a grade of 0 on missed work and exams.
Academic Honesty: While collaborative work outside class is beneficial, even encouraged, the student should be careful to note that using someone else's work is cheating. All problem sets/ programs submitted for grading must be your own intellectual property. Discussion of ideas, concepts, and understandings is acceptable. Working together directly or jointly to complete graded assignments, programs or problems, is the same a cheating on an in class exam.
Grading:
The following grading scale will be used: A- 90-100 %, B-80-89%, C-70-79%,
D-60-69%, F- 0-59%
Note: A necessary part of the requirements of this course is to check
you MCnet account and the MOODLE daily.
Failure to do so could cause you to miss important information or instructions
regarding the course and could
adversely affect your grade!
Assessment:
|
2 regularly scheduled exams |
2 x 20%=40% |
|
Weekly problem sets and programs -- Homework Problems 10% , Programs 6 @ 5% =30% |
10%+30%=40% |
|
Final exam |
1 x 20%=20% |
|
Total |
100% |
Schedule of topics:
|
Text: Discrete Mathematics |
Approximate time |
|
1.1-1.8 logic, proofs |
5 classes |
|
2.1-2.3 sequences, sets |
3 classes |
|
3.1-3.2, relations, functions |
2 classes |
|
Matrices (Appendix A) |
1 class |
|
TEST 1 |
|
|
4.1-3.4 Algorithms |
5 classes |
|
5.1-5.4, Representaionsof numbers, Eucledian Algorithm, RSA, Cryptosystem |
4 classes |
|
6.1-6.8 Counting Methods |
5 classes |
|
7.1-7.3, Recurrence Relations |
5 classes |
|
TEST 2 |
|
|
8.1-8.6, Graphs |
3 classes |
|
12.1-12.5 Automata, Grammars and Languages |
4 classes |
|
11.1-11.5 Boolean Algebra & Combinatorial Circuits |
4 classes |
|
13.1,13.3 Computational Geometry (Time permitting) |
1 classes |
|
FINAL EXAM |
|
Homework: Go to Homework page.