Logic
propositional connectives
truth tables
satisfiability
validity
provability
tautologies
quantifiers
Sets
elements
subsets
union, intersection, set difference
cartesian product
cardinalities of finite sets
Relations
reflexivity, symmetry and transitivity
equivalence relations and partitions
composition
Functions
1-1
onto
invertibility
Induction
its use for proving simple numerical identities
and for defining functions
Here is a more detailed syllabus for the course, together with many example problems, courtesy of Prof. Elaine Rich of the Computer Sciences Department. The course should enable you to solve these sorts of problems.
P. S. The University of Texas has many rules and regulations. It is highly recommend that for all courses at the University of Texas that students be familiar with the General Information catalog, the Course Catalog, and of course the Course Schedule, which can all be found on-line at http://www.utexas.edu. Also highly recommended is http://cns.utexas.edu/faculty/files/2006CourseworkRoutine.pdf , Dean Laude's memo on Coursework and Routine: Policies, Procedures, and Recommendations.