MTH202 Quiz-3 by Vu Topper RM
MTH202 Quiz-3 by Vu Topper RM
MTH202 Quiz-3 by Vu Topper RM
By Vu Topper RM
1. If A and B are disjoint sets then P(A B)=…………
P(A)
True
3. P(AC/B)=1 - P(A/B)
True
4. If A and B be events with P(A)=1/3. P(B)=1/4 and P(A intersection b)=1/6, then
P(A U B) = _____________.
5/12
P(B) > 0
2(Number of edges of G)
8. If A and B be events with P(A)=1/3. P(B)=1/4 and P(A intersection b)=1/6, then
P(A/B) = _________
2/3
9. A closed walk is the walk that starts and ends at the same vertax
True
aE(X)
12. A simple graph is a graph that does not have any loop.
True
P(A n B) / P(B)
14. If X and Y are independent random variables and a and b are constant, then
Var(aX+bY) is equal to
Chance variable
16. If the random variable X denotes the number of heads when three distict coins
are tossed, then X assumes the value
0,1,2,3
E(X) - E(Y)
True
19. Which of the followings is the probability of getting a 6 when a dice is tossed?
1/6
True
Same
25. If the standard deviation of the data set is 4 then the value of the variance is
16
26. What is the probability of the number of one head when two fair coins are
tossed?
2/4
27. A simple graph is a graph that does not have any loop
True
P(A)
True
30. There are three bus lines between A and B, and two bus lines between B and C.
Find the number of ways a person can travel round trip by bus from A to C by
way of B?
31. Which of the followings is the product set A*B*C? where A= {a}, B={b}, and
C={c,d}
{(a,b,c), (a,b,d)}
720
16
56
35. Let X={1,2,3},then 2-combinations of the 3 elements of the set X are ______?
{1,2}.{1,3}and{2,3}
False
True
True
E(x)E(y)
True
P(A)P(B)
42. If X is a discrete random variable and f(x) is the probability of X, then the
expected value of this random variable is equal to;
∑xf(x)
43. The expected value E(X) is obtained by multiplying each value of X by its
probability and taking the sum.
True
5!/3!
48. There are 4 bus lines between X and Y, and 5 bus lines between Y and Z, the
number of ways a person can travel from X to Z?
20
50. Algorithm is a more general term in that the term ____ refers to a particular
programming language.
Program
Mathematical induction
Proof by contradiction
54. If one event can occur in n1 ways a second event can occur in n2 ways, a third
event can occur in n2 ways, how ways all of the events can occur in the order
55. A non zero integer d divides an integer n if and only if there exists an integer k
such that___________
N=dk
N(n+1)/2
57. The sum of two integers is not an even integer when _______.
1=(1)(1+1)/2
1+5+9+…….+(4k-3)=k(2k-1)
Contraposition
61. The predicate which describes the initial state is called the ______ of the
algorithm
Pre-condition
An end statement
63. Which of the following is not a method to prove the mathematical statements?
Permutation
Even
68. The ___ of a predicate variable is the set of all values that may be submitted in
place of the variable
Domain
69. For all positive real numbers a and b if a < b, then _______.
70. For every prime number n, n+2 is prime. Which of the following prime number
disproves the above statement.
N=7
Infinite set
Even
73. In inductive property the first iteration of the loop is solved for?
I(K)
74. Which of the following is not a method to prove the mathematical statements?
permutation
75. In how many ways a student can choose a course from 2 science courses 3
literature courses and 5 art courses
10
76. In the Direct Proof, we show that if the statement p is true, then the statement q
is _____.
78. The sum of any rational number and any irrational number is irrational.
True
Infinite set
Even
14
True
83. The method of loop invariants is used to prove ________ of a loop with respect to
certain pre and post-conditions.
Correctness
Counting
p →q ≡(p∧~q) →c
p →q≡ ~q→~p
88. Proof by contradiction is a/an ___ method of proof.
Indirect
Indirect
Remainder
N=k+1
16
2^(n+1) – 1
15
1=1(2(1)-1)
96. The predicate describing the initial state is called ______. Pre-
condition of the algorithm
97. If n is any positive integer then 2n > 2(n+1) is true for all ______.
N>3
12
Remainder
101. If the sum of two integers is even the their difference would be _.
Even
2^(2n) – 1 by 3
104. The loop is correct if the four properties are true, one of the property is?
N>3
Even
108. A boy can choose from 5 train services and 3 bus service to go to his
hometown, How many total options he can choose from?
Division algorithm
n>6
In a city, the bus route numbers consist of a natural number less than 20, followed by one
of the letters A,B,C,D,E and F. How many different bus routes are possible?
114
The word "algorithm" refers to a step-by-step method for performing some action.
True
113. There are 5 Chinese books and 6 English books, a student wants to select
one optional book for both subject, total number of choices will be
30
115. If there are 5 different optional courses in English and 3 different optional in
Maths. Choices for a student who to take one optional.
116. Number of combination of 3-bit string that contain exactly there ‘0’ is
______.
N(n+1)(2n+1)/6
118. If ‘r’ is a perfect square, then which of the following is the correct
representation of ‘r’?
3n(n+1)/2
121. A predicate becomes _______ when its variables are given specific values.
Sentence
EUCLIDEAN ALGORITHM
Variables
124. A proof by _____ is based on the fact that either a statement is true or it is
false but not both.
Contradiction
125. The _____ of a predicate variable is the set of all values that may be
substituted in place of the variable
Domain
17=15 x 3 + 2
True
A student can choose a computer project from one of the two lists. The two lists contain
12 and 18 possible projects, respectively.How many possible projects are there to choose
from ?
30
True
129. Suppose there are different tea flavors and 5 different biscuit brands. A
guest wants to take one tea and one brand of biscuit. How many choices are
there for this guest?
13
N(n+1)/2
odd
Even
The name of the algorithm, together with a list of input and output variables
false
720
Algorithms formally:
1.The name of the algorithm, together with a list of input and output variables.
2.A brief description of how the algorithm works.
3.The input variable names, labeled by data type.
4.The statements that make the body of the algorithm, with explanatory comments.
Even
144. In the direct proof, we show that if the statement p is true then the statement
q is __________.
True
Combinatorics
147. For All positive real numbers a and b, if a < b, then ____.
148. The rational number ‘2’ is the product of which of the two irrational
numbers.
152. In how many ways a student can choose a course from 2 science courses, 3
literature courses and 5 art courses.
10
If the guard G and the loop invariant I(k) are both true for an integer k ≥ 0 before an
iteration of the loop, then I(k + 1) is?
True
False
I(0)