Course Outline UPDATED 2/16/03
Math 1140 Discrete
Math Spring Semester 2003
MW and TTh at 11am in TE104
Available Labs: TBD
|
Instructor |
Name: Dr. David L. Ferro Email: dferro@weber.edu Web: http://icarus.weber.edu/home/dferro Phone: 626-8095 Office: ET118a Hours: MTWTh at 9-10am and M at 12:30-1:30pm |
|
Texts |
Discrete
Mathematics and Its Appllications, 4th Edition, Kenneth Rosen |
Key Links:
Tentative Class Schedule, Topic Guide, and Assignments
|
Week |
Starting |
Topic |
Chapters |
Work |
|
1 |
Monday, Jan 13 |
Intro; programming basics; compiler use |
- |
|
|
2 |
Tuesday, Jan 21 |
Program logic: selection, iteration |
- |
Practice Homework |
|
3 |
Monday, Jan 27 |
Logic; Sets; Functions |
1 |
week3 Program 1 Due: First day of class of week 4 |
|
4 |
Monday, Feb 3 |
Algorithms, Integers, |
2 |
week4 Exercise 1
Due: First day of class of week 5 |
|
5 |
Monday, Feb 10 |
Matrices/Arrays; |
2 |
|
|
6 |
Monday, Feb 17 |
Proofs, reasoning, & program correctness; *Test One Review* & test1 |
2, 3 |
week6 Program 2 Due: First day of class of week 7
|
|
7 |
Monday, Feb 24 |
Proofs, reasoning, & program correctness (cont) |
3 |
week7 Exercise 2 Due:
First day of class of week 8
|
|
8 |
Monday, Mar 3 |
Counting and systematic case coverage |
4 |
week8 Program 3 Due:
First day of class of week 9
|
|
9 |
Monday, Mar 10 |
Advanced counting methods |
5 |
|
|
SPRING BREAK |
Monday, Mar 17 |
Spring Break |
- |
|
|
10 |
Monday, Mar 24 |
Advanced counting methods |
6 |
Week10 Exercise 3 Due: First day of class of week 11 |
|
11 |
Monday, Mar 31 |
Relations & representations; *Test
Two Review* & test2 |
6 |
week11 Exercise 4 Due: First day of class of week 12 |
|
12 |
Monday, Apr 7 |
Graph theory and applications |
7 |
Week12- Program 4 Due: First day of class of week 13
|
|
13 |
Monday, Apr 14 |
Trees and applications |
8 |
Week13 Exercise 5 Due: First day of class of week 14
|
|
14 |
Monday, Apr 21 |
Boolean algebra |
9 |
Week14 Program 5 Due: First day of class of week 15
|
|
15 |
Monday, Apr 28 |
Integration of topics; Review |
- |
|
|
FINALS |
Monday, May 5 |
Final exam slated will be in the natural science
test center in SL 228 (Science Lab 228) starting Friday, May 2 at 9am and
through Wednesday, May 7 til 4:30pm |
|
|
|
Class Objective |
At the conclusion of this course, the student should be
able to write simple programs, understand the fundamentals of algorithmic
logic, and the applications discrete mathematics in computing. The student should
be able to analyze Boolean logic expressions, do proofs of logical
correctness, and demonstrate the use of sets, functions, counting, relations,
graphs, and trees in programs. The student should also be able to
explain simple models of computation including finite automata and Turing
machines. |
||||||||||||||||||||||
|
Class Organization |
Class will consist of lecture and discussion on topics
assigned through this outline and class assignments. The instructor will expect the students to
have read the covered chapters prior to classroom instruction. In addition, the class will have both
individual and group projects during supervised class and outside class
times. The instructor will engage with
the class to assure that learning occurs. Students are responsible for tracking their assignments
and their own grades. Check the web
page for information. After an
assignment, please give the professor time to correct work and post grades. |
||||||||||||||||||||||
|
Exams, Projects, Homework, Class Participation |
There will be three tests. This will either be in-class or online. There will be programming, written papers
and short presentations. Students
will likely have a weekly homework assignment. Unless stated otherwise, projects/homework will be due on first
day of class the week following assignment.
They will be discounted for late.
There are no makeups.
Conflicts should be brought to the professors attention as soon as
possible before a given test or presentation. |
||||||||||||||||||||||
|
Grading Policies |
tests 60% (20% each) Homework, quizzes, presentations, projects 35% Class Participation 5% Final letter grades given final scores:
|
||||||||||||||||||||||
|
Note on Special Needs |
Any student requiring accommodations or services due to a
disability must contact the Services for Students with Disabilities (SSD) in
room 181 of the Student Service Center.
SSD can also arrange to provide course materials (including this
syllabus) in alternative formats if necessary. |
||||||||||||||||||||||
|
WSU Student Code |
Students are expected to be familiar with the WSU Student
Code and abide by it. The Code may be
reviewed on line at http://www.weber.edu/ppm/6-22.htm
(pay specific attention to Section 4D).
All necessary steps will be taken to enforce the Student Code to
guarantee fairness to all students. |
||||||||||||||||||||||
|
Accounts |
You can complete projects at the WSU computer science
lab. If you own or have access to the
necessary software, of course, you do not NEED to. |
||||||||||||||||||||||
|
|
|