Scribd
Upload
3K views17 pages

CMSC 56 Course Outline

This document provides an overview of the CMSC 56 - Discrete Mathematical Structures in Computer Science I course. The course covers principles of logic, set theory, relations, Boolean algebra, and linear algebra. It includes both lectures and labs. Lectures cover topics like propositional logic, predicate logic, set theory, relations, Boolean algebra, and linear algebra. Students will be evaluated based on long exams, quizzes, and lab exercises. The final exam counts for 20% of the final grade. The course is taught by three instructors and additional course policies and resources are provided.

Uploaded by

CK Luna
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
3K views17 pages

CMSC 56 Course Outline

This document provides an overview of the CMSC 56 - Discrete Mathematical Structures in Computer Science I course. The course covers principles of logic, set theory, relations, Boolean algebra, and linear algebra. It includes both lectures and labs. Lectures cover topics like propositional logic, predicate logic, set theory, relations, Boolean algebra, and linear algebra. Students will be evaluated based on long exams, quizzes, and lab exercises. The final exam counts for 20% of the final grade. The course is taught by three instructors and additional course policies and resources are provided.

Uploaded by

CK Luna
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 17

CMSC 56

Discrete Mathematical Structures in Computer Science I

Course Description
Principles of logic, set theory, relations and functions, Boolean algebra and linear algebra. Prerequisite: MATH 17 Credit: 3 units

Lecture: 7 hours per week Lab: 10 hours and 30 minutes per week

Lecture Outline

Logic
Propositional Logic
Propositions and Logical Connectives Syntax and Semantics of Propositional Logic Rules of Inference Laws of Equivalence Methods of Proof
Truth Tables Chain of Equivalence Chain of Reasoning Proof by Contradiction Proof by Resolution

Lecture Outline
Predicate Logic
Introduction Basic Terms and Concepts
Open Propositions Quantifiers

Syntax and Semantics Translating of English Statements Inference Rules / Laws of Equivalence Methods of Proof
Chain of Reasoning Proof by Resolution

Lecture Outline

Set Theory
Sets Set Membership and Set Containment Set Operations Venn Diagrams Laws of Set Theory Proving in Set Theory
Venn Diagrams Membership Table Algebraic Method Element Arguments

Lecture Outline

Relations
Cartesian Product and Relations Properties of Relations
Equivalence Relations Ordering Relations

Operations on Relations Hasse Diagrams and Directed Graphs Functions The Principle of Mathematical Induction The Pigeonhole Principle

Lecture Outline

Boolean Algebra
Boolean Operations Laws and Identities of Boolean Algebra Simplifying Boolean Expressions Switching Algebra
Logic Gates Designing Logic Circuits

Lecture Outline

Linear Algebra
Matrix Notation Special Matrices Matrix Operations
Matrix Addition Matrix Multiplication Scalar Multiplication Transpose of a Matrix

Inverse of a Matrix The Determinant of a Matrix Linear Systems and Solutions to Equations

Grading Policies

Pre-Final Standing
Long Exams Quizzes Lab Exercises

80%
60% 20% 20%

Final Exam

20% 100%

Grading Scale

Passing Grade: 60%


Range 95-100 90-94 85-89 80-84 76-79 72-75 68-71 64-67 60-63 Below 60 Grade 1.00 1.25 1.50 1.75 2.00 2.25 2.50 2.75 3.00 5.00

Instructors

Katrina Joy H. Magno


Room C-117 [email protected] Consultation Hours
TWTh 10:00 12:00nn WTh 2:00 4:00pm

Instructors

Lailanie R. Danila
Room C-117 [email protected] Consultation Hours
Inquire at laboratory class

Instructors

Caroline Natalie M. Peralta


Room C-117 [email protected] Consultation Hours
TWTh 9:00am 12:00nn T 1:00 2:00pm

Course Policies

Long Exams
Will be held within class hours Excused missed exam: Required to take final exam; score in final exam will replace missed exam. Unexcused missed exam: Will be given a grade of 0.

Course Policies

Quizzes
Excused Missed Quizzes: Dropped from students grade. Unexcused Missed Quizzes: Zero for missed quiz.

Course Policies

Final Exam
NO EXEMPTION. Retain or Increase
The higher grade (with final exam or without final exam) will be considered as the final grade.

Course Policies

courses.uplb.edu.ph
CMSC 56-Discrete Mathematical Structures in Computer Science I Lecture and/or laboratory handouts Announcements Questions pertaining to the course

You might also like