Have an account?
Skip to Content
Build your own quiz
Suggestions for you
50 questions
Show Answers
See Preview
- 1. Multiple Choice
If A = {x/x is a positive even integer less than 20}, which of the following is TRUE?
15 ∈ A
16 ∉ A
18 ∈ A
20 ∈ A
- 2. Multiple Choice
If U = {x/x is a whole number less than 20} and A = {1, 3, 5, 7, 9, 11, 13, 15, 17}. Find Ac.
{ 2, 4, 6, 8, 10, 12, 14, 16, 18 }
{ 0, 2, 4, 6, 8, 10, 12, 14, 16, 18 }
2, 4, 6, 8, 10, 12, 14, 16, 18, 20 }
{ 0, 2, 4, 6, 8, 10, 12, 14, 16, 18, 28 }
- 3. Multiple Choice
X Y = { 4, 7 }
- 4. Multiple Choice
{ 3, 4, 5, 6, 7 }
{ 3, 4, 5, 6, 7, 10 }
{ 0, 3, 4, 5, 6, 7, 10 }
{ 0, 3, 4, 5, 6, 7, 8, 10 }
- 5. Multiple Choice
If set P and set Q are disjoints then their intersection is _____.
empty
P
Q
P or Q
- 6. Multiple Choice
If set A has 3 elements, find the cardinality of its power set.
8
16
24
32
- 7. Multiple Choice
If M = {3, 5} and N = {2, 4, 6}, find M × N.
M × N = {(3, 2), (3, 4), (3, 6)}
M × N = {(3, 2), (3, 4), (3, 6), (5, 2), (5, 4)}
M × N = {(3, 2), (3, 4), (5, 2), (5, 4), (5, 6)}
M × N = {(3, 2), (3, 4), (3, 6), ((5, 2), (5, 4), (5, 6)}
- 8. Multiple Choice
Given: P = { 1, 2, 3 } and Q = { set of natural numbers between 7 and 11 }. Which of the following statements is TRUE?
P and Q are equal
P and Q are equivalent
P and Q are joint
P and Q are empty
- 9. Multiple Choice
reflexive
symmetric
transitive
anti-symmetric
- 10. Multiple Choice
reflexive
symmetric
transitive
anti-symmetric
- 11. Multiple Choice
reflexive
symmetric
transitive
anti-symmetric
- 12. Multiple Choice
If { 1, 3, 4, 7 } and If { 2, 5, 6, 8, 9 }. Define the relation from such that the element in plus an element in is even.
R = { (1, 5), ( 1,9), ( 3, 5), (3, 8), ( 4, 2 ), (4, 8 ), ( 7, 5), (7, 9) }
R = { (1, 5), ( 1,9), ( 3, 5), (3, 9), ( 4, 2 ), (4, 8 ), ( 7, 5), (7, 9) }
R = { (1, 5), ( 1,9), ( 3, 5), (3, 9), ( 4, 2 ), (4, 8 ), ( 7, 8), (7, 9) }
R = { (1, 6), ( 1,9), ( 3, 5), (3, 9), ( 4, 2 ), (4, 8 ), ( 7, 5), (7, 9) }
- 13. Multiple Choice
13. If M = {3,5,7} and N ={6,10,17, 33,49} . Define the relation from such that the elements in when squares are less than in elements in N.
R = { (3, 10), (3,17), ( 3, 33), (3, 49), ( 5, 33 ), (5, 49 ) }
R = { (3, 10), (3,17), ( 3, 33), (3, 49), (5, 33), (5, 49), ( 7, 49) }
R = { ( 3, 6 ), (3, 10), ( 3,17), ( 3, 33), (3, 49), ( 5, 33 ), (5, 49 ) }
R = { (3, 10), ( 3,17), ( 3, 33), (3, 49), ( 5, 33 ), (5, 49 ), (9, 49) }
- 14. Multiple Choice
14. What Is the cardinality of an empty?
0
1
2
3
- 15. Multiple Choice
What Is the cardinality of the subset an empty set?
0
1
2
3
- 16. Multiple Choice
What is the cardinality of {∅, {∅}}?
0
1
2
3
- 17. Multiple Choice
If two sets are disjoint and the cardinality of sets A and B are 4 and 5 respectively. What is n(A B)?
1
4
5
9
- 18. Multiple Choice
17
24
44
51
- 19. Multiple Choice
17
24
44
51
- 20. Multiple Choice
In the given Venn diagram below, what is n( G - R ) ?
17
24
44
51
- 21. Multiple Choice
Out of 50 students of BSIT cluster, 35 students like to play Mobile Legends, 25 like to play Call of Duty and 15 like to play both. How many students like to play Mobile Legends only?
10
20
35
45
- 22. Multiple Choice
Out of 50 students of BSIT cluster, 35 students like to play Mobile Legends, 25 like to play Call of Duty and 15 like to play both. How many students do not like any of the two games?
5
10
15
20
- 23. Multiple Choice
Which of the following is a proposition?
Sit tall!
m + n = q
Tomato is a fruit!
When is your birthday!
- 24. Multiple Choice
Which of the following is not a proposition?
Open the door!
5+6 > 7
2 + 3 = 5
Roses are blue.
- 25. Multiple Choice
A statement that cancels out or denies another statement or action.
negation
conjunction
disjunction
implication
- 26. Multiple Choice
negation
conjunction
disjunction
implication
- 27. Multiple Choice
negation
conjunction
disjunction
implication
- 28. Multiple Choice
This can be conceptualized as determining the chance of occurrence of an event.
combination
permutation
probability
factorial
- 29. Multiple Choice
This refers to any subset of a sample space.
event
experiment
probability
sample space
- 30. Multiple Choice
This refers to the set of all possible outcome.
event
experiment
probability
sample space
- 31. Multiple Choice
If you conduct an experiment by tossing a pair of coins. The sample space is the set of:
S = {H, T}
S = {T, H}
S = {T, H, H, T}
S = {TT, HH, TH, HT}
- 32. Multiple Choice
If A and B are two mutually exclusive events, where P(A) is the probability of A and P(B) is the probability of B, P(A|B) is the probability of A given that B is true. P(B|A) is the probability of B given that A is true.
Baye’s Theorem
Conditional Probability
Probability Axiom
Theory of Probability
- 33. Multiple Choice
The probability for an impossible event is __________.
0
1
-1
2
- 34. Multiple Choice
The probability for a certain event is __________.
0
1
-1
cannot be determined
- 35. Multiple Choice
The total possible outcomes for a pair of dice is __________.
6
12
24
36
- 36. Multiple Choice
What is N in the sequence 1, 1, 2, 3, 5, 8, 13, 21, 34, N?
53
54
55
56
- 37. Multiple Choice
What is the common ratio in the sequence 64, 16, 4, 1, …?
4
- 4
1/4
- 1/4
- 38. Multiple Choice
What is the 27th term of the sequence 100, 95, 90, … ?
30
-30
40
-40
- 39. Multiple Choice
Which useful number diagram can also be used to generate a list of Fibonacci numbers?
Polo’ Triangle
Pierre’s Triangle
Pascals's Triangle
Pentagram’s Triangle
- 40. Multiple Choice
6765
7765
10945
11945
- 41. Multiple Choice
What is the first 3-digit perfect square number that appears on the list of Fibonacci numbers?
100
121
144
169
- 42. Multiple Choice
Strict graph is another name for which graph?
null grapg
multi-graph
simple graph
regular graph
- 43. Multiple Choice
. (I) .A graph is connected if any two vertices of the graph are connected by a path.
(II) A graph is disconnected if at most two vertices of the graph are not connected by a path.
statement I is TRUE and statement II is FALSE
statement II is TRUE and statement I is FALSE
both statements are true
both statements are false
- 44. Multiple Choice
I) A graph is regular if the vertices of the graph different degree.
(II) A graph is called complete graph if every two vertices pair are joined by exactly one edge.
statement I is TRUE and statement II is FALSE
statement II is TRUE and statement I is FALSE
both statements are true
both statements are false
- 45. Multiple Choice
If two graphs G and H contain the same number of vertices connected in the same way, they are called
planar graph
non-planar graph
isomorphic graph
non-isomorphic graph
- 46. Multiple Choice
What is the degree of the given graph ?
2
3
4
5
- 47. Multiple Choice
Empty tree is another name for
labeled tree
unlabeled tree
rooted tree
unrooted tree
- 48. Multiple Choice
An n-vertex graph has ______ edges.
n
n - 1
n - 2
n - 3
- 49. Multiple Choice
A graph which consists of disjoint union of trees is called
labeled tree
rooted tree
forest
catterpillar tree
- 50. Multiple Choice
(I) The center of a tree is a vertex with minimal eccentricity.
(II) The maximum eccentricity is the tree diameter.
statement I is TRUE and statement II is FALSE
statement II is TRUE and statement I is FALSE
both statements are TRUE
both statements are FALSE
- Answer choicesTagsAnswer choicesTags