Sie sind auf Seite 1von 5

DE LA SALLE LIPA Computer Science and Information Technology Department

Computer Science Department

______________________________________________________________________________________________________________________________________ Course Syllabus DISCRETE STRUCTURES 1st Semester, SY 2011-12 Course Code Credit Prerequisite Audience : DISTRUC : 3 units : Algebra : BSIT and BSIS Students

Course Description : This course is meant to provide Information Technology and Information System students with the tools and problem solving skills to help them develop programs and other software. The course covers relevant computer science topics such as logic, proofs, analysis of algorithms, trees and graphs, circuits and basic automata theory. Value Objective: Fully aware of the disciplinal, Christian, and professional characteristics of the eight core values that guide Lasallian education, the student must completely and excellently apply these values by exhibiting honesty during exams, following critical thinking in problem analysis and solving, being innovative in approach, being morally compassionate thus sharing talents to those lacking intellectual giftedness, and portraying social awareness and patriotism. Course Objectives: The course is meant to instruct students on the mathematical principles used in computer applications. With this background, the students completing this course are expected to be able to: A. 1. 2. 3. 4. 5. Cognitive Discuss the set of theoretic techniques(operations and Venn diagrams) Explain the concepts of graphs and trees Appraise the use of functions and identify the importance of sets and subsets in the field of computer science. Discuss the recurrence relations of logic, mathematical induction and algorithmic thinking. Explain the importance of discrete Math in the application of computer science Affective Value the role of Discrete Math in solving problems. Appreciate the importance of Discrete Mathematics in the area of Computer Science

B.

1. 2.

C.

Psychomotor Perform various operations with relations and functions (congruence, methods of proof, induction, recursion, and Boolean rules) 2. Solve problems using flowcharting. Apply different methods of solving problems such as proposition, pigeonhole principle and machine languages 1.

Textbook: T1- Discrete Mathematics 6th Edition, by Richard Johnsonbaugh References(Resources) R1 Discrete Mathematics and its Applications, 6th Edition by Kenneth Rosen R2 Discrete Mathematics for Engineers and Scientists by Haggard, Schlipf, Whitesides Lecture Notes: (Downloaded from the Internet) LN1- Lecture Notes in Discrete Mathematics by Marcel B. Finlan, Arkansas Tech University, 2001 Web Links: WL1 - http://condor.depaul.edu/~rjohnson/dm6th/ Dates June 14 Graduate Attributes Christian Gentlemen and ladies Objectives
1. Learn about the

Content Subject orientation Introduction to Discrete Mathematics

Strategies Provide discussions of the classroom/school policies including the grading system. Discuss the importance of discrete mathematics to the area of computers.

Evaluation Question/Answer Research Work

Resources Student Handbook R1, R2, LN1, WL1

course (Class Schedules, grading system and requirements) 2. Discuss the importance of discrete mathematics in the field of computers.

June 16 - 30

1. Define sets and its

basic concepts. 2. Perform the different operations on sets. 3. Define functions and

SETS, FUNCTIONS, SEQUENCES AND SUMS

Definitions Operations

Provide lectures/discussions of the topics Give seatworks at

Seatworks every meeting A Unit test

R1, R2, LN1, WL1

its set of theories. 4. Understand sequences and summations.

the end of every discussion and a quiz when the topics are all covered. LOGIC AND PROOFS - Formulas - Logical Equivalence - Tautology and Contradiction - Quantifiers - Proofs - Resolution Proofs Providing comprehensive lectures on the basic concepts of logic and proofs Seatworks every meeting A Unit test T1 Chp 1, R1, R2, LN1, WL1

July 5 - 14

Lifelong Learner

1. Display relationships between truth values of propositions 2. Prove the logical equivalence of two compound propositions 3. Identify the types of quantifiers in every statement and determine their truth values 1. To learn the terminologies, basic concepts and operations related to matrices and relations 2. Solve problems using the learned formulas

July 19 - 28

Confident

MATRICES AND RELATIONS - Terminology - Operations

Providing a series of lectures and demonstrations by solving various problems to related to the topic covered in these meetings

Seatworks every meeting A Unit test

T1 Appendix A, Chp. 2 Section 2.4 R1, R2, LN1, WL1

Aug 2 - 11

Competent

1. Learn the basic concepts and procedures in analyzing algorithms 2. Acquire skills in using practical shortcuts of using the Big-O Notation 3. Analyze different algorithms involving looping, selection, functions, and recursions.

ALGORITHMS - Notation for Algorithms - The Euclidean Algorithm - Recursive Algorithms - Complexity

Providing a series of lectures and demonstrations by solving various problems to related to the topic covered in these meetings

Seatworks every meeting A Unit test

T1 Chp. 3 R1, R2, LN1, WL1

Midterm Exam Aug 22 Sept 1 Environmental Steward/Cares for the Earth 1. Learn the basic concepts and procedures involved in the Pigeonhole Principle 2. Apply the learned principle by solving related problems Sept 6 - 15 Competent Confident 1. To learn the basic concepts and terminologies of graphs 2. Apply learned operations on related problems Sept 20 - 29 Competent Confident 1. Learn basic terminologies and concepts of Trees as a data structure 2. Perform Tree traversals 3. Perform basic operations such as deletion, insertion and searching Oct 4 - 6 Competent Confident 1. Learn Boolean algebra and their role in the design of electronic circuits 2. Design simple combinatorial circuits based on a given Boolean equation. 1. Learn the basic COMBINATORIAL CIRCUITS - gates - designing circuits GRAPH THEORY - Paths and Cycles - Representation of graphs - Isomorphism - Traveling Salesman Problem TREES - Terminologies - Spanning Trees - Binary Tree - Tree Traversals THE PIGEONHOLE PRINCIPLE - Basic Principle - Examples Providing a series of lectures and demonstrations by solving various problems to related to the topic covered in these meetings Providing a series of lectures and demonstrations by solving various problems to related to the topic covered in these meetings Providing a series of lectures and demonstrations by solving various problems to related to the topic covered in these meetings Seatworks every meeting A Unit test T1 Chp. 4 R1, R2, LN1, WL1

Seatworks every meeting A Unit test

T1 Chp. 6 R1, R2, LN1, WL1

Seatworks every meeting A Unit test

T1 Chp. 7 R1, R2, LN1, WL1

Providing a series of lectures and demonstrations by solving various problems to related to the topic covered in these meetings Providing a series of

Seatworks every meeting A Unit test

T1 Chp. 9 R1, R2, LN1, WL1

Oct 11 - 13

Committed to Excellence

AUTOMATA,

Seatworks every

T1 Chp. 10

concepts of sequential circuits and finite-state machines. 2. Draw transition diagrams based on a given transition table and machine definition.

GRAMMARS, AND LANGUAGES - sequential circuits and FSM - Languages and Grammars

lectures and demonstrations by solving various problems to related to the topic covered in these meetings

meeting A Unit test

R1, R2, LN1, WL1

Final Exam/Project GRADING SYSTEM Mid-Term AND Final Term: Major Exam/Project 1/3 Quizzes 1/3 Class Standing 1/3 - Seatwork - 50% - Attendance - 20%% - Assignment - 10% - Values/Behavior- 20% Prepared by: ________________________ Ma. Christina A. Florentino Faculty Member

FINAL COURSE GRADE

= 1/3 Mid -Term Grade + 2/3 Final Grade

Approved by: __________________________ Mr. Mark G. De Vera Department Chair ___________________________ Engr. Rodolfo Cabrera Dean, CITE