# COURSE OUTLINE

College of Computer Studies
Course Title: DISCRETE STRUCTURES 1 Effectivity: SY 2005 – 2006 Document Code: QR – AAD – 009 Revision No.: 00

Course Code: CSCI08 Credit Unit(s): 3

Prerequisite: MATH04 Lecture Unit(s): 3 Lab Unit(s): 0

Issue No.: 01

Date Issued: 27 Nov 2008

COURSE DESCRIPTION The course introduces the students to mathematical logic: propositions, qualifiers, predicates, proof techniques; mathematical induction; fundamentals of set theory: sets, power sets, algebra of sets; relations; functions; countability and finiteness; graphs and trees. COURSE OBJECTIVES At the end of the term, the student is expected to be familiar with the underlying principles and theories and applications of discrete structures. Specifically, the student should be able to: 1. 2. 3. 4. Apply the theories and operations on sets. Computer using permutation or combination. Enumerate and apply the different mathematical progressions. Understand what function is, its symbols and notation, as well as the operations involved.

COURSE CONTENT I. Orientation 1.1 Setting of ‘house’ rules. 1.2 Discussion of the College Mission, Vision and Objectives. 1.3 Course Requirements 1.4 Grading System Set Theories and Operations 2.1 Definitions, symbols and notations 2.2 Set theories 2.3 Relations between sets 2.4 Operations on Sets 2.5 Algebraic properties of set operations 2.6 Venn and Line diagrams 2.7 Addition principle

II.

Prepared by: GLENDA A. BENDANILLO

Reviewed by:
CURRICULUM DEVELOPMENT SECTION

Approved by: ALMA V. DELA CRUZ, Ph.D.
1/3

This is a controlled document. Revision of this document should undergo the standard procedure. The original copy of this document is located at the office of the Academic Affairs Department (AAD). The user should secure the latest revision of this document from the AAD office.

COURSE OUTLINE
College of Computer Studies
Course Title: DISCRETE STRUCTURES 1 Effectivity: SY 2005 – 2006 Document Code: QR – AAD – 009 Revision No.: 00

Course Code: CSCI08 Credit Unit(s): 3

Prerequisite: MATH04 Lecture Unit(s): 3 Lab Unit(s): 0

Issue No.: 01

Date Issued: 27 Nov 2008

COURSE CONTENT III. Combinatorics 3.1 Fundamental principles of counting 3.1.1 Product rules 3.1.2 Sum rules 3.1.3 Tree design 3.2 Permutation 3.3 Combination Mathematical Progressions 4.1 Progression 4.1.1 Arithmetic progression 4.1.2 Geometric progression 4.1.3 Harmonic progression 4.2 Other types of series Relations and Digraphs 5.1 Definitions, symbols and notations 5.2 Binary relations 5.3 Solution set and coordinate diagram of relation 5.4 Inverse relation 5.5 Product set and partitions 5.6 Set arising from relation 5.7 Matrix of a relation 5.8 Digraphs 5.9 Path and relations and digraphs 5.10 N-ary relations 5.11 Properties of relations 5.12 Equivalence of relations 5.13 Manipulation of relations 5.14 Composition of relations Functions 6.1 Definition, symbol and notation 6.2 Domain and range function 6.3 Two equal function 6.4 Inverse functions 6.5 Special types of functions 6.6 Composition or product function

IV.

V.

VI.

Prepared by: GLENDA A. BENDANILLO

Reviewed by:
CURRICULUM DEVELOPMENT SECTION

Approved by: ALMA V. DELA CRUZ, Ph.D.
2/3

This is a controlled document. Revision of this document should undergo the standard procedure. The original copy of this document is located at the office of the Academic Affairs Department (AAD). The user should secure the latest revision of this document from the AAD office.

COURSE OUTLINE
College of Computer Studies
Course Title: DISCRETE STRUCTURES 1 Effectivity: SY 2005 – 2006 Document Code: QR – AAD – 009 Revision No.: 00

Course Code: CSCI08 Credit Unit(s): 3

Prerequisite: MATH04 Lecture Unit(s): 3 Lab Unit(s): 0

Issue No.: 01

Date Issued: 27 Nov 2008

COURSE CONTENT VII. Order Relations and Functions 7.1 Partially and totally ordered sets 7.2 External elements of partially ordered sets 7.3 Lattices 7.4 Properties of lattices

RECOMMENDED REFERENCES 1. Kolman, B., Busby, R. C., Ross, S. C. Discrete Mathematical Structures, Latest Edition. Prentice Hall. 2. Rosen, Kenneth H., Mandatory Package: Discrete Mathematics and Its Applications, Latest Edition. McGraw-Hill Science/Engg/Math. 3. Lipschutz, S. Lipson, M. L. Schaum’s Outline of Discrete Mathematics, Latest Edition. McGraw-Hill Trade. 4. Tremblay, Jena – Paul. Discrete Mathematical Structures with Applications to Computer Science, Latest Edition. McGraw-Hill, Inc. 5. Benedicty, M., Sledge, F. R. Discrete Mathematical Structures, Latest Edition. Thomson Learning. 6. Kolman, B., Busby, R.C. Discrete Mathematical Structures for Computer Science, Latest Edition. Pearson Higher Education. 7. Grimaldi, Ralph P. Discrete and Combinatorial Mathematics, Latest Edition. Addison Wesley Pub. Co.

GRADING SYSTEM Prelims 40% 10% 50% 100% Midterm 40% 10% 50% 100% Finals 40% 10% 50% 100%

Quizzes Class Standing Major Exam TOTAL

Final Grade = 30% Prelims + 30% Midterm + 40% Finals

Prepared by: GLENDA A. BENDANILLO

Reviewed by:
CURRICULUM DEVELOPMENT SECTION

Approved by: ALMA V. DELA CRUZ, Ph.D.
3/3

This is a controlled document. Revision of this document should undergo the standard procedure. The original copy of this document is located at the office of the Academic Affairs Department (AAD). The user should secure the latest revision of this document from the AAD office.