Let A = {1, 2, 3} and R = {(1,2), (2,2), (2,1)} be a relation on A.

The number of elements in tsr(R) (the smallest equivalence relation containing R) is...

Find the symmetric closure over the set {a, b, c, d} for the relation {(a,a), (a,b), (b,c)}

True or False:

An algorithm with a worst case of 2n operations and an algorithm with a worse case of 3n operations are both O(n).

According to our conventions, which of the following is a bag (also known as a multi-set)?

Say whether ℕ x ℕ is a countable set and provide justification for your answer.

Find the closed form for a(n) in the following recurrence relation:

Suppose you were asked to prove a conditional statement, such as a statement in this format:

If x then y.

Briefly explain the general technique you would use to prove that the conditional is true.

A ternary decision tree to solve a problem with 30 outcomes must have depth (number of decision levels) of at least...