Course Outline / Syllabus for Class Under Mr. Edgardo R. Rilloraza

COURSE SYLLABUS
AY: 2007-2008, 2nd Semester

Course Title: DISCRETE MATHEMATICS II
Course Code: Math_5
Pre-Requisite: Discrete Math I
Credit: 3
Total Hours: 54 hours

Course Description:


Course Objectives:

At the end of the semester, the students should be able to:
1. define combinatorics
2. apply the basic counting principles
3. use tree diagram in solving problems in permutations

Course Outline:

I. COUNTING
1.1 Introduction
1.2 Basic Counting Principles
1.3 Permutations
1.4 Combinatorics

II. Linear Equations and Matrices
2.1 Systems of Linear Equations
2.2 Matrices: Definitions
2.3 Matrix Operations
2.4 Properties of Matrix Operations
2.5 Special Types of Matrices
2.6 Echelon Form of a Matrix
` 2.7 Elementary Matrices
2.8 Inverse of a Matrix
2.9 Equivalent Matrices

III. DETERMINANTS
3.1 Definition
3.2 Properties of Determinants
3.3 Cofactor Expansion
3.4 The Inverse of a Matrix
3.5 Other Application of Determinants

IV. BOOLEAN ALGEBRA
4.1 Boolean Functions
4.2 Representing Boolean Functions
4.3 Logic Gates

V. GRAPHS
5.1 Introduction
5.2 Types of Graphs
5.3 Graph Models
5.4 Graph Terminology
5.5 Paths and Cycles

VI. REVIEW OF BASIC MATHEMATICS

Course Requirements:

a. Class Standing (60%): assignments, quizzes, problem sets, recitation/board works, seat works, attendance
b. Periodical Examinations (40%)

Textbook: Discrete Mathematics/Discrete Mathematics with Applications

References:
1. Discrete Mathematics
2. Discrete Mathematics with Applications

Prepared by:

Mr. Edgardo R. Rilloraza
Instructor

Course Outline / Syllabus

Course Title: DISCRETE MATHEMATICS II
Course Code: Math_5
Pre-Requisite: Discrete Math I
Credit: 3
Total Hours: 54 hours

Course Description:


Course Objectives:

At the end of the semester, the students should be able to:
1. define combinatorics
2. apply the basic counting principles
3. use tree diagram in solving problems in permutations

Course Outline:

1. COUNTING
1.1 Introduction
1.2 Basic Counting Principles
1.3 Permutations
1.4 Combinatorics

2. Linear Equations and Matrices
2.1 Systems of Linear Equations
2.2 Matrices: Definitions
2.3 Matrix Operations
2.4 Properties of Matrix Operations
2.5 Special Types of Matrices
2.6 Echelon Form of a Matrix
2.7 Elementary Matrices
2.8 Inverse of a Matrix
2.9 Equivalent Matrices

3. DETERMINANTS
3.1 Definition
3.2 Properties of Determinants
3.3 Cofactor Expansion
3.4 The Inverse of a Matrix
3.5 Other Application of Determinants

4. BOOLEAN ALGEBRA
4.1 Boolean Functions
4.2 Representing Boolean Functions
4.3 Logic Gates

5. GRAPHS
5.1 Introduction
5.2 Types of Graphs
5.3 Graph Models
5.4 Graph Terminology
5.5 Paths and Cycles

VI. REVIEW OF BASIC MATHEMATICS

Course Requirements:

a. Class Standing (60%): assignments, quizzes, problem sets, recitation/board works, seat works, attendance
b. Periodical Examinations (40%)

Textbook: Discrete Mathematics/Discrete Mathematics with Applications

References:
1. Discrete Mathematics
2. Discrete Mathematics with Applications

Prepared by:

_________________

.
.
.
.
.
.
.
.
.
.
.
.
13hq.com