1. Instructor information
:
Instructor name: NGUYỄN THÀNH TRUNG Email: trungnt@uit.edu.vn
Phone: Cell phone: 0918342240
Office: Km20 Ha Noi Highway, Office hours:
Linh Trung, Thủ Đức, TP. HCM
2. Class room
:
Main class room (campus): UIT Auditorium
Online classroom (website): www.cttt/dma14/Spring2011
Class meeting time: Wed 8:00 – 11:00, Fri 8:00 – 11:00, weekly
Library hours (where): Sat 8:00- 11:00, AEP-Library.
3. Course information
:
Course Prerequisites:
Precalculus. An understanding of algebra is required for the course. C/C++ Programming. We will be covering basic algorithmic analysis.
Catalog Description:
The fundamental mathematical tools used in computer science: sets, relations, and functions; propositional logic, predicate logic, and inductive proofs;
summations, recurrences, and elementary asymptotics; counting and discrete probability; undirected and directed graphs; introductory linear algebra, with
applications in computer science.
We will be introducing the fundamentals of discrete mathematics, initially focusing on logic and proofs. The course will then introduce a number of
mathematical structures and tools that build on that logical foundation.
Course Goals:
At the end of the course, students would:
· Have knowledge of the concepts needed to test the logic of a program.
· Have gained knowledge which has application in expert system, in data base and a basic for the prolog language.
· Have an understanding in identifying patterns on many levels.
· Be aware of a class of functions which transform a finite set into another finite set which relates to input output functions in computer science.
· Be exposed to concepts and properties of algebraic structures such as semigroups, monoids and groups.
4. Book and materials
:
Required Text:
Seymour Lipschuts, Marc Lipson, Theory and Problems of Discrete Mathematics (3rd edition),
McGRAW-HILL, 2009.
5. Covered Topics
1. The Foundations: Logic and Proofs
2. Basic Structures: Sets, Functions, Sequences and Sums
3. The Fundamentals: Algorithms, the Integers, and Matrices
4. Introduction and Recursion
5. Counting
6. Discrete Probability
7. Advanced Counting Techniques
8. Relations
9. Graphs
10. Trees
11. Boolean Algebra
12. Modeling Computation
6. Course requirements
:
- Homework
· Class participation
· Mid Term Exam
· Final Exam
I reserve the right to further curve the course grades. Any such curve will not reduce any student’s grade or "leapfrog" one student's grade above
another's.
Homework
:
Consists of weekly assignments (and possible quizzes)
Class participation
:
Leading example problems in class, answering questions when called, submitting exam questions
Exams
:
One mid term exam organized by subject matter and one comprehensive final exam.
7. Grading Procedures
:
Homework:...................................................................................... 20%
Class participation:......................................................................... 10%
Mid Term Exam:............................................................................. 20%
Final Exam:...................................................................................... 50%
Grading Scale
90-100 guarantees an A
88-89 guarantees an A-
86-87 guarantees a B+
80-85 guarantees a B
78-79 guarantees a B-
76-77 guarantees a C+
70-75 guarantees a C
68-69 guarantees a C-
65-67 guarantees a D
8. Academic integrity Policies
:
· Attendance will not be recorded at lecture sessions unless it becomes an issue. If you are absent it is your responsibility to find out what was covered
in class and to catch up.
· Homework assignments will be due on Saturdays at the start of class. Solutions may also be emailed to the instructor so long as the email is sent prior
to the start of Saturday's class. Because we may discuss some of the problems during Saturday's class, late assignments will not be accepted. Exceptions
may be made for speial circumstances. In the event of a family emergency, serious illness/injury, or other significant event, please let the instructor
know as soon as is reasonably possible.
· Participation in classroom discussion is a valuable part of the class. It is not necessary to raise your hand before making a comment. Simply be
courteous and respectful to everyone in the class. If you have a question during lecture or if a point is not explained to your satisfaction, don’t wait
until the lecture is over to get clarification. There’s a good chance that someone else is wondering the same thing.
9. Comments and notes
:
It is expected that the students read related chapter in textbook and lecture noted before each class. This will help to capture the topics presented and
discussed during class hours.
Assignments of each session must be submited by email before the next session begins.
A student who misses class or is late with an assignment, and who feels their situation is due to exceptional circumstances, should immediately discuss the
matter with the instructor, and the instructor may waive the late penalty and/or grant an appropriate extension.
I reserve the right to change the course policies or schedule in order to facilitate instruction. Any such changes will be discussed in class and updated
on the course web site.
Students must respect their fellow students and not disrupt class. Therefore, cell phones, pagers, other such alarms, or personal conversations which
disturb the lecture are not allowed. Students with personal laptops are encouraged to bring them to class; however, laptops are not required for this
course.
Students can't eat or dink in classrooms.
Instructor’s Signature
Nguyễn Thành Trung