You are on page 1of 3

COURSE DESCRIPTION Fall 2008 Dept.

,Number Semester Hours Current Catalog Description This course is designed for students who attend their first or second year in the Computer Science program or a Mathematics program. In this course students will learn techniques to produce elementary mathematical demonstrations. The course also will introduce students to topics related to sets or processes that can be enumerated or associated with subsets of the natural numbers. The topics that will be discussed will be necessary for the other courses in mathematics and computer science. Textbook E. Goodaire, M. Parmenter: Discrete Mathematics with Graph Theory References Biggs, Norman L: Discrete Mathematics;New York : Oxford University Press, 1994 Chen, W.W. : Lecture Notes http://www.maths.mq.edu.au/wchen/Indmfolder/Indm.html Diestel, R. : Graph Theory http://www.math.unihamburg.de/home/diestel/books/graph.theory/GraphTheoryII.pdf Epp, Susanna S. : Discrete Mathematics with Application, Brooks Cole; 3rd edition, 2003 Goodaire, E. and Parmenter, M : Discrete Mathematics with Graph Theory, 2nd Edition; Prentice Hall,2002 Knuth, D.E. : Selected Papers on Discrete Mathematics, Center for the Study of Language and Inf, 1 edition 2004 Lax, R. F. : Modern Algebra and Discrete Structures, Reading, Mass. : Addison-Wesley, 1991. MacGillivray, G. : Lecture Notes http:www.math.uvic.ca/faculty/gmacgill/guide/ Rosen, Kennth H. : Discrete Mathematics and its Applications, McGraw-Hill, 5th edition, 2003 Wallis, W.D: A Beginner's Guide to Discrete Mathematics, Birkhauser. (2002) Course Outcomes The student will learn the basics of mathematical reasoning and logic. The student will be able to do elementary proofs on the topics learned in the course. The student will know about the basic concepts and methods of discrete mathematics and its applications. The student will be able to use sets, its operations and relations to structure data, understand and solve mathematical problems. The student will know different types of relations and functions between sets and how to represent them. The student will know concepts and algorithms related the integers. The student will know and will be able to use mathematical induction to establish recurrence relations. The student will know basic counting techniques and will be able to solve problems in combinatorics and discrete probability. The student will know basic concepts, algorithms and problems on graphs and trees and how to use these structures to organize and process data. The student will apply the concepts learned in class to solve problems. Relationship between Course Outcomes and Program Outcomes CCOM3020 3 Course Title Course Coordinator Discrete Mathematics Ivelisse Rubio Canabal

Creative and analytic ability, and capacity for logical reasoning is related to The student will learn the basics of mathematical reasoning and logic. Creative and analytic ability, and capacity for logical reasoning is related to The student will apply the concepts learned in class to solve problems. Effective use of mathematical language and ability to develop elementary proofs. is related to The student will be able to do elementary proofs on the topics learned in the course. Effective use of mathematical language and ability to develop elementary proofs. is related to The student will know about the basic concepts and methods of discrete mathematics and its applications. Prerequisites by Topic Major Topics Covered in the Course Logic and proofs Sets and relations Functions Integers Induction and Recursion Principles of Counting, Combinatorics and Discrete Probability Graphs and Trees Assessment Plan for the Course The student will learn the basics of mathematical reasoning and logic. will be evaluated with Final Exam Grade The student will be able to do elementary proofs on the topics learned in the course. will be evaluated with Problems in Exam The student will know about the basic concepts and methods of discrete mathematics and its applications. will be evaluated with Final Exam Grade The student will be able to use sets, its operations and relations to structure data, understand and solve mathematical problems. will be evaluated with Problems in Exam The student will know different types of relations and functions between sets and how to represent them. will be evaluated with Problems in Exam The student will know concepts and algorithms related the integers. will be evaluated with Problems in Exam The student will know and will be able to use mathematical induction to establish recurrence relations. will be evaluated with Problems in Exam The student will know basic counting techniques and will be able to solve problems in combinatorics and discrete probability. will be evaluated with Problems in Exam The student will know basic concepts, algorithms and problems on graphs and trees and how to use these structures to organize and process data. will be evaluated with Problems in Exam The student will apply the concepts learned in class to solve problems. will be evaluated with Problems in Exam

How Data in the Course is Used to Assess Program Outcomes (unless adequately covered already in the assessment discussion under Criterion 4) ''Creative and analytic ability, and capacity for logical reasoning'' will be evaluated with ''Final Exam Grade'' throught ''The student will learn the basics of mathematical reasoning and logic.'' ''Creative and analytic ability, and capacity for logical reasoning'' will be evaluated with ''Final Exam Grade'' throught ''The student will learn the basics of mathematical reasoning and logic.'' ''Effective use of mathematical language and ability to develop elementary proofs.'' will be evaluated with ''Final Exam Grade'' throught ''The student will know about the basic concepts and methods of discrete mathematics and its applications.'' ''Effective use of mathematical language and ability to develop elementary proofs.'' will be evaluated with ''Final Exam Grade'' throught ''The student will know about the basic concepts and methods of discrete mathematics and its applications.'' Estimate Curriculum Category Content (Semester hours) Area Algorithms Data Structures Computer organization and architecture Core 0.40 0.47 0.00 Advanced 0.00 0.00 0.00 Area Software Design Concepts of programming languages Other Core 0.00 0.00 2.13 Advanced 0.00 0.00 0.00

You might also like