Compulsory Courses

Discrete Mathematics I
Author: Date:28-02-2011 Hits:
Discrete Mathematics I
 
Objectives and Requirements
 
This course aims to introduce basic ideas of discrete mathematics such as formal mathematical reasoning techniques, basic counting techniques and their applications for computer science students. The objective is intended for students to understand the basic theory and some applications of discrete mathematics. The course gives students training 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.
 
Contents
 
Mathematical logic; Methods of mathematical proof; Predicate calculus; Sets and relations; Castesian product; Functions; Permutations and combinations; Inclusion-exclusion principle; Recurrence relations; Complexity analysis of algorithms.
 
Credit(s): 3
 
Prerequisite Course(s): Nil



Last:Applied Statistics for Science and Engineering

Next:Discrete Mathematics II