Compulsory Courses

Discrete Mathematics II
Author: Date:28-02-2011 Hits:
Discrete Mathematics II
Objectives and Requirements
This course introduces the basic concepts and techniques of discrete mathematics. It will help students understand the basic theory and some applications of discrete mathematics. It trains students in the ability to think quantitatively and analyze problems critically.
After learning the course, the students should be able to:
1. explain at high levels concepts from discrete mathematics.
2. implement basic operations in discrete mathematics.
3. use formal mathematical reasoning techniques and basic counting techniques.
4. develop mathematical models through relations, combinatorics, and functions, and apply mathematical methods to a range of problems in computer sciences.
Propositional Logic; Predicate Logic. Sets; Functions; Relations; Equivalence \& Order Relations; Combinatorics; Inclusion-Exclusion Principle; Recurrence Relations; Graphs; Directed Graphs; Connectivity; Euler \& Hamilton Graphs; Weighted Graphs; Shortest Paths (Dijkstra's Algorithm); Trees; Rooted Trees; Binary Trees; Spanning Trees.
Credit(s): 3
Prerequisite Course(s): Discrete Mathematics I

Last:Discrete Mathematics I

Next:Introduction to Computer Science