Archdiocese of Tuguegarao

LYCEUM OF APARRI
The College of Information and
Aparri, Cagayan Computing Sciences
BS Computer Science (Level 3 Accredited)
BS Information Technology

Syllabus on
CS 212- DISCRETE STRUCTURES -2
FIRST SEMESTER A.Y 2023-2024
College Of Information and Computing Sciences

VISION: We produce leaders for the church and society , whose lives are rooted in the person and message of Jesus Christ , and are
attuned to the mind of the church in faith and morals.
MISSION: To provide in education the culture of excellence , expertise, and extension nourished by the encounter and experience of
Jesus ‘ Person and inspired by the example of witnesses who faithfully live out his message.

Program Educational Outcome:

As statement of the career and professional accomplishment in which the college of Information and computing Science s is preparing
its graduate to achieve the program educational outcome are adopted
a. To prepare students to be IT professionals and researchers and to be proficient in designing and developing computing solutions
b. To become a responsible Christian professional and global citizens, who are aware of ethical issues and societal needs and problems
inherent in the computing fields
c. To produce qualified and well-rounded computer professionals who can develop system supportive of the information needs of
industry and government using computer data processing system

Course: Code: CS 212 Course Title: DISCRETE STRUCTURE 2

Credit Units: 3 Lecture Units: 3 Laboratory: 0
 Time LEARNING OUTCOMES CONTENT TEACHING ASSESSMENT TASK
Frame STRATEGIES

Prelims The students will able to; 1. Orient the 1. Lecture/Discussion Know and practice the vision-
1. State the vision- following: with power mission of the school.
mission of the -Vision
institution -Mission 2. Question and
2. Identify the -Objectives Answer
characteristics of Demonstrate an
-Goals
Christian leader, 3. Demonstration understanding and could be
-And Philosophy able to formulate solution on
differentiate the
vision – mission of 2. Sets theoretical background of
the school. -Set Relations sets and take a look at
4. Brain Storming
3. Understand and - Set Functions associated definitions,
define sets, - Set Notation and notations, relations, and
5. Hands-on
operations on sets, Relations functions
Execrices
and state important - Basic Set
set properties Operations
4. Identify sets into - Cartesian
their various types Products and
(such as singleton, Power Sets
finite, infinite, equal, - Summation
null, proper subset, Notation and
and improper Generalizations
subset) and give a
definition of each
5. Describe set
notation and how
that notation is used
 to perform
operations via
symbol
manipulation
6. Apply set
definitions,
operations, and
properties to
demonstrate set
membership within
a specific context.

Midterm 1. Understand and 3. Counting Theory 1. Lecture/Discussion Solve the number of

s describe counting, - Rule of Products with power permutations and
permutation, and - Introduction to combinations of the
combination the Rule of 2. Question and members of a given set.
rules;Perform ProductsPage Answer
Parallel 4. Permutations
Programming in the - Ordering 3. Demonstration
cloud computing Elements of a
through android SetPage 4. Hands on
cellphones 5. Partitions of Sets Exercises
2. Demonstrate an and the Law of
understanding how Addition 5. Seatwork
to compute the - Partitions and
number of Addition
permutations and LawsPage
combinations of the 6. Combinations
members of a given and the Binomial Know how to use
set. Theorem programmed by using binary,
3. Determine the - Combinations gate-level logic, machine
number of all and the Binomial code, or ladder logic.
possible outcomes TheoremPage
of a collection of 6.1.
events. Mathematical
 4. Describe declarative Logic
statements in math - Propositions and
that have 100% Logical Operators
"true" or 100% - Propositional
"false" values. LogicPage
5. Classify sequences - Propositions and
of logical Logical
statements as OperatorsPage
yielding true or false 6.2. Truth Tables
conclusions, given and Propositions
the sequence of Generated by a
statements and the Set
values of individual - Logic
statement NotationPage
parameters - Truth Tables and
(arguments). Propositions
6. Create a logic Generated by a
equation based on SetPage
the natural- - Equivalence and
language statement Implication
of a problem - The Laws of Logic
7. Solve a logical
expressions of
multiple variables
assigned values
according to a given
circumstance.

Semi 1. Discuss how one 7.Mathematical 1. Lecture/Discussion Demonstrate an

Finals conclusion leads to Induction and with power understanding on methods
another, in the Proofs behind mathematical
mathematical sense, - Mathematical 2. Question and Answer systems and proofs.
for a given situation Systems
2. Write the terms of a - Mathematical 3. Demonstration
 logical sequence as SystemsPage
a generalized - Direct Proof
formula. - Indirect Proof 4. Hands-on Activities Solve the probability of
3. Know the use of independent events and how
mathematical 7.1. Probability 5. Seatwork it works.
induction to prove - Introduction to
the validity of logical Discrete
sequences. ProbabilityPage
4. Create an inductive - Sample Spaces,
reasoning to Events, and Their
situations where Probabilities.
there is sufficient - Complements,
evidence to warrant Intersections, and
generalization. Unions
5. Know the definitions -Conditional
of terms that apply Probability and
to probability within Independent Events
the context of this
course.
6. Solve and calculate
conditional
probabilities
7. Explain and
compute the
probability of
independent events.
8. Know how to
estimate the chance
of occurrence of a
specific event within
a collection of
events.
 Finals 1. Demonstrate an 8-Finite-State 1. Lecture/Discussion Create a discrete-state
understanding on Automata with power systems through the use of
the use of abstract programming language.
machines that can 2. Question and Answer
-Finite-State Machine
be in exactly one of
a finite number of Overview Page 3. Demonstration
states at any given - State Transition
time; Diagrams
2. Analyze systems - Finite-State Machine 4. Hands on Exercises
that recognize input States
patterns, accepting - Putting the Basics to 5. Seatwork
or rejecting an input Use
depending on
whether a given
pattern occurs.
3. Create a discrete-
state systems and
predict how a given
system will enter
different states as
new data is input to
the system over
time.

Course Requirements:
 Major Exams
 Quizzes
 Attendance
 Research Output

Course Policy:

To pass the course, you need to pass all examinations and do all the requirements that will be given. The maximum number
of absences allowed is 9. The 9 hours absences will be applied both excused and non-excused absences. Three (3) tardiness
make one absences. If you missed an exam valid slip duly noted by the College Dean must be presented for absences not later
than the second class session following your return to the class. If no excused is presented, the missed exam will be marked as
zero. No make-up will be given for quizzes. Incomplete grade will be given only to those who have a passing standing but no
final exams.

Grading System (Cumulative)

Grading System (Cumulative)
Prelim Grade: 50%(CS) + 20%(AQ) + 30%(PE)
Midterm Grade: 50%(CS) + 20%(AQ) + 30%(PE)
Cumulative MG: (Prelim Grade (30%)+ 2 (Midterm Grade))(70%)/3
Semi Final Grade: 50%(CS) + 20%(AQ) + 30%(PE)
Cumulative SFG: (CMG + 2 (30%)+ (SFG Grade))(70%)/3

References:
Discrete Mathematics, 8th Edition by: Richard Johnsonbaugh( 2021)
Discrete Mathematics and Its Applications by: Kenneth Rosen (2023)
Essential Discrete Mathematics for Computer Science by: Harry Lewis and Rachel Zax (2023)
Discrete Mathematics: An Open Introduction - 3rd Edition Oscar Levin, (2016)
Finite Automata and Regular Expressions: Problems and Solutions Stefan Hollos (Author), J. Richard Hollos (Author)
Automata, Formal Languages, and Turing Machines by: Dr. Emre Sermutlu ( 2016)
Handbook of Mathematical Induction: Theory and Applications (Discrete Mathematics and Its Applications) 2019
David S. Gunderson
Logic: The Laws of Truth by: Logic: The Laws of Truth 2015
www.wikipedia.org
Course Outline

Wee TOPIC
k
1-4 Lyceum of Aparri’s vision-mission
College Objectives
Course requirements/course policies
Grading System
 Sets
-Set Relations
 - Set Functions
- Set Notation and Relations
- Basic Set Operations
- Cartesian Products and Power Sets
- Summation Notation and Generalizations
5-8 Counting Theory
- Rule of Products
- Introduction to the Rule of ProductsPage
Permutations
- Ordering Elements of a SetPage
Partitions of Sets and the Law of Addition
- Partitions and Addition LawsPage
Combinations and the Binomial Theorem
- Combinations and the Binomial TheoremPage
a. Mathematical Logic
- Propositions and Logical Operators
- Propositional LogicPage
- Propositions and Logical OperatorsPage
b. Truth Tables and Propositions Generated by a Set
- Logic NotationPage
- Truth Tables and Propositions Generated by a SetPage
- Equivalence and Implication
- The Laws of Logic

9-13 Mathematical Induction and Proofs

- Mathematical Systems
- Mathematical SystemsPage
- Direct Proof
- Indirect Proof

Probability
- Introduction to Discrete ProbabilityPage
- Sample Spaces, Events, and Their Probabilities.
- Complements, Intersections, and Unions
 -Conditional Probability and Independent Events

14-18 Finite-State Automata

-Finite-State Machine Overview Page

- State Transition Diagrams
- Finite-State Machine States
- Putting the Basics to Use

Course Mapping

College of Education graduates will be: Introduced Practiced Demonstrated

1. To prepare student to be IT professional and researchers, and to be X
proficient in designing and developing computing solutions.
2. To become a responsible, Christian professionals and global citizens, X
who are aware of ethical issues and societal needs and problems
inherent in the computing field.
3. To produce qualified and well-rounded computer professional who X
can develop systems supportive of the information needs of industry
and government using computer system.

Program Outcomes

Based on CMO No. 25 Series of 2015 Introduced Practice Demonstrated

d
Apply knowledge of computing fundamentals, knowledge of a x
computing specialization, and mathematics, science, and
domain knowledge appropriate for the computing specialization
to the abstraction and conceptualization of computing models
from defined problems and requirements.
Identify, analyze, formulate, research literature, and solve X
complex computing problems and requirements reaching
substantiated conclusions using fundamental principles of
mathematics, computing sciences, and relevant domain
disciplines.
An ability to apply mathematical foundations, algorithmic x
principles and computer science theory in the modeling and
design of computer - based systems in a way that demonstrates
comprehension of the tradeoffs involved in design choices.

Knowledge and understanding of information security issues in x

relation to the design, development and use information system.
Design and evaluate solutions for complex computing problems, x
and design and evaluate systems, components, or processes
that meet specified needs with appropriate consideration for
public health and safety, cultural, societal, and environmental
consideration.
Create, Select, Adapt and Apply appropriate techniques, X
resources and modern computing tools to complex computing
activities, with an understanding of the limitations to accomplish
a common goal.
Function effectively as an individual and as a member or leader X
in diverse teams and in multidisciplinary settings.
Communicate effectively with the computing community and X
with society at large about complex computing activities by
being able to comprehend and write effective reports, design
documentation, make effective presentations, and give and
understand clear instructions.
An ability to recognize the legal, social, ethical and professional X
issues involved in the utilization of computer technology and be
guided by the adoption appropriate professional, ethical and
legal practices.
Recognize the need, and have the ability, to engage in X
independent learning for continual development as a computing
professional.
Legend:
I – Introduced Concepts/Principles
P – Practiced with Supervision
D – Demonstrated across different technical and theoretical setting with minimal supervision

Prepared by: Charyann A. Gumarang Checked by: JENEL M.

SAMORTIN
Instructor OIC, CICS DEPARTMENT

Approved by: Dr. Evelyn Pascua, Ph.D., CESO III

President for Academics