![Transmutation from Actual Grade
AG - AG = TG
0 - 4 = 65
5 - 9 = 66
10 - 14 = 67
15 - 19 = 68
20 - 24 = 69
25 - 29 = 70
30 - 34 = 71
35 - 39 = 72
40 - 44 = 73
45 - 49 = 74
50 - 50 = 75
51 - 52 = 76
53 - 54 = 77
55 - 56 = 78
57 - 57 = 79
59 - 60 = 80
61 - 62 = 81
63 - 64 = 82
65 - 66 = 83
67 - 68 = 84
69 - 70 = 85
Transmutation from Actual Grade
AG - AG = TG
71 - 72 = 86
73 - 74 = 87
75 - 76 = 88
77 - 78 = 89
79 - 80 = 90
81 - 82 = 91
83 - 84 = 92
85 - 86 = 93
87 - 88 = 94
89 - 90 = 95
91 - 92 = 96
93 - 94 = 97
95 - 96 = 98
97 - 98 = 99
99 - 100 = 100
Notes:
• Passing Score in all Examinations is Fifty Percent (50%)
• A candidate for Cum Laude must obtain a weighted average grade
ranging from [1.50 to 1.75], with no grade below 2.0
• A candidate for Magna Cum Laude must obtain a weighted average grade
ranging from [1.25 to 1.49], with no grade below 1.75
• A candidate for Summa Cum Laude must obtain a weighted average
grade ranging from [1.0 to 1.24], with no grade below 1.50
• A student who obtains a grade of 4.0 in any of the subjects during the
Trinal and during the Midterm Exams, the teacher concern may give a re-
examination/requirement.
Numerical Equivalent Grade Interval 1.0 97 – 100
1.25 94 – 96
1.50 91 – 93
1.75 88 – 90
2.0 85 – 87
2.25 82 – 84
2.50 79 – 81
2.75 76 – 78
3.0 75
5.0 68 – 74 (Failure)
XVII. TRANSMUTATION TABLE FROM THE ACTUAL GRADE](https://image.slidesharecdn.com/it102discretemathematics-240611064745-83da4b15/75/ITT-102-Discrete-Mathematics-Mathematics-2-2048.jpg)
Uploaded byNotre Dame of Midsayap College
ITT 102 Discrete Mathematics Mathematics
The document is a syllabus for a Discrete Mathematics course (IT 102), covering topics like logic, sets, proofs, algorithms, and graph theory over 54 hours of instruction. It outlines course requirements, grading criteria, and evaluation methods, including quizzes, assignments, and examinations, along with corresponding weightings for grades. It also provides a detailed course outline for trimesters, midterms, and finals, including associated teaching and learning activities.
More Related Content
Similar to ITT 102 Discrete Mathematics Mathematics
ITT 102 Discrete Mathematics Mathematics
- 1. COURSE SYLLABUS inDiscrete Mathematics XIII. Course Number: IT 102 XIV. Course Title: Discrete Mathematics XV. Course Description: This course deals with logic, sets, proofs, growth of functions, theory of numbers, counting techniques, trees and graph theory. XVI. Number of Units: 3 units XVII. Number of Hours: 54 hours XVIII. Pre-requisite Subject: None XIX. Course Requirements: 1. Schoology account / ClassIn account 2. Quizzes and assignments 3. Officially scheduled examination 4. Research through the internet 5. Presentation of the problems/projects 6. Portfolio – compilation of all exercise case studies, seatworks
- 2. Transmutation from ActualGrade AG - AG = TG 0 - 4 = 65 5 - 9 = 66 10 - 14 = 67 15 - 19 = 68 20 - 24 = 69 25 - 29 = 70 30 - 34 = 71 35 - 39 = 72 40 - 44 = 73 45 - 49 = 74 50 - 50 = 75 51 - 52 = 76 53 - 54 = 77 55 - 56 = 78 57 - 57 = 79 59 - 60 = 80 61 - 62 = 81 63 - 64 = 82 65 - 66 = 83 67 - 68 = 84 69 - 70 = 85 Transmutation from Actual Grade AG - AG = TG 71 - 72 = 86 73 - 74 = 87 75 - 76 = 88 77 - 78 = 89 79 - 80 = 90 81 - 82 = 91 83 - 84 = 92 85 - 86 = 93 87 - 88 = 94 89 - 90 = 95 91 - 92 = 96 93 - 94 = 97 95 - 96 = 98 97 - 98 = 99 99 - 100 = 100 Notes: • Passing Score in all Examinations is Fifty Percent (50%) • A candidate for Cum Laude must obtain a weighted average grade ranging from [1.50 to 1.75], with no grade below 2.0 • A candidate for Magna Cum Laude must obtain a weighted average grade ranging from [1.25 to 1.49], with no grade below 1.75 • A candidate for Summa Cum Laude must obtain a weighted average grade ranging from [1.0 to 1.24], with no grade below 1.50 • A student who obtains a grade of 4.0 in any of the subjects during the Trinal and during the Midterm Exams, the teacher concern may give a re- examination/requirement. Numerical Equivalent Grade Interval 1.0 97 – 100 1.25 94 – 96 1.50 91 – 93 1.75 88 – 90 2.0 85 – 87 2.25 82 – 84 2.50 79 – 81 2.75 76 – 78 3.0 75 5.0 68 – 74 (Failure) XVII. TRANSMUTATION TABLE FROM THE ACTUAL GRADE
- 3. XVIII. Course Outlineand Time Frame Weeks Course Content/Topics Trinal (Weeks 1-6) Week 1 Week 2 Week 3 - 4 Week 5 Week 6 Orientation Logic, sets, and functions Systems Algorithms, the integers, and matrices Mathematical reasoning Trinal Examination Midterm (Weeks 7-12) Week 7 - 9 Weeks 10-11 Week 12 Counting Relations Midterm Examination Finals (Weeks 13-18) Weeks 13 - 14 Week 15 - 16 Week 17 Week 18 Graphs Trees Boolean algebra Final Examination
- 4. XIX. Course LearningPlan DESIRED LEARNING OUTCOMES (DLO) TIME FRAME COURSE CONTENT/TOPICS TEACHING & LEARNING ACTIVITIES (TLAs) ASSESSMENT TASK/S LEARNING RESOURCES VALUES INFUSED (Core Values) GRADING CRITERIA * Discuss of the school policies, grading system, topic outline, and orientation, etc.) Week 1 I. Orientation 1. School Policies and Guidelines 2. Classroom Protocols and laboratory rules 3. Course Outline 4. Grading System 5. Course Expectations *Reading of School and laboratory Policies and Guidelines. Recitation Reflection Student Handbook Driven by Faith Agility Respect Excellence Service Rubrics for recitation * Identify Logic Sets and Functions. Week 1 - Week 2 II. Logic, sets, and functions 1. Logic 2. Propositional equivalences 3. Predicates and quantifiers 4. Sets and set operations 5. Functions *Small group Discussion *Lecture videos Reporting Quiz - Seatwork Assignment PPT/PDF Hand-outs Websites Asynchronous (Schoology) Synchronous (Zoom/ Classin) Honesty Cooperation Respect Independence Objectivity Critical Thinking Rubrics for reporting Checklist for assignment * Explain the algorithms and their complexity, the integers, and matrices Week 3 – Week 4 III. Algorithms, the integers, and matrices 1. Algorithms and their complexity 2. The integers and division 3. Integers and algorithms 4. Applications of number theory 5. Matrices *Small group Discussion *Lecture videos Reporting Quiz - Seatwork Assignment PPT/PDF Hand-outs Websites Asynchronous (Schoology) Synchronous (Zoom/ Classin) Honesty Cooperation Respect Independence Objectivity Critical Thinking Rubrics for reporting Checklist for assignment
- 5. DESIRED LEARNING OUTCOMES (DLO) TIME FRAME COURSECONTENT/TOPICS TEACHING & LEARNING ACTIVITIES (TLAs) ASSESSMENT TASK/S LEARNING RESOURCES VALUES INFUSED (Core Values) GRADING CRITERIA * Explain mathematical reasoning techniques including induction and recursion. Week 5 – Week 6 IV. Mathematical reasoning 1. Methods of proof 2. Mathematical induction 3. Recursive algorithms 4. Program correctness *Small group Discussion *Lecture videos Reporting Quiz - Seatwork Assignment PPT/PDF Hand-outs Websites Asynchronous (Schoology) Synchronous (Zoom/ Classin) Honesty Cooperation Respect Independence Objectivity Critical Thinking Rubrics for reporting Checklist for assignment Week 6 TRINAL EXAMINATION, QUIZZES, REQUIREMENTS * Apply counting techniques to the representation and characterization of relational concepts. Week 7 - Week 9 VI. Counting 1. The pigeonhole principle 2. Permutations and combinations 3. Discrete probability 4. Probability theory 5. Generalized permutations and combinations 6. Recurrence relations 7. Generating functions *Small group Discussion *Lecture videos Reporting Quiz - Seatwork Assignment PPT/PDF Hand-outs Websites Asynchronous (Schoology) Synchronous (Zoom/ Classin) Honesty Cooperation Respect Independence Objectivity Critical Thinking Rubrics for reporting Checklist for assignment * Explain Relations and their properties and their applications Week 10 - Week 11 VII. Relations 1. Relations and their properties 2. N-ary relations and their applications 3. Representing relations 4. Closures of relations 5. Equivalence relations 6. Partial orderings *Small group Discussion *Lecture videos Reporting Quiz - Seatwork Assignment PPT/PDF Hand-outs Websites Asynchronous (Schoology) Synchronous (Zoom/ Classin) Honesty Cooperation Respect Independence Objectivity Critical Thinking Rubrics for reporting Checklist for assignment Week 12 MIDTERM EXAMINATION, QUIZZES, REQUIREMENTS
- 6. * Illustrate graphsto solve problems. Week 13 - Week 14 VIII. Graphs 1. Graph terminology 2. Representing graphs and graph isomorphism 3. Connectivity 4. Euler and Hamilton paths 5. Shortest path problems 6. Planar graphs 7. Graph coloring *Small group Discussion *Lecture videos Reporting Quiz - Seatwork Assignment PPT/PDF Hand-outs Websites Asynchronous (Schoology) Synchronous (Zoom/ Classin) Honesty Cooperation Respect Independence Objectivity Critical Thinking Rubrics for reporting Checklist for assignment * Illustrate trees to solve problems. Week 15 - Week 16 IX. Trees 1. Introduction to trees 2. Applications of trees 3. Tree traversal 4. Trees and sorting 5. Spanning trees 6. Minimum spanning trees *Small group Discussion *Lecture videos Reporting Quiz - Seatwork Assignment PPT/PDF Hand-outs Websites Asynchronous (Schoology) Synchronous (Zoom/ Classin) Honesty Cooperation Respect Independence Objectivity Critical Thinking Rubrics for reporting Checklist for assignment DESIRED LEARNING OUTCOMES (DLO) TIME FRAME COURSE CONTENT/TOPICS TEACHING & LEARNING ACTIVITIES (TLAs) ASSESSMENT TASK/S LEARNING RESOURCES VALUES INFUSED (Core Values) GRADING CRITERIA * Understand and apply Boolean algebra. Week 17 X. Boolean algebra 1. Boolean functions 2. Representing Boolean functions 3. Logic gates 4. Minimization of circuits *Small group Discussion *Lecture videos Reporting Quiz - Seatwork Assignment PPT/PDF Hand-outs Websites Asynchronous (Schoology) Synchronous (Zoom/ Classin) Honesty Cooperation Respect Independence Objectivity Critical Thinking Rubrics for reporting Checklist for assignment Week 18 FINAL EXAMINATION, QUIZZES, REQUIREMENTS
- 7. XX. Suggested Readingsand References: Rosen, K. H. (2018) Discrete Mathematics. McGraw-Hill.ISBN 0-07-289905-0. Hall, C., & O’Donnell J. (2016) Discrete Mathematics Using a Computer, Springer Verlag ISBN 1-85-233089-9. Online Reference and Journals https://www.scirp.org/journal/ojdm https://link.springer.com/journal/40993