Math/CS 228 – Discrete Mathematics II
Fall 2005
Professor: Dr. Elizabeth Adams 213 ISAT/CS
Phone: 540-568-1667 adamses@jmu.edu
Office Hours:
Monday : by appointment or when my door is open
Tuesday
:
Wednesday:
Thursday:
Friday: by appointment or when my door is open
Webpage: https://users.cs.jmu.edu/adamses/web
Prerequisite: Math/CS 227
Class Meeting Times: Monday
and Wednesday 5:
Required Text: Discrete
Mathematics and Its Applications, fifth edition, McGraw-Hill, 2003
Catalogue Description: CS/MATH 227-228
An introduction to discrete mathematical structures including functions, relations, sets, logic, matrices, elementary number theory, proof techniques, basics of counting, graphic theory, discrete probability, digital logic, finite state machines, integer and floating point representation
Important Information
about deadlines
The deadlines for adding fall semester classes on e-campus
are as follows:
Semester Class –
First eight-week class –
Second eight-week class –
The deadlines for adding classes with instructor and
academic unit head signatures are as follows:
Semester class –
First eight-week class –
Second eight-week class –
Please be aware that giving a student an override into a full class does
not automatically enroll the student in class. The
student must register on e-campus or, if the add is made between September
5th and September 15th, at the Registration Services
counter in Warren Hall.
The last day to drop a fall semester or first eight-week
class without a “W” grade is
Student Evaluation:
As I have to assign grades, you have to be
evaluated. This is a sad, but necessary part of
college life. Please remember that you are here to LEARN!!!! Keep
this foremost in your mind. This is for you! You are paying me and my colleagues to present, profess
and teach you new concepts and ideas.
Please complain if you are not getting this, because we certainly will
if we are not seeing satisfactory effort!
Topics to be covered:
Topic |
Number of Weeks |
Sub-Topics |
Logic (Part II) |
3 |
Quick review of Part I Natural deduction Consistency Completeness Normal forms (conjunctive and disjunctive) |
Graph Theory |
2 |
Trees Undirected and directed graphs Traversal strategies Cyclic and acyclic paths Spanning trees |
Discrete Probability |
2 |
Frequency Distributions Expected value Conditional probability |
Digital Logic |
1 |
Logic gates and circuits Flip-flops |
|
1 |
FSMs State diagrams FSMs as a virtual machine FSMs as a representation of computation Limits of deterministic FSMs |
Proof Techniques |
1 |
Induction (on graphs) |
Integer and Floating-point Representations |
2 |
Ones' complement Two’s complement Signed magnitude Floating point representation; IEEE 754 |
Grade Scale:
A : excellent ~90-100
B : very good ~80-89
C : satisfactory ~70-79
D : poor ~60-69
F
- unsatisfactory
~0-59
Tentative Grade Components:
Quizzes
& Homeworks - 10%
Participation
(includes attendance) -
5%
Exam 1 - 25%
Exam 2 - 25%
Final Exam - 35%
Final exam location, date, time
|
|
|
Wednesday |
December 14 |
|