CS 101-Discrete Structures I
CS 101-Discrete Structures I
CS 101-DISCRETE STRUCTURES I
Essential Learning
Teaching Assessment
Time Course Declarative Functional Integrated Learning Learning Values Assessment Tools
Frame Standards Knowledge Knowledge Outcomes (ILO) Activities Integrated Tasks
(TLA)
Prelim Set Operations Set Operations Attentive Students must be able to: - Discussion - Obedience - Quiz Test
The Union of the listening and - Research - Respect - Assignment Questionnaire
Truth tables Sets - Learn Set Operations
practice in paper - Activity - Discipline - Self-
The Intersection - Learn the concepts of logic Module
diagram - Oral - Resourcefulness Assessment
of the Sets gates.
Recitation - Critical and - Exam
The Venn - Learn to use truth table
- Quizzes Logical - Module
Diagram - Learn the concepts of
- Solving Thinking
The Empty Sets proposition
- Dedication
The disjoint Sets
- Perseverance
Operation
Universal Sets
Operations
Introduction lo
logic gates
Propositional
calculus (or
logic)
The proposition
and not
proposition
Logical
connectives
The exclusive or
Implications and
Biconditional
Truth Table
Semi-Final Computer Computer Attentive - Learn the concept of -Discussion - Obedience - Quiz Test
Number System Architecture listening and Computer architecture - Respect - Assignment Questionnaire
-Research
number systems practice in paper number systems - Discipline - Self-
Module
The Binary problem -Activity - Resourcefulness Assessment
conversion conversion - Critical and - Exam
Binary to Octal solving -Oral - Logical
Recitation Module
Binary to Decimal Thinking
Binary to -Quizzes - Dedication
Hexadecimal
Perseverance
Octal to Binary
Decimal to Binary -Solving
Hexadecimal to
Binary
- Obedience
- Discussion
Introduction to logic - Respect
- Research - Quiz
gates - Discipline
Attentive -Learn the concept of Digital - Activity - Assignment
Truth Tables - Resourcefulness Test
Logic Gates listening and logic gates. - Oral - Self-
Final Digital Logic Gates - Critical and Questionnaire
Equations practice in paper -Learn to solve the logic Recitation Logical
Assessment
Logic Gates - Quizzes - Exam Module
diagram equations Thinking
Equations and Input - Solving
and Output - Dedication Module
Perseverance
B. Grading System Components
Project 10%
Quizzes Cooperative Learning Activities 20%
Major Examination 50%
Activities/Attendance/Online Class Participation 20%
Level of
Program Outcomes Student Outcomes (SO) Core Values Performance Indicators
Emphasis
References Walter Savitch (2004). Java, An Introduction to Computer Science & Programming, 3rd ed.