Scribd
Upload
363 views

Discrete Structures Syllabus 2018 Anave

This document contains a course syllabus for a Discrete Structures course taught at Osmeña Colleges in Masbate, Philippines. It outlines the course objectives, which include learning number systems, logic, proofs, counting, and graph theory. The syllabus details the 18 week schedule, assignments, grading system, and instructor information. The goal of the course is for students to become comfortable with mathematical thinking and writing logical proofs.

Uploaded by

Daisy Jean Abas Castillo
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
363 views

Discrete Structures Syllabus 2018 Anave

This document contains a course syllabus for a Discrete Structures course taught at Osmeña Colleges in Masbate, Philippines. It outlines the course objectives, which include learning number systems, logic, proofs, counting, and graph theory. The syllabus details the 18 week schedule, assignments, grading system, and instructor information. The goal of the course is for students to become comfortable with mathematical thinking and writing logical proofs.

Uploaded by

Daisy Jean Abas Castillo
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 5

OSMEÑA COLLEGES

City of Masbate, 5400 Philippines


Tel./ Fax. (056) 333-2778
E-Mail Address: [email protected]

Course Syllabus
Discrete Structures

VISION STATEMENT

Osmeña Colleges envisions graduates equipped with knowledge, skills, and values who will be
productive and self-sufficient individuals.

MISSION STATEMENT
With the aid of Divine Providence, Osmeña Colleges dedicates itself to develop a responsible
citizenry who will be committed to serve God, country and home, to adhere to and sustain the
principles of productivity and self-sufficiency, to translate development goals towards the attainment of
a better quality of life.

Course code : CS104


Course Title : Discrete Structures
Course Credit : 3 Units
Name Of Instructor : Jessica R. Anave
Educational Qualification : Bachelor Of Science In Computer Science
Osmeña Colleges
24 Units in Bachelor of Secondary Education
Osmeña Colleges
NC2-CHS @ Tesda Masbate
Years of Experience in Teaching : 8 years
Specialization : Computer Hardware, Computer Application
Office Location : Multimedia Building ITCC room
Consultation time : Wednesday 1-2 pm @ itcc room
Contact No : 09468010608 email: [email protected]

I. Course Description

Designing efficient algorithms for computational problems is at the core of computer science.
This course will cover fundamental mathematical foundations required for conceiving, proving, and
analyzing algorithms.

We will begin with an overview of mathematical notation and the basic concepts of sets,
functions, and relations. We will then study logic, proof techniques, combinatorics (counting),
probability, asymptotic notation, recurrences, and the beginnings of graph theory. By the end of this

1
course, you will have become familiar with a number of discrete structures that are used throughout
computer science.

The main purpose of this course is for you to become comfortable with mathematical thinking
that allows you to write clean, logical, proofs.

II. Course Objectives

At the end of this semester the student should be able to:

 Know how to convert number from one base to another (e.g. from decimal to binary)
 Build truth tables for propositional expressions.
 Prove properties using a variety of proof strategies including direct proofs, proofs by
contradiction, proofs by cases, and inductive proofs.
 Solve counting problems using combinatorial analysis,
 Use matrices to represent relations and graphs, and
 Analyze the complexity of common graph algorithms

III. Pre-requisite:
No pre-requisite subject.

IV. Methods of Instruction:


1. Lecture
2. Laboratory

V. Course Content:
`
Course Schedule
Credit: 3 Units

Time Frame Topics/Readings Activities


Week 1 I. Orientation
 Vision, Mission and Principles of Osmeña Colleges
 Objectives of the Computer Science Department
 Distribution of Syllabi
 Rules and Regulations of the course
 Grading System
Week 2 II. Introduction to computers Exercise 1: Converting Base to
III. What is a computer? Another Base
 Characteristics of Computers
 Basic Applications of Computer
IV. Components of Computer System
 Central Processing Unit(CPU)
 VDU, Keyboard and Mouse
 Other input/output Devices
 Computer Memory
 Concepts of Hardware and Software

2
Week 3 V. Classification of Computers Exercise 2
VI. Representation of data/Information concepts of data Exercise 3
processing
 Definition of Information and data
 Basic data types
 Storage of data/Information as files
Week 4  Propositional Equivalences Exercise 4
 Predicates and Quantifiers Exercise 5
Week 5 PRELIMINARY EXAMINATION
Week 6 VII. Basic Structures: Sets, Functions, Sequences, Sums & Exercise 7
Matrices
 Sets
 Set Operations
Week 7  Functions Exercise 8
 Sequences and Summation
Week 8 Exercise 9
 Cardinality of Sets
 Matrices

Week 9 VIII. Number Theory and Cryptography Exercise 10


 Divisibility and Modular Arithmetic
 Integer Representations and Algorithms
 Primes and Greatest Common Divisors
Week 10 MIDTERM EXAMINATION
Week 11  Solving Congruences Exercise 11
 Applications of Congruences
 Cryptography
Week 12 IX. Induction and Recursion Exercise 12
 Mathematical Induction
 Strong Induction and Well-Ordering
 Recursive Definitions and Structural Induction
 Recursive Algorithms
 Program Correctness

Week 13 X. Counting Exercise 13


 The Basics of Counting
 The Pigeonhole Principle
 Permutations and Combinations
 Binomial Coefficients and Identities
 Generalized Permutations and Combinations
 Generalized Permutations and Combinations
Week 14 XI. Discrete Probability Exercise 14
 An Introduction to Discrete Probability
 Probability Theory
 Bayes’ Theorem
 Expected Value and Variance

Week 15 PRE–FINAL EXAMINATION


Week 16 XII. Relations Exercise 15
 Relations and Their Properties
 n-ary Relations and Their Applications

3
 Representing Relations

Week 17  Closures of Relations Exercise 16
 Equivalence Relations
 Partial Orderings

Week 18 XIII. Graphs Exercise 17
 Graphs and Graphs Models
 Graph Terminology and Special Types of Graphs
 Representing Graphs and Graph Isomorphism
Week 19  Connectivity Exercise 18
XIV. Trees
 Introduction to Trees
 Application of Trees
Week 20  Tree Traversal Exercise 19
 Spanning Trees
 Minimum Spanning Trees
Week 21 FINAL EXAMINATION

VI. Course Requirements


 Attendance
 Quizzes
 Recitation
 Periodic Examination
 Laboratory Work

VII. Grading System

Attendance - 15%
Quizzes/Assign - 15%
Class Participation- 30%
Project - 10%
Examination - 30%
100%

EQUIVALENTS COMPUTATION OF FINAL GRADE

1.0 - 99-100 Prelim - 25%


1.25 - 96-98 Midterm - 25%
1.5 - 93-95 Pre-Final - 25%
1.75 - 90-92 Final - 25%
2.0 - 87-89 100%
2.25 - 84-86
2.5 - 81-83
2.75 - 78-80
3.0 - 75-77
5.0 - Fail

4
VIII. Course Reading Materials
A. CS104 Discrete Structures Manual
B. Required Text:
Discrete Mathematics and Its Applications, 7th Edition
Kenneth H. Rosen

C. Other Material Resources:


YouTube – Discrete Math 1 by TheTrevTutor
IX. Rules of Conduct/ School Policies
(Stated in the Student’s Handbook)

Prepared by: Noted by:

Jessica R. Anave
Instructor
May 4, 2018
Engr. VIOLETA B. MONTICALVO, Ed. D.
DEAN, CS-IT Department

Approved:

WILFREDO M. PELIÑO
President

You might also like