Discrete Structures
Final Exam Topics
Last Update: 3 December 2010
Note:
or
material is highlighted
|
logic, including:
propositional logic
first-order predicate logic
(there will be questions like those on the
midterm)
sets, including
set membership
union, intersection, complement
ordered pairs
relations, including:
binary relations, including:
reflexive relations
symmetric relations
anti-symmetric relations
transitive relations
equivalence relations, including:
equivalence classes
partitions
directed-graph representations of binary relations
functions, including:
1-1 functions
onto functions
1-1 correspondences
sequences
summations
recursion, including:
proofs by mathematical induction
recursive definitions
recurrence relations, including:
computing with them
creating them
solving them
know the set-theoretical, FOL definitions of key terms
(including the definitions of all of the above terms!)
there will be no questions on graphs or trees, except as listed above
How should I study?
Copyright © 2010 by
William J. Rapaport
(rapaport@buffalo.edu)
http://www.cse.buffalo.edu/~rapaport/191/F10/finalexam.html-20101203