Course Description

Mathematical topics fundamental to the computer science based curriculum for information system department student are covered in this course. The topics include logic, sets, functions, algorithms basics, counting, probability and graph theory.

Textbook
1. Kenneth H. Rosen, Discrete Mathematics and its Applications, Sixth edition, Mc Graw-Hill International Edition. 2007. 2. Richard Johnsonbaugh, Discrete Mathematics, Seventh edition, Pearson Education Inc., 2009 3. Kenneth H. Rosen, Handbook of Discrete and Combinatorial Mathematics, CRC Press, 1999.

Instructor
Ahmad Mukhlason, S.Kom, M.Sc. Email. mukhlason@is.its.ac.id Office. TC 216 Room YM|Gtalk. kang_ahmad05|ahmad.mukhlason Blog. www.cakshon.net FB. ahmad.mukhlason@gmail.com Phone. 085732957873

Objectives
Upon completion of this program, you will be able to: 1. Solve mathematical problems that have applications to computer science, 2. Apply mathematical tools to solve computer science problems, 3. Appreciate the variety of application of particular mathematical techniques.

Teaching Assistants
Tutor/Mentor :
1. 2. 3. Nila Cynthia Dewi (5208100086) [Email:ni_el@is.its.ac.id,Hp. 085730997693] Laili Rachmawati Ch.(5209100106) [Email:laili09@mhs.is.its.ac.id,Hp.08564548388] Fia Mahanani(5209100707) [Email:fia.mahanani@yahoo.com,Hp.085730080390]

Competencies
Upon completion of this program, you will have competencies of: 1. Mathematical Reasoning. Student must understand mathematical reasoning in order to read, comprehend, and construct mathematical arguments. 2. Combinatorial Analysis. An important problemsolving skill is the ability to count or enumerate objects. 3. Discrete Structure. Student can work with discrete structure, which are the abstract mathematical structures used to represent discrete objects and relationships between these object. These discrete structures include sets, permutations, relations, graphs, trees, and finitestate machine. 4. Algorithmic thingking. Certain classes of problems are solved by the specification of an algorithm. After the algorithm has been described, a computer program can be constructed implementing it. 5. Applications and Modeling.

Sets. Set operation. Functions. Sequences and Summations. The Fundamentals: Algorithms, the Integers: Algorithm. the growth of function. Complexity of Algorithm. The Integers and Division. Primes and Greatest Common Divisors. Integers and Algorithm. Integers and Algorithms. Applications of Number Theory. Induction and Recursion; Mathematical Induction. Strong Induction and Well-Ordering. Recursive Definitions and Structural Induction. Recursive Algorithms. Program Correctness. Counting; The basics of Countings. The Pigeonhole Principle. Permutations and Combinations. Binomial Coefficients. Generalized Permutations and Combinations. Generating Permutations and Combinations. Advanced Counting; Recurrence relations. Solving linier Recurrence Relation. Divide and Conquer Algorithms and Recurrence Relations. Generating functions. Inclusion-exclusion. Application of Inclusion-Exclusion. Relations : Relations and their properties. N-ary relations and Their Applications. Representing Applications. Closures of Relations. Equivalences Relations. Partial ordering. Graph: Graph and Graph model. Graph terminology and special type of Graph. Connectivity. Euler and Hamilton Path. Shorthest-Path Problems. Planar Graph. Graph coloring. Trees: Introduction to Trees. Applications of Trees. Tree Traversal. Spanning Trees. Minimum Spanning Trees.

Grader :
1. 2. 3. Widiasa Wijaya(5209100160) [Email: widiasa09@mhs.is.its.ac.id,Hp.081703173434] Gusviantoko Dali P.(5207100097) [Email: vhe_ia_en@yahoo.co.id,Hp.085645550552] Atikah Shafira Hatta (5207100082) [Email: atikahattash@yahoo.com,Hp. 085649941090]

Attendance
Class attendance is required. You are responsible for all material covered in class and any assignments given in the class whether or not you are present. It is your responsibility to pick up any missed quizzes, assignments or handouts. Every class is important. If you miss a class you may still be tested on that material the following week. For student whose attendance less than 90%, his/her grade will be reset to zero (failed).

Meeting
Class A B C Time 03.30 - 06.00 pm 03.30 - 06.00 pm 09.45 - 12.15 am Room (Day) TC 107 (Thu.) TC 104 (Wed.) TC 102 (Mon.)

Exams
There will be two theory examinations (70% Multiple choice, 30% Written test) and one Final Project examination. These examinations will cover 50% of your final grade

Materials will be covered

The Foundations: Logic and proof : Propotional logic. Propotional equivalences. Predicates and Quantifiers. Nested Quantifiers. Rules of inferences. Introduction to Proofs. Proof Methods and Strategy. Basic structures:

Assignments and Quizzes

There will be 6-8 homework assignments. The assignment includes writing and presentation assignment (group and individual as well). There is a

Refreshment Quiz at the beginning of every regular class. Every question must be answered independently. Cheating will result in automatic failure. Assignment and Quizzes will cover 50% of your final grade.

Tutorial Session
There will be tutorial session that will be delivered by Tutor/Mentor. This tutorial session is not compulsary, but students are highly encouraged to join this tutorial session. Tutorial session will be scheduled later according to Tutor/Mentor arrangement.

Late Homework/Make-up Policy

If you submit homework after the due date, 40% of the total points will be deducted per late business day. There will be no make-up quiz unless you can prove that you were involved in an emergency. More specifically: 1. If you were ill or had a family medical emergency, you should show me a doctors diagnosis with the same date. 2. If you were involved in a traffic accident, you should show me the police report with the same date. 3. If any other reason prevented you from coming to the class, a third person who is not your friend must contact me independently to confirm it. If you tell it to me before the class, itll be much easier for you to have a make-up. The same rules apply to making up exams.

KS091201 DISCRETE MATHEMATICS (a syllabus)

e-learning: http://si.its.ac.id/apps/elearning/course/view.php?id=88

Academic Integrity
Academic integrity is expected. Academic dishonesty, including plagiarism, will result in a 0 for the related assignment or exam, and may result in dismissal from the course and an E grade for the course. Students must be familiar with the Code of Academic Integrity in the College catalog.

Suggested Links and Online Resources

1. The Mathematical Zone, http://www.mathzone.com 2. The companion website, http://www.mhhe.com/rosen 3. The Richard companion website http://condor.depaul.edu/~rjohnson/dm7th/

Information System Department Faculty of Information Technology INSTITUT TEKNOLOGI SEPULUH NOPEMBER Jl. Raya ITS Information System Dept. (TC) Building ITS Sukolilo Campus Surabaya 60111 Telp. (031)5999944 Fax. (031)5964965 Website. http://si.its.ac.id Email. info@si.its.ac.id

Credit Semester

3 Credit For 1 Year 1 Semester Student Gasal Year 2010/2011

st

st