jump to navigation

Discrete Mathematics can be FUN!!! October 1, 2009

Posted by integereuler in Discrete Mathematics.
add a comment

What is Discrete Mathematic ?

It is Mathematical topics fundamental to the computer science curriculum are covered in this course. The topics include logic, sets, functions, algorithms basics, counting and probability and graph theory.

In Information System Major ITS, it has the Course (KS091201) and the materials that  will be covered are about :

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: Sets. Set operation. Functions. Sequences and Summations.
The Fundamentals: Algorithms, the Integers, and Matrices: 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. Matrices.
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. penerating
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.

Why can it be fun??

Well, you’ll see everything in this BLOG , sooo keep in touch 😉

IE