Scribd
Upload
2K views4 pages

Discrete Structure 1 Ched Format

The document outlines the course syllabus for Discrete Structure 1, a required course for the Bachelor of Science in Computer Science program at the Dr. Aurelio Mendoza Memorial Colleges. The course introduces fundamental discrete mathematics concepts like logic, sets, functions, relations, and counting that are important foundations for computer science. Students will learn techniques for proofs and mathematical reasoning, as well as applications of discrete structures in areas like sequences, graphs, probability, and algorithms.

Uploaded by

Khimberly Xylem Ortiz
Copyright
© © All Rights Reserved
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
2K views4 pages

Discrete Structure 1 Ched Format

The document outlines the course syllabus for Discrete Structure 1, a required course for the Bachelor of Science in Computer Science program at the Dr. Aurelio Mendoza Memorial Colleges. The course introduces fundamental discrete mathematics concepts like logic, sets, functions, relations, and counting that are important foundations for computer science. Students will learn techniques for proofs and mathematical reasoning, as well as applications of discrete structures in areas like sequences, graphs, probability, and algorithms.

Uploaded by

Khimberly Xylem Ortiz
Copyright
© © All Rights Reserved
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/ 4

DR.

AURELIO MENDOZA MEMORIAL COLLEGES


Ipil, Zamboanga Sibugay

COLLEGE OF COMPUTER STUDIES

COURSE SYLLABUS

MISSION:
The Dr. Aurelio Mendoza Memorial Colleges which started as a mission school has, through the years, retained the legacy of its founding fathers. It advocates a
strong belief in a truly universal education guided by thy principles of existential philosophy that stresses man as a being for others, the value of humanity, and
the cultivation of authentic freedom and social responsibility. Its mission is carried by its curricular units, the elementary, secondary, and collegiate department.

VISION:
The Dr. Aurelio Mendoza Memorial Colleges vision-articulates the commitments as a leading institution in western Mindanao upholding the culture of excellence
and advocating a strong motivated education, guided by the principles of men that stress equality.

VALUES:
Excellence, genuine concern for people, love of country, integrity, faith and trust in God Almighty, team-work and sense of fulfillment.

IILO (INSTITUTIONAL INTENDED GRADUATE ATTRIBUTE)


Recognize and develop one’s creativity, capabilities and potentials to become efficient and productive members of society.
Inculcate sound and strong spiritual values and personal discipline.
Preserve and appreciate the country’s cultural heritage.

DEPARTMENT VISION:
We understand that economy, technology and demands change, thus, the primal focus of the department is adaptation. The progress of innovative and
pedagogical approaches and the development of newly adapted curriculum and pedagogy in response to the rapidly changing demands of computer profession
aim to accommodate diversity in learning. We endeavor to expand co-op opportunities for our students and explore additional ways to foster personal and
professional growth of standards.
DEPARTMENT MISSION:
The department strives to provide current, comprehensive and student-centered environment for teaching and learning of Computer Science preparing students
for professional career. We endeavor to promote discovery, dissemination and application of knowledge involving computers ensuing computer literacy and
profession as we believe technology will change the pace of our nation.

COURSE PROGRAM: BACHELOR OF SCIENCE IN COMPUTER SCIENCE


COURSE CODE: CCS103
COURSE TITLE: DISCRETE STRUCTURE 1
PRE-REQUISITES: CCS101
TYPE OF COURSE: Lecture
COURSE UNIT: 3.0
INSTRUCTOR:

COURSE DESCRIPTION:
The purpose of 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.

LEARNING OUTCOMES:
At the end of the course, students should be able to:
LO1: Perform the operations associated with sets. Functions and Relations and relate this operations to computer programming
LO2: Construct sound arguments in propositional and predicate logic by applying appropriate rules of inference given sample intelligent software
LO3: Construct valid mathematical proofs using mathematical induction, direct proof and proof by contradiction to simplify programs and prove programs
correctness
GRADING SYSTEM:

Attendance 10%
Quizzes 20%
Reporting 20%
Project 20%
4 Major Exams 30%
TOTAL 100%

LEARNING PLAN
LO TOPICS AND READINGS TIME FRAME LEARNING ACTIVITIES
LO1
Sets WEEK 1&2 • introduction of the course
• Discussion should include:
Functions and Relations WEEK 3&4 · propositional logic
· basics, set operations
· one-to-one, onto
PRELIM EXAM
· inverse, composition, and
basics; set operations, one-to-one, onto, inverse, composition; graphs,
graphs
greatest common divisor, Euclidean algorithm.
• Interactive Activity
• Reading Assignments

LO2 Sequences and Summations


WEEK 5&6 • Case Study
• Demonstration
Logics WEEK 7&8
• Reading Assignments
MIDTERM EXAM
propositional logic, logical equivalence, predicates & quantifiers, and
logical reasoning; sequencing of numbers and summation .
LO3 • short quiz
Mathematical reasoning and induction WEEK 9&10 • problem analysis
• reading assignments
Counting
WEEKK 11-12
PREFINAL EXAM
Proof strategies, Mathematical Induction, Recursive definitions, Structural
Induction; basic rules, Pigeonhole principle, Permutations and Combinations,
Binomial coefficients and Pascal triangle

Probability
WEEK 13-15 • Group output assignment
• Final Output
Graphs

FINAL EXAM

Reference: Kenneth H. Rosen. Discrete Mathematics and Its Applications, 7th Edition, McGraw Hill, 2012.

Materials:

You might also like