Math 245-Discrete Mathematics Syllabus (Spring 2018)
Class # 9382 M, W 08:00a.m.-09:15a.m.
Classroom Bldg H, Room 138
Instructor: Hien Nguyen
Email:
Office: H131 in the H building
Office Hours: Wednesday 7:10a.m.-7:55a.m., and by appointment. My goal is for you to understand the concepts presented in this course, so please don’t hesitate to ask for help.
Prerequisite: “C” grade or higher or “Pass” in Calculus II (Math 280 or the equivalent)
Text Required: Discrete Mathematics with Applications, 4th Edition by Susanna Epp
Course Objectives:
1)Formal logic including statements, symbolic representation, tautologies, propositional logic, quantifiers, predicates, and validity, predicate logic, and logic programming;
2)Proofs, recursion, and analysis of algorithms including proof techniques, proof by induction, proof of correctness programming, recursive definitions, recurrence relations, and analysis of algorithms;
3)Sets, combinatorics, probability, and number theory including counting, principle of inclusion and exclusion; Pigeonhole Principle, permutations and combinations, and Binomial Theorem;
4)Relations, functions, and matrices including relations and databases, modular arithmetic;
5)Graphs and trees including graphs and their representations, trees and their representations, decision trees, and Huffman Codes;
6)Graph algorithms including directed graphs and binary relations; Warshall’s algorithm, Euler Path and Hamiltonian Circuit, shortest path and minimal spanning tree, traversal algorithms, and articulation points and computer networks;
7)Boolean algebra and computer logic including Boolean algebra structure, logic networks, and minimization; and
8)Modeling arithmetic, computation, and languages including algebraic structures, finite-state machines, and formal languages.
SLO'S(Students Learning Outcomes):
Students will be able to do:
1)Use recursion to analyze algorithms and programs;
2)Write proofs using symbolic logic and Boolean Algebra;
3)Use sets to solve problems in combinatorics and probability theory;
4)Apply matrices to analyze graphs and trees; and
5)Use finite state machines to model computer operations.
Resources: The following free resources are available and to help you succeed in my class.
Instructor: Ask me questions during class and during my office hours.
Study Groups: I recommend forming a study group with your classmates to compare homework solutions, study for tests and prepare for the final exam.
STEM Achievement Center: H Building First Floor.
Mondays-Thursdays 9:00am-6:00pm
Fridays 9:00am-2:00pm
Calculators: A scientific or graphing calculator is required for this class. TI-83 or TI-84 is recommended. However, graphing calculators and cell phone calculators will not be allowed during tests.
Make-up Test Policy: I do not give make-up tests, no exceptions.
Academic Integrity: If a student is found cheating on the test, he/she will receive a grade of "F" for that test. If the student cheats for a second time, he/she will be dropped from the course and will receive a grade of "F" for the course.
Electronics Devices: Cell phones, iPods, and all electronic listening and/or photo-capable devices are to be silenced and put away during class. Students are not permitted to listen to any electronic device during class.
Drop Dates: Last Day to Drop without “W”February 9
Last Day to Drop Semester Length ClassesApril 27
Attendance: Regular class attendance is not only required, but it is essential to your success in this class. Each tardy or early exit from class counts as an absence.If you stop attending class and fail to take the tests for the remainder of the semester, YOU must withdraw yourself from this course. I will not do your paperwork for you and you will receive a letter grade of “F” unless you have officially withdrawn.You MAY be dropped if you miss more than 3 classes.
Homework: Homework is due on the day of the tests and final exam. Homework should be “neat and complete” to earn maximum points. Homework with no work shown will receive zero points.
Test: There will be three tests. I will replace your lowest test score by your final exam if your final exam scored higher. The tests will be closed-book and closed-notes. You will not be allowed to leave the room once a test has started. Please make sure you have taken care of all necessary business prior to the start of the exam.
Test #1: 03/07/2018
Test #2:04/11/2018
Test #3:05/21/2018
Quiz:The quiz will be given at the beginning of the class. I will drop one of your lowest quiz score. I do not give make-up quizzes, no exceptions.
Final Exam: The final exam is comprehensive. It is also closed-book and closed-notes. The final is on Tuesday, December 14 from 06:45p.m. to 08:45p.m., and taking the final is mandatory for all students in this class. The final exam cannot be dropped. You cannot get a passing score in the class without getting an overall score of at least 60% on the final exam even if your overall grade is 70% or above.
Grading Procedures:
The course grade will be based on the following.
Test 1Chapter 1, 2 and 315% (150 points)
Test 2Chapter 415% (150 points)
Test 3Chapter 5 and 915% (150 points)
Quiz21% (210 points)
Homework9% (90 points)
Comprehensive Final Exam25% (250 points)
Total100% (1000 points)
Percentage (Points) / Grade90% - 100%
(900-1000 pts) / A
80% - 89%
(800-899 pts) / B
70% - 79%
(700-799 pts) / C
60% - 69%
(600-699 pts) / D
Below 60%
(0-599 pts) / F
Time required for this course: This class covers many topics. You will need to spend 6-9 hours per week learning the content, doing homework assignments, and studying for tests.
Disabled Students: If you require accommodations for a disability, please let me know and contact the DSPS Student Resources at (619) 660-4239.
Mathematics 245 – Discrete Mathematics
Tentative Schedule Spring 2018
MONDAY / TUESDAY / WEDNESDAY / THURSDAY / FRIDAY1/29 Syllabus, Sect. 1.1 / 1/30 / 1/31 Sect. 1.2 / 2/1 / 2/2
2/5 Sect. 1.3 / 2/6 / 2/7 Sect. 2.1,
Quiz # 1 / 2/8 / 2/9
2/12 Sect. 2.2, 2.3 / 2/13 / 2/14 Sect. 2.3, Sect. 3.1,
Quiz # 2 / 2/15 / 2/16
Lincoln Day
2/19
Washington Day / 2/20 / 2/21 Sect. 3.1, 3.2 / 2/22 / 2/23
2/26 Sect. 3.2, 3.3 / 2/27 / 2/28 Sect. 3.4,
Quiz # 3 / 3/1 / 3/2
3/5 Review
Test # 1 / 3/6 / 3/7 Ch 1, 2, 3 hwk due.
Test # 1
(C. 1,2, and 3) / 3/8 / 3/9
3/12 Sect. 4.1 / 3/13 / 3/14 Sect. 4.2, 4.3 / 3/15 / 3/16
3/19 Sect 4.3, 4.4 / 3/20 / 3/21 Sect. 4.5,
Quiz # 4 / 3/22 / 3/23
3/26
Break / 3/27
Break / 3/28
Break / 3/29
Break / 3/30
Break
4/2 Sect. 4.6 / 4/3 / 4/4 Sect. 4.7
Quiz # 5 / 4/5 / 4/6
4/9 Sect. 4.8 / 4/10 / 4/11 Review
Test # 2 / 4/12 / 4/13
4/16Ch 4 hwk due, Test # 2
(Ch 4) / 4/17 / 4/18 Sect. 5.2 / 4/19 / 4/20
4/23 Sect. 5.3, 5.6 / 4/24 / 4/25 Sect. 5.6,
Quiz # 6 / 4/26 / 4/27
4/30 Sect. 5.7 / 5/1 / 5/2 Sect. 5.8,
Quiz # 7 / 5/3 / 5/4
5/7 Sect. 9.1, 9.2 / 5/8 / 5/9 Sect. 9.2, 9.3 / 5/10 / 5/11
5/14 Sect. 9.4 / 5/15 / 5/16 Quiz # 8, Review Test#3 / 5/17 / 5/18
5/21Ch 5, 9 hwk due,
Test # 3
(Ch 5 and 9) / 5/22 / 5/23 Review
Final Exam / 5/24 / 5/25
Comprehensive Final Exam: Wednesday, May 30 8:00 am – 10:00 am
This syllabus may be altered during the course of the semester.