Topics Covered on Exam
Graphs: condition for a graph to have an Euler Circuit, and
basic defns.
Relations: definition and graphical view, binary and nary
relation, inverse, composition of a relation, associativity of
composition, reflexive, irreflexive, symmetric, antisymmetric,
and transitive properties, equivalence relations, partial
ordering relations, reflexive, symmetric, and transitive closures
Functions: definition and graphical view, composition of a
function, inverse, injection, surjection, and bijection.
Sections in the book that will be useful:
Chapter 5: Sections 1, 2, 6
Chapter 7: Sections 1, 4
Also, since a relation is simply a set, it may be useful to review
material on sets from chapter 3.
How to study:
First, flip through my notes, making sure you understand the
examples presented. Look at the past couple homework
solutions, and also look at Lang’s previous homework
questions on this material. Practice these problems. Finally,
flip through the book to make sure you understand what is in
each of the sections I mentioned above. Keep in mind that I
may not have covered everything in these sections.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Format
Unlike last time I will actually have some T/F and multiple
choice/matching, as well as some short answer. However, as
This is the end of the preview.
Sign up
to
access the rest of the document.
 Fall '09
 Binary relation, relation, Euler circuit

Click to edit the document details