NORZAGARAY COLLEGE

Municipal Compound, Brgy.

Poblacion Norzagaray, Bulacan

COLLEGE OF COMPUTING STUDIES

2nd Semester A.Y. 2023-2024

SYLLABUS IN DS 101

DISCRETE STRUCTURE

NORZAGARAY COLLEGE

VISION
Norzagaray College envisions itself to transform lives of individuals and communities through life-long learning.

MISSION
As an Institution of Higher Education, we commit ourselves to:
1. Produce local and global competitive professionals through quality, accessible and affordable education.
2. Develop the intellectual, physical, social, spiritual, cultural and career potential of the individual capable of meeting the needs of industry, public service and
civil society.
3. Provide innovative educational environment, opportunities and experiences that enable individuals and communities to grow, thrive and prosper.

COLLEGE OF COMPUTING STUDIES VISION AND MISSION

VISION
To be recognized nationally and internationally as a benchmark for excellence, innovation, integrity, and distinctiveness in bachelor's level education taught from
global perspective.

MISSION
To provide the Computer Science students with a solid, technical foundation that enables them to be globally competitive professionals

1
Course Code DS 101

Course Name Discrete Structure

Course Credits 3 units

Course Description This course is to understand and use (abstract) discrete structures that are backbones of computer science. In particular, this class
is meant to introduce logic, proofs, sets, relations, functions, counting, and probability, with an emphasis on applications in
computer science.

Contact Hours/Week 3 hrs.

Pre-requisite Math1-Mathematics in the Modern World, CSC1-Introduction to Computing

At the end of the course, the students should be able to:

1. Introduce concepts of mathematical logic for analyzing propositions and proving theorems.
2. Use sets for solving applied problems and use the properties of set operations algebraically.
Course Outcomes 3. Work with relations and investigate their properties.
4. Investigate functions as relations and their properties.
5. Introduce basic concepts

2
COURSE OUTLINE AND TIMEFRAME

WEEK Course Content/Subject Matter

1 Class Orientation

2 Sets

3 Functions

4/5 Recurrence Relations

6 PRELIMINARY EXAMINATION

7 Combinations and Permutations

8 Trees

9 Mathematical Statement

10/11 Propositional and Predicate Logic

12 MIDTERM EXAMINATION

13/14 Proofs

15 Inductions

16/17 Combinatorial Proofs

18 FINAL EXAMINATION

3
ALIGNMENT OF COURSE OUTCOMES WITH SUMMATIVE ASSESSMENT TASKS

Desired Learning Outcomes Summative Assessment Task Details

At the end of the course, the students should be able 1. Pre-Assessment 1. Pre-Assessment measures the prior
to: 2. Post-Assessment knowledge of the learners regarding the
1. Introduce concepts of mathematical logic for 3. Enrichment Activity lesson
analyzing propositions and proving theorems. 4. Major Examination every term 2. Post-assessment evaluates the learning of
2. Use sets for solving applied problems and use ● Preliminary each student after studying the lesson.
the properties of set operations algebraically.
● Midterm 3. Enrichment activities are additional tasks to
3. Work with relations and investigate their
● Final accomplish every after-learning task. Through
properties.
this, the instructor can evaluate the strengths
4. Investigate functions as relations and their
properties. and needs of the students.
5. Introduce basic concepts 4. Major examination every term will determine
the progress and successful attainment of
course objectives throughout the term.

4
LEARNING PLAN

Assessment of
Teaching and Learning Time
Desired Learning Outcomes Course Content / Subject Matter Learning Tasks Resource Materials
Activities (TLAs) Table
(ALTs)
At the end of the course, the students must NC VMGO’s and College of Interactive Discussion Pre-Assessment Student Handbook
be able to: Computing Studies Vision and Think-Pair-Share Task and Post
Mission, Assessment Task
Week 1
 Discuss Introduction to Discrete Grading System, Enrichment Activity Discrete Mathematics:
Structures Classroom Rules and Regulations An Open Introduction
by Oscar Levin, 2018
 Define what is a set Introduction to Set Problem-Based Learning Pre-Assessment Discrete Mathematics:
Brainstorming Task and Post An Open Introduction
 Discuss Special Sets and Set Discussions Assessment Task by Oscar Levin, 2018
Theory Notation Collaborative Teaching Enrichment Activity
Pen-and-Paper Test Richard, Johnsonbaugh
 Identify relationship between sets (2000) Discrete
Mathematics, Prentice
Week 2
 Discuss Venn Diagram Venn Diagram Hall

https://courses
lumenlearning.com/

https://the-learning-
machine.com
 Discuss what is functions Functions Problem-Based Learning Pre-Assessment Discrete Mathematics: Week 3
Brainstorming Task and Post An Open Introduction
 Knowing rule that assigns each Discussions Assessment Task by Oscar Levin, 2018
input exactly one output Collaborative Teaching Enrichment Activity
Pen-and-Paper Test Richard, Johnsonbaugh
 Investigating special properties (2000) Discrete
functions might or might not Mathematics, Prentice
possess Hall

5
 Solving Recurrence Relations Recurrence Relation Problem-Based Learning Pre-Assessment Discrete Mathematics:
Brainstorming Task and Post An Open Introduction
Discussions Assessment Task by Oscar Levin, 2018
 Recall the recurrence relation is a Collaborative Teaching Enrichment Activity
recursive definition without the Pen-and-Paper Test Silberschatz, A. et al.
initial conditions. Operating System Week 4-
Principles, John Wiley 5
and Sons (Asia) PTE
LTD, 2006

https://the-learning-
machine.com/
PRELIMINARY EXAMINATION
Week 6
 Discuss permutation and possible Combinations and Permutations Problem-Based Learning Pre-Assessment Discrete Mathematics:
rearrangement of objects. Brainstorming Task and Post An Open Introduction
Discussions Assessment Task by Oscar Levin, 2018
Collaborative Teaching Enrichment Activity
Pen-and-Paper Test Richard, Johnsonbaugh
(2000) Discrete Week 7
Mathematics, Prentice
Hall

https://
www.tutorialspoint.com/
 Understand the language of graphs VIII. Problem-Based Learning Pre-Assessment Discrete Mathematics: Week 8
and trees. Trees Brainstorming Task and Post An Open Introduction
Discussions Assessment Task by Oscar Levin, 2018
 Understand the use of graphs as Collaborative Teaching Enrichment Activity
models. Pen-and-Paper Test https://
home.cs.colorado.edu/
 Understand various types of trees ~srirams/courses/
csci2824-spr14/trees-
6
 and methods for traversing trees 31.html?
fbclid=IwAR1tFZqJa2zf
dbR01JoPFXdI6bBTiG3
2DL_m2yqEew1U6YS4
hlPkShffI-E
 Differentiate Atomic and Mathematical Statement Problem-Based Learning Pre-Assessment Discrete Mathematics:
Molecular Statements Brainstorming Task and Post An Open Introduction
Discussions Assessment Task by Oscar Levin, 2018
Collaborative Teaching Enrichment Activity
 Discuss logical connectives, binary Pen-and-Paper Test Practical Design of Week 9
connectives and unary connectives Digital Circuits
Basic Logic to
Microprocessors
By Ian Kampel , 2015
 Discuss Propositional logic and Propositional and Predicate Logic Problem-Based Learning Pre-Assessment Discrete Mathematics:
truth tables Brainstorming Task and Post An Open Introduction
Discussions Assessment Task by Oscar Levin, 2018
 Understand Logical Equivalence Collaborative Teaching Enrichment Activity
and tautology Pen-and-Paper Test Richard, Johnsonbaugh
Week
(2000) Discrete
10-11
Mathematics, Prentice
Hall

https://
www.tutorialspoint.com
MIDTERM EXAMINATION
Week 12
 Discuss direct proof Proofs Problem-Based Learning Pre-Assessment Discrete Mathematics: Week
Brainstorming Task and Post An Open Introduction 13/14
 Differentiate Proof by Discussions Assessment Task by Oscar Levin, 2018
contrapositive, contradiction, Collaborative Teaching Enrichment Activity
example and by cases Pen-and-Paper Test Richard, Johnsonbaugh
(2000) Discrete

7
 Mathematics, Prentice
Hall
 Understand style of argument and Inductions Problem-Based Learning Pre-Assessment Discrete Mathematics:
proof technique Brainstorming Task and Post An Open Introduction
Discussions Assessment Task by Oscar Levin, 2018
 Discuss general structure of a Collaborative Teaching Enrichment Activity
proof by mathematical induction Pen-and-Paper Test Richard, Johnsonbaugh
Week
(2000) Discrete
15
Mathematics, Prentice
Hall

https://
www.tutorialspoint.com/
 Understand combinational proofs Combinatorial Proofs Problem-Based Learning Pre-Assessment Discrete Mathematics:
and learn more about combinatorial Brainstorming Task and Post An Open Introduction
proofs Discussions Assessment Task by Oscar Levin, 2018
 Discuss patterns in Pascal's
Collaborative Teaching
Pen-and-Paper Test
Enrichment Activity
Richard, Johnsonbaugh
Triangle Week
(2000) Discrete
16-17
Mathematics, Prentice
Hall

https://
www.tutorialspoint.com/

8
Course Class Participation
Requirements Pre-Assesment
Post Assessment
Major Exam
Grading System Prelim Midterm Finals Final Grade

Attendance 10% Attendance 10% Attendance 10% Prelim Grade+ Midterm Grade+ Finals Grade
Pre-Assessment 10% Pre-Assessment 10% Pre-Assessment 10% 3
Post-Assessment 30% Post-Assessment 50% Post-Assessment 50%
Enrichment Activity 20% Enrichment Activity 20% Enrichment Activity 20% = FINAL GRADE
Major Exam 30% Major Exam 30% Major Exam 30%
100% 100% 100%
Classroom Policies Since there will be a face-to-face approach this semester, completing all the requirements will make up a huge component of your rating. That
mentioned the students are expected to
1. submit assessments, enrichment activities, and major examinations in a timely manner
2. do the activities were asked to do, ask questions, and collaborate during class time
● practice utmost integrity at all times by
● standing up for what’s right, even in the face of difficulty
● achieving success fairly, without cheating
● not lying, stealing, bullying, or tolerating those who do
● acting consistently with what I say and believe
3. constantly practice the Norzagaray College core values of
● Professionalism
● Responsibility
● Integrity
● Diversity
● Excellence
Other References https://web.stanford.edu/class/cs103x/cs103x-notes.pdf
http://discrete.openmathbooks.org/pdfs/dmoi-tablet.pdf
https://home.iitk.ac.in/~arlal/book/mth202.pdf

Prepared by: Noted by: Approved by:

JESSIE JAMES A. VILLARAMA MINDALITA O. CRUZ, DIT MA. LIBERTY DG. PASCUAL, Ph.D
Subject Instructor Dean, College of Computing Studies College President
9
10