Exam 2: Basic Structures: Sets, Functions, Sequences, Sums, Matrices
Exam 1: The Foundations: Logic and Proofs200 Questions
Exam 2: Basic Structures: Sets, Functions, Sequences, Sums, Matrices214 Questions
Exam 3: Algorithms52 Questions
Exam 4: Number Theory and Cryptography154 Questions
Exam 5: Induction and Recursion53 Questions
Exam 6: Counting156 Questions
Exam 7: Discrete Probability53 Questions
Exam 8: Advanced Counting Techniques128 Questions
Exam 9: Relations74 Questions
Exam 10: Graphs127 Questions
Exam 11: Trees97 Questions
Exam 12: Boolean Algebra77 Questions
Exam 13: Modeling Computation71 Questions
Select questions type
Adapt the Cantor diagonalization argument to show that the set of positive real numbers less than 1 with
decimal representations consisting only of 0s and 1s is uncountable.
(Short Answer)
4.9/5
(29)
Suppose B= and C= . Find a matrix A such that AB=C or prove that no such matrix exists.
(Short Answer)
4.9/5
(39)
determine whether the rule describes a function with the given domain and codomain.
-
(Short Answer)
5.0/5
(35)
use a Venn diagram to determine which relationship, is true for the pair of sets.
-
(Short Answer)
4.8/5
(34)
Prove that by giving a containment proof (that is, prove that the left side is a subset of the right side and that the right side is a subset of the left side).
(Essay)
4.7/5
(37)
mark each statement TRUE or FALSE. Assume that the statement applies to all sets.
-
(True/False)
4.8/5
(36)
Give an example of a function f: N → Z that is onto Z and not 1-1.
(Short Answer)
4.9/5
(30)
describe each sequence recursively. Include initial conditions and assume that the
sequences begin with a1.
-0.1, 0.11, 0.111, 0.1111, . . . .
(Short Answer)
4.8/5
(40)
find a formula that generates the following sequence a1, a2, a3 . . . .
-3, 3, 3, 3, 3, . . . .
(Short Answer)
4.8/5
(47)
Showing 121 - 140 of 214
Filters
- Essay(10)
- Multiple Choice(0)
- Short Answer(152)
- True False(52)
- Matching(0)