Test your knowledge!

[qwiz repeat_incorrect=”false”; style = “border: 2px solid black; background: white;"] [i] Test your knowledge on discrete mathematics topics! Click start to begin! [q] A _ is an ordered collection of objects.
[c] Function
[c] Relation
[c*] Set [f] Incorrect: the correct answer is Set [f] Incorrect: the correct answer is Set [f] Correct! [q] What is the Cartesian product of A = {1, 2} and B = {a, b}?
[c*] {(1, a), (2, a), (1, b), (2, b)}
[c] {(1, a), (1, b), (2, a), (b, b)}
[c] {(1, 1), (a, a), (2, a), (1, b)} [f] Correct! A subset R of the Cartesian product A x B is a relation from the set A to the set B. [f] Incorrect: A subset R of the Cartesian product A x B is a relation from the set A to the set B. [f] Incorrect: A subset R of the Cartesian product A x B is a relation from the set A to the set B. [q] Let f and g be the function from the set of integers to itself, defined by f(x) = 2x + 1 and g(x) = 3x + 4.
Then the composition of f and g is
[c*] 6x + 9
[c] 6x + 7
[c] 6x + 6 [f] Correct! The composition of f and g is given by f(g(x)) which is equal to 2(3x + 4) + 1. [f] Incorrect: The composition of f and g is given by f(g(x)) which is equal to 2(3x + 4) + 1 = 6x+9 [f] Incorrect: The composition of f and g is given by f(g(x)) which is equal to 2(3x + 4) + 1 = 6x+9 [q] The sets A and B have same cardinality if and only if there is ___ from A to B.
[c] One-to-many
[c*] One-to-one
[c] Many-to-one [f] Incorrect: the correct answer is One-to-one [f] Correct! [f] Incorrect: the correct answer is One-to-one [q] In how many ways can a hungry student choose 3 toppings for his pizza from a list of 10 possibilities?
[c*] 120
[c] 110
[c] 100 [f] Correct! 10C3 = 120 [f] Incorrect: 10C3 = 120 [f] Incorrect: 10C3 = 120 [q] The binary notation of ABBA is
[c] 1010 1001 1011 1011
[c] 1011 1000 1010 1001
[c*] 1010 1011 1011 1010 [f] Incorrect: the correct answer is 1010 1011 1011 1010 [f] Incorrect: the correct answer is 1010 1011 1011 1010 [f] Correct! [q] The relation { (1,2), (1,3), (3,1), (1,1), (3,3), (3,2), (1,4), (4,2), (3,4)} is
[c*] Transitive
[c] Symmetric
[c] Reflexive [f] Correct! [f] Incorrect - the correct answer is : Transitive [f] Incorrect - the correct answer is : Transitive [q] An undirected graph possesses an eulerian circuit if and only if it is connected and its vertices are
[c] of any degree
[c*] all of even degree
[c] all of odd degree [f] Incorrect - the correct answer is : all of even degree [f] Correct! [f] Incorrect - the correct answer is : all of even degree [q] The number of colours required to properly colour the vertices of every planar graph is
[c] 3
[c] 4
[c*] 5 [f] Incorrect - the correct answer is: 5 (Refer to the 5-color theorem) [f] Incorrect - the correct answer is: 5 (Refer to the 5-color theorem) [f] Correct! [q] The number of leaf nodes in a complete binary tree of depth d is
[c] 2d-1+1
[c*] 2d
[c] 2d+1 [f] Incorrect - the correct answer is: 2d [f] Correct! [f] Incorrect - the correct answer is: 2d [/qwiz]