Discrete Mathematics, Math 3336
Spring 2008
TTh 1:00pm-2:30pm, 347-PGH
The temptative grades will be available by Tuesday April 29.
Write to me an email containing your records (grades of all your graded homework and Exams) and will reply to you with your final grade.
I will be in my office on Wednesday from 11:00 am to 1:00 pm for office hours.
Instructor:
Giovanna Guidoboni
Office: PGH 631
Phone: 713-743-3776
Email : gio@math.uh.edu
Personal web page:
http://www.math.uh.edu/~gio
This page:
http://www.math.uh.edu/~gio/3336.html
Office Hours:
TTh 11:30am-1:00pm, or by appointment
Information on Assignments and Exams:
- Homework. Homework will be assigned every week and the problems will be on the sections that we cover.
The homework will be assigned and collected every Thursday, starting January 17.
The homework will be also posted online on this web-page.
Your Homework score will be the avarage of the 8 best grades you received on the homeworks.
- Assignments.
- Homework 1 , due Thursday 01/24/08, Solutions .
- Homework 2 , due Thursday 01/31/08, Solutions .
- Homework 3 , due Thursday 02/07/08, Solutions .
- Homework 4 , due Thursday 02/14/08, Solutions .
- Homework 5 , due Thursday 02/21/08, Solutions .
- Homework 6 , due Thursday 03/11/08, Solutions .
- Homework 7 , due Tuesday 04/08/08, Solutions .
- Homework 8 , due Tuesday 04/22/08.
- Exams. There will be 2 in class exams, each lasting 1 hour and 15 minutes, and an optional final exam lasting 3 hours.
The exams will be given on the following dates:
- Final Exam (optional): Thursday, May 8, 2:00pm-5:00pm. Practice for Final Exam
Projects. Four Group Projects have been assigned in class.
Each project consists of a written report and a power point presentation.
The report is due on Thursday April 3, while the power point presentation must be delivered to the Instructor not later than Monday April 7.
The power point presentation will be presented in the class of Tuesday April 8.
The Project affect your global grade for the class as shown below.
More info
on the specific Projects can be found here:
Policies.
- Calculators may be used during each examination and on homework assignment.
- For each in class exam you will be allowed to have only a pen and a calculator.
Assessment:
| First Exam |
100 points |
| Second Exam |
100 points |
|
Project |
100 points |
| Homework |
100 points |
| Optional Final |
500 points |
Grading:
At the the end of the Semester each student will be offered a
Tentative Final Grade (TFG) = (Exam 1 + Exam 2 + Project + Homework)/4.
The student who does not take the final will receive
this TFG for the course.
For students who elect to take the final the grade will be
Final Grade = (Exam 1 + Exam 2 +Project + Homework + Final)/9.
A: 91.5 - 100
A-: 90 - 91.4
B+: 88.5 - 89.9
B: 81.5 - 88.4
B-: 80 - 81.4
C+: 78.5 - 79.9
C: 66.5 - 78.4
C-: 65 - 66.4
D: 46.5 - 64.9
D-: 45 - 46.5
Important Remarks.
- Attendance is strongly encouraged. You will be responsible for all the material covered in class.
- If a student is not present during an in class Exam, the Exam cannot be taken at another time or location, unless official documentation is provided to justify the absence (e.g. medical certificates ..)
Text:
Discrete Mathematics and Its Applications,
6th Edition, by Kenneth H. Rosen, Publisher: McGraw Hill
Sections to be covered:
1. The Foundations: Logic and Proofs
1.1 Propositional Logic
1.2 Propositional Equivalences
1.3 Predicates and Quantifiers
1.4 Nested Quantifiers
1.6 Introduction to Proofs
1.7 Proof Methods and Strategy
2. Basic Structures: Sets, Functions, Sequences, and Sums
2.1 Sets
2.2 Set Operations
2.3 Functions
2.4 Sequences and Summations
3. The Fundamentals: Algorithms, the Integers, and Matrices
3.1 Algorithms
3.4 The Integers and Division
3.6 Integers and Algorithms
3.7 Application of Number Theory
4. Induction and Recursion
4.1 Mathematical Induction
4.3 Recursive Definitions and Structural Induction
5. Counting
5.1 The Basics of Counting
5.3 Permutations and Combinations
7. Advanced Counting Techniques
7.1 Recurrence Relations
7.2 Solving Linear Recurrence Relations
8. Relations
8.1 Relations and Their Properties
8.3 Representing Relations
8.4 Closures of Relations
8.5 Equivalence Relations
8.6 Partial Orderings
9. Graphs
9.1 Graphs and Graph Models
9.2 Graph Terminology and Special Types of Graphs
9.3 Representing Graphs and Graph Isomorphism
9.4 Connectivity
9.5 Euler and Hamilton Paths
Giovanna Guidoboni