Discrete Mathematics Course Overview
Uploaded by
ScribdTranslationsDiscrete Mathematics Course Overview
Uploaded by
ScribdTranslationsDiscrete Mathematics
Code:INF
Credits: 04
Horas-aula:60
Semester: 2013/01
Courses: Computer Engineering
Prerequisites: None
Professor: Celso Antônio Alves Kaestner
Objectives:
Study the basic concepts and results of the contents of the summary, providing the student
knowledge and techniques that will be useful to you later. Empower the student to a
appreciation of the discipline not only as an expression of intellectual creativity but as
instrument for mastering current science and technology. Develop and consolidate attitudes of
participation, commitment, organization, flexibility, criticism and self-criticism in the unfolding
of the teaching-learning process.
Methodology and Learning Experiences:
The curricular contents are addressed through expository-dialogue classes and studies.
individuals. Solving exercises is also necessary as an extracurricular activity.
Syllabus
1. Notions of Mathematical Logic: propositions, truth value, conjunction, disjunction,
implication and equivalence of propositions.
2. Theorems demonstration techniques.
3. Sets: subsets, equality of sets, power set, diagrams of
Venn.
4. Operations with sets, set algebra, relationship of operations with sets
with logical operations.
5. Functions: image, injective and surjective functions, composition of functions, function
inverse. Sequences.
6. Relations: representations of relations through graphs, matrices, and diagrams, composition of
relationships, inverse or dual relationship. Properties of relationships.
7. Equivalence relations: equivalence classes and partitions.
8. Order relations: Hasse diagram, partially ordered sets, totally
ordered, reticulated.
9. Mathematical induction; recursion.
10. Boolean algebras: boolean expressions.
11. Algebraic structures: groups and applications.
Bibliography
Bibliografia Básica:
1. Gersting, J. L. - Mathematical Foundations for Computer Science, LTC,
1993. ISBN: 8521614225
2. Menezes, Paulo B. - Discrete Mathematics for Computing and Information Technology, Series
Textbooks, number 16, Institute of Computer Science of UFRGS, Sagra Publisher
Luzzatto, 2004. ISBN: 8521614225
3. Scheinerman, Eduard R. – Discrete Mathematics: An Introduction, Thomson Learning,
2006. ISBN: 9788522102914
Complementary Bibliography:
1. Ross, Kenneth & Wright, Charles–Discrete Mathematics, Prentice Hall, 1992. ISBN:
0130652474
2. Lipschutz, Seymour & Lipson, Marc - Discrete Mathematics, Schaum's Collection
Bookman, 2004. ISBN: 8536303611; 9788536303611
3. Prather, R. – Discrete Mathematical Structures for Computer Science, Publisher
Houghton Mifflin. ISBN: 978-0395206225
4. Preparata, Franco P. and Yeh, Raymond T. - Introduction to Discrete Structures for
Computer Science and Engineering.
5. Domingues, Hygino H. and Iezzi, Gelson - Modern Algebra, Atual Publishing. ISBN:
8570567189
6. Epp, Susanna S.–Discrete Mathematics with Applications, CENGAGE Publishing
LEARNING INT, 1995. ISBN: 9780534360283
7. Rosen, Kenneth H.–Discrete Mathematics and Its Applications, McGraw-Hill, 1999.
ISBN: 8577260364; 9788577260362
Evaluation
Evaluation Criteria:
There will be two bimonthly exams. The first exam will cover items 1 to 6 of
Curriculum content and the second test items from 7 to 11, with minor changes possible.
variations according to the development of the discipline.
The student will be approved in the subject if:
fulfill the requirement of at least 75% attendance in the classes taught, as per
legislation; and
the arithmetic average of the two tests is equal to or greater than 6.0 (six);
if this average is not reached, there may be an additional test (final exam) that
will cover all the content of the subject; in this case, the student will be considered approved
that achieving an average of 6.0 (six) between the result of the additional exam and the average of the
bimonthly tests.