DMS 1, 2, 3, 4, 5 Units Final
DMS 1, 2, 3, 4, 5 Units Final
DMS 1, 2, 3, 4, 5 Units Final
Unit –I
1. Let P: I am in Bangalore. Q: I love cricket. Then q -> p (q implies p) is?
a) If I love cricket then I am in Bangalore
b) If I am in Bangalore then I love cricket
c) I am not in Bangalore
d) I love cricket
2. Let P: We give a nice overall squad performance, Q: We will win the match.
Then the symbolic form of “We will win the match if and only if we give a nice overall squad
performance.“ is?
a) P v Q
b) Q ∧ P
c) Q<->P
d) ~P v Q
3. Let P, Q, R be true, false and true respectively, which of the following is true?
a) P∧Q∧R
b) P∧~Q∧~R
c) Q->(P∧R)
d) P->(Q∧R)
4. Consider the following statements.
A: Raju should exercise.
B: Raju is not a decent table tennis player.
C: Raju wants to play good table tennis.
The symbolic form of “Raju is not a decent table tennis player and if he wants to play good table
tennis then he should exercise.” is?
a) A->B->C
b) B∧(C->A)
c) C->B∧A
d) B<->A∧C
5. The statement (~P<->Q)∧~Q is true when?
a) P: True Q: False
b) P: True Q: True
c) P: False Q: True
d) P: False Q: False
6. Which of the following is De-Morgan’s law?
a) P ∧ (Q v R) Ξ (P ∧ Q) v (P ∧ R)
b) ~(P ∧ R) Ξ ~P v ~R, ~(P v R) Ξ ~P ∧ ~R
c) P v ~P Ξ True, P ∧ ~P Ξ False
d) None of the mentioned
7. Which of the following satisfies commutative law?
a) ∧
b) v
c) ↔
d) All of the mentioned
8. The contrapositive of p → q is the proposition of ____________
a) ¬p → ¬q
b) ¬q → ¬p
c) q → p
d) ¬q → p
9. What are the contrapositive of the conditional statement “I come to class whenever there is going
to be a test.”
a) “If I come to class, then there will be a test.”
b) “If I do not come to class, then there will not be a test.”
c) “If there is not going to be a test, then I don’t come to class.”
d) “If there is going to be a test, then I don’t come to class.”
10. P ∨ q is logically equivalent to ________
a) ¬q → ¬p
b) q → p
c) ¬p → ¬q
d) ¬p → q
11. Which of the following statement is correct?
a) p ∨ q ≡ q ∨ p
b) ¬(p ∧ q) ≡ ¬p ∨ ¬q
c) (p ∨ q) ∨ r ≡ p ∨ (q ∨ r)
d) All of mentioned
12. Let domain of m includes all students, P (m) be the statement “m spends more than 2 hours in
playing polo”. Express ∀m ¬P (m) quantification in English.
a) A student is there who spends more than 2 hours in playing polo
b) There is a student who does not spend more than 2 hours in playing polo
c) All students spends more than 2 hours in playing polo
d) No student spends more than 2 hours in playing polo
13. Translate ∀x∃y(x < y) in English, considering domain as a real number for both the variable.
a) For all real number x there exists a real number y such that x is less than y
b) For every real number y there exists a real number x such that x is less than y
c) For some real number x there exists a real number y such that x is less than y
d) For each and every real number x and y such that x is less than y
14. Which of the following statement is the negation of the statement?
“2 is even and –3 is negative”?
a) 2 is even and –3 is not negative.
b) 2 is odd and –3 is not negative.
c) 2 is even or –3 is not negative.
d) 2 is odd or –3 is not negative.
15. Express, “The difference of a real number and itself is zero” using required operators.
a) ∀x(x − x! = 0)
b) ∀x(x − x = 0)
c) ∀x∀y(x − y = 0)
d) ∃x(x − x = 0)
16. Find a counterexample of ∀x∀y(xy > y), where the domain for all variables consists of all
integers.
a) x = -1, y = 17
b) x = -2 y = 8
c) Both x = -1, y = 17 and x = -2 y = 8
d) Does not have any counter example
17. Which rule of inference is used in each of these arguments, “If it is Wednesday, then the
Smartmart will be crowded. It is Wednesday. Thus, the Smartmart is crowded.”
a) Modus tollens
b) Modus ponens
c) Disjunctive syllogism
d) Simplification
18. What rule of inference is used in this argument?
“If I go for a balanced diet, then I will be fit. If I will be fit, then I will remain healthy. Therefore, if I
go for a balanced diet, then I will remain healthy.”
a) Modus tollens
b) Modus ponens
c) Disjunctive syllogism
d) Hypothetical syllogism
19. The premises (p ∧ q) ∨ r and r → s implies which of the conclusion?
a) p ∨ r
b) p ∨ s
c) q ∨ s
d) q ∨ r
20. “Parul is out for a trip or it is not snowing” and “It is snowing or Raju is playing chess” imply
that __________
a) Parul is out for trip
b) Raju is playing chess
c) Parul is out for a trip and Raju is playing chess
d) Parul is out for a trip or Raju is playing chess
21. Which of the following can only be used in disproving the statements?
a) Direct proof
b) Contrapositive proofs
c) Counter Example
d) Mathematical Induction
22. In proving √5 as irrational, we begin with assumption √5 is rational in which type of proof?
a) Direct proof
b) Proof by Contradiction
c) Vacuous proof
d) Mathematical Induction
23. A proof covering all the possible cases, such type of proofs are known as ___________
a) Direct proof
b) Proof by Contradiction
c) Vacuous proof
d) Exhaustive proof
25. Which of the arguments is not valid in proving sum of two odd number is not odd.
a) 3 + 3 = 6, hence true for all
b) 2n +1 + 2m +1 = 2(n+m+1) hence true for all
c) All of the mentioned
d) None of the mentioned
26. A theorem used to prove other theorems is known as _______________
a) Lemma
b) Corollary
c) Conjecture
d) None of the mentioned
27. The compound statement A-> (A->B) is false, and then the truth values of A, B are respectively
a) T, T
b) F, T
c) T, F
d) F, F
28. The compound propositions p and q are called logically equivalent if ________ is a tautology.
a) p ↔ q
b) p → q
c) ¬ (p ∨ q)
d) ¬p ∨ ¬q
29. The statement,” Every comedian is funny” where C(x) is “x is a comedian” and F (x) is “x is
funny” and the domain consists of all people, is represented using logical connectives, predicates and
quantifiers as
a) ∃x(C(x) ∧ F (x))
b) ∀x(C(x) ∧ F (x))
c) ∃x(C(x) → F (x))
d) ∀x(C(x) → F (x))
30. What rules of inference are used in this argument?
“Jay is an awesome student. Jay is also a good dancer. Therefore, Jay is an awesome student and a
good dancer.”
a) Conjunction
b) Modus ponens
c) Disjunctive syllogism
d) Simplification
Unit –II
16. 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 ____________
a) 6x + 9
b) 6x + 7
c) 6x + 6
d) 6x + 8
17. What is the domain of a function?
a) the maximal set of numbers for which a function is defined
b) the maximal set of numbers which a function can take values
c) it is a set of natural numbers for which a function is defined
d) none of the mentioned
18. Codomain is the subset of range.
a) True
b) False
19. A mapping f : X → Y is one one if __________
a) f(x1) ≠ f(x2) for all x1, x2 in X
b) If f(x1) = f(x2) then x1 = x2 for all x1, x2 in X
c) f(x1) = f(x2) for all x1, x2 in X
d) None of the mentioned
20. Floor (2.4) + Ceil (2.9) is equal to __________
a) 4
b) 6
c) 5
d) none of the mentioned
21. A ceil function map a real number to __________
a) smallest previous integer
b) greatest previous integer
c) smallest following integer
d) none of the mentioned
22. For an inverse to exist it is necessary that a function should be __________
a) injection
b) bijection
c) surjection
d) none of the mentioned
23. A function f(x) is defined from A to B then f -1 is defined __________
a) from A to B
b) from B to A
c) depends on the inverse of function
d) none of the mentioned
24. In the given AP series find the number of terms?
a)11
b)13
c)15
d) None of the mentioned
25. If in the truth table the answer column has the truth values both TRUE and FALSE then it is said
to be ________.
A. tautology
B. contradiction
C. contingency
D. equivalence relation
A. null set
B. finite set
C. singleton set
D. infinite set
a) A is a subset of B
b) B is a subset of A
a) ⌈n/2⌉+⌊n/2⌋
b) ⌈n/2⌉+⌈n/2⌉
c) ⌊n/2⌋+⌊n/2⌋
d) ⌊n/2⌋
29. A drawer contains 12 red and 12 blue socks, all unmatched. A person takes socks out at random
in the dark. How many socks must he take out to be sure that he has at least two blue socks?
a) 18
b) 35
c) 28
d) 14
30. A bag contains 25 balls such as 10 balls are red, 7 are white and 8 are blue. What is the minimum
number of balls that must be picked up from the bag blindfolded (without replacing any of it) to be
assured of picking at least one ball of each colour?
a) 10
b) 18
c) 63
d) 35
Unit –III
1. There are 70 patients admitted in a hospital in which 29 are diagnosed with typhoid, 32 with
malaria, and 14 with both typhoid and malaria. Find the number of patients diagnosed with
typhoid or malaria or both.
a) 39
b) 17
c) 47
d) 53
a) 349
b) 54
c) 213
d) 303
a) (1+6x)/x3
b) 1/(1−6x)
c) 1/(1−4x)
d) 1-6x2
11. Determine the value of a2 for the recurrence relation an = 17an-1 + 30n with a0=3.
a) 4387
b) 5484
c) 238
d) 1437
12. The solution to the recurrence relation an=an-1+2n, with initial term a0=2 are
a) 4n+7
b) 2(1+n)
c) 3n2
d) 5*(n+1)/2
13. Which of the following is a correct representation of inclusion exclusion principle (|A,B|
represents intersection of sets A,B)?
a) |A U B|=|A|+|B|-|A,B|
b) |A,B|=|A|+|B|-|A U B|
c) |A U B|=|A|+|B|+|A,B|
d) |A,B|=|A|+|B|+|A U B|
14. Which of the following is not an application of inclusion-exclusion principle?
a) Counting intersections
b) Graph coloring
c) Matching of bipartite graphs
d) Maximum flow problem
15. Who invented the concept of inclusion-exclusion principle?
a) Abraham de Moivre
b) Daniel Silva
c) J.J. Sylvester
d) Sieve
16. With reference to the given Venn diagram, what is the formula for computing |AUBUC|
(where |x, y| represents intersection of sets x and y)?
a) |A U B U C|=|A|+|B|+|C|-|A,B|-|A,C|-|B,C|+|A, B,C|
b) |A, B,C|=|A|+|B|+|C|-|A U B|-|A U C|-|B U C|+|A U B U C|
c) |A, B,C|=|A|+|B|+|C|+|A,B|-|A,C|+|B,C|+|A U B U C|
d) |A U B U C|=|A|+|B|+|C| + |A,B| + |A,C| + |B,C|+|A, B,C|
17. Determine the solution for the recurrence relation an = 6an-1−8an-2 provided initial conditions
a0=3 and a1=5.
a) an = 4 * 2n – 3n
b) an = 3 * 7n – 5*3n
c) an = 5 * 7n
d) an = 3! * 5n
18. Determine the solution for the recurrence relation bn=8bn-1−12bn-2 with b0=3 and b1=4.
a) 7/2*2n−1/2*6n
b) 2/3*7n-5*4n
c) 4!*6n
d) 2/8n
19. If Sn=4Sn-1+12n, where S0=6 and S1=7, find the solution for the recurrence relation.
a) an=7(2n)−29/6n6n
b) an=6(6n)+6/7n6n
c) an=6(3n+1)−5n
d) an=nn−2/6n6n
20. What is the sequence depicted by the generating series 4 + 15x2 + 10x3 + 25x5 + 16x6+⋯?
a) 10, 4, 0, 16, 25, …
b) 0, 4, 15, 10, 16, 25,…
c) 4, 0, 15, 10, 25, 16,…
d) 4, 10, 15, 25,…
21. What is the generating function for the generating sequence A = 1, 9, 25, 49,…?
a) 1+(A-x2)
b) (1-A)-1/x
c) (1-A)+1/x2
d) (A-x)/x3
22. What will be the sequence generated by the generating function 4x/(1-x)2?
a) 12, 16, 20, 24,…
b) 1, 3, 5, 7, 9,…
c) 0, 4, 8, 12, 16, 20,…
d) 0, 1, 1, 3, 5, 8, 13,…
23. What is the recurrence relation for the sequence 1, 3, 7, 15, 31, 63,…?
a) an = 3an-1−2an+2
b) an = 3an-1−2an-2
c) an = 3an-1−2an-1
d) an = 3an-1−2an-3
24. In class, students want to join sports. 15 people will join football, 24 people will join
basketball, and 7 people will join both. How many people are there in the class?
a) 19
b) 82
c) 64
d) 30
25. At a software company, skilled workers have been hired for a project. Out of 75 candidates,
48 of them were software engineer; 35 of them were hardware engineer; 42 of them were
network engineer; 18 of them had skills in all three jobs and all of them had skills in at least one
of these jobs. How many candidates were hired who were skilled in exactly 2 jobs?
a) 69
b) 14
c) 32
d) 8
A. Previous terms.
27. Let {an} be a sequence that satisfies the recurrence relation a n= an-1+ an-2 for n=2,3,4…..and suppose
A. a2=2, a3=3
B. a2=2, a3=-3
C. a2=-2, a3=3
D. a2=-2, a3=-3
28. A recurrence relation of the form C0 an+C1 an-1+C2 an-2.+………….+Ck an-k=f(n).if f(n)=0 then the
recurrence relation is called as
29. if r1 and r2 are the real and distinct roots of the recurrence relation of the form
an=A.an-1+B.an-2.then the solution of recurrence relation is------------------------
A. an=A.r
1 n+B.r
2 n
B. an=(A+B)r 1n
C. an=(A+B)r2n
30. If r1 and r2 are the real and equal roots of the recurrence relation of the form a n=A.an-1+B.an-2.then
A. an=A.r
1 n+B.r
2 n
B. an=(A+Bn)rn
C. an=(A+B)rn
Unit –IV
1. The binary relation {(1,1), (2,1), (2,2), (2,3), (2,4), (3,1), (3,2)} on the set {1, 2, 3} is
a) reflective, symmetric and transitive
b) irreflexive, symmetric and transitive
c) neither reflective, nor irreflexive but transitive
d) irreflexive and antisymmetric
a) not a partial ordering because it is not asymmetric and irreflexive equals antisymmetric
5. Suppose a relation R = {(3, 3), (5, 5), (5, 3), (5, 5), (6, 6)} on S = {3, 5, 6}. Here R is
known as
a) equivalence relation
b) reflexive relation
c) symmetric relation
d) transitive relation
6. Which of the following relations is the reflexive relation over the set {1, 2, 3, 4}?
a) 2110
b) 3121
c) 290
d) 2132
8. If a set A has 8 elements and a set B has 10 elements, how many relations are there from A
to B?
a) 290
b) 380
c) 164
d) 280
10. .If every two elements of a poset are comparable then the poset is called
a) sub ordered poset
b) totally ordered poset
c) sub lattice
d) semi group
11. The transitive closure of the relation {(0,1), (1,2), (2,2), (3,4), (5,3), (5,4)} on the set {1, 2, 3,
4, 5} is
a) {(0,1), (1,2), (2,2), (3,4)}
b) {(0,0), (1,1), (2,2), (3,3), (4,4), (5,5)}
c) {(0,1), (1,1), (2,2), (5,3), (5,4)}
d) {(0,1), (0,2), (1,2), (2,2), (3,4), (5,3), (5,4)}
12. Let R be an equivalence relation on a set S. Then R need NOT satisfy the property:
a) Reflexive
b) Symmetric
c)Anti-symmetric
d)Transitive
13. A relation is reflexive if in the graphical representation of relation, every node has a loop.
a) True
b) False
14. Let A = {1, 2, 3, 4} and R be a relation in A given by R = {(1, 1), (2, 2), (3, 3), (4, 4), (1,
2), (2, 1), (3, 1), (1, 3) }. Then R is
(a) reflexive
(b) Symmetric
(c) Transitive
15. Suppose a relation R = {(3, 3), (5, 5), (5, 3),(3,5) (5, 5), (6, 6)} on S = {3, 5, 6}. Here R is
known as
a) equivalence relation
b) reflexive relation
c) symmetric relation
d) transitive relation
17. A Poset in which every pair of elements has both a least upper bound and a greatest lower
bound is termed as
a) Sub lattice
b) Lattice
c) Trail
d) Walk
18. If a relation is reflexive, then all the diagonal entries in the relation matrix must
be .
A. 0
B. 1
C. 2
a) 290
b) 2100
c) 281
d) 260
20. Let A = {1, 2, 3} and B = {u, v, w}. Then which of the following is NOT a relation from
A to B?
a) {(1, v)}
c) {(3, v)}
b) Lattices
c) Boolean algebra
A. 6
B. 8
C. 32
D. 64
23. Let R = {(3, 3), (6, 6), (9, 9), (12,12), (3,6), (6,3), (3, 9), (9, 3), (9, 12),(12,9)} be a relation
D. equivalence relation
S= .
A. {(1,b),(3,d),(2,b)}
B. {(1,4),(3,a),(2,4)}
C. {(4,b),(2,5),(3,a)}
D. {(1,d),(3,b),(2,c)}
25. Let R={(1, 3), (4, 2), (2, 2), (3, 3), (1, 1),(4,4)} be a relation on the set A={1, 2, 3, 4}. The
relation R is .
A. transitive
B. reflexive
C. not symmetric
D. function
30. Which of the following relations is the anti-symmetric relation over the set {1, 2, 3, 4}?
a) {(0,0), (1,1), (2,2), (2,3)}
b) {(1,1), (1,2), (2,1), (3,3), (4,3), (4,4)}
c) {,(1,1), (1,2), (2,1), (2,3), (3,4)}
d) {(0,1), (1,1), (2,3), (2,2), (3,2), (3,1)}
A) B and E
B) C and D
C) A and E
D) C and B
B. 2
C. odd
D. even
A) True
B) False
A) 15
B) 3
C) 1
D) 11
6. Kn denotes graph.
A. regular
B. simple
C. complete
D. null
A. path
B. cycle
C. vertex
D. edge
A) Multi Graph
B ) Regular Graph
C) Simple Graph
D) Complete Graph
B) Incidence Matrix
D) No way to represent
10. Minimum number of unique colours required for vertex colouring of a graph is called?
A) Vertex matching
B) Chromatic index
C) Chromatic number
D) Color number
a) n–1
b) n
c) n+1
d) n/2
12). A graph with no edges is known as empty graph. Empty graph is also known as... ?
a. Trivial graph
b. Regular graph
c. Bipartite graph
D. both b and c
14. The maximum degree of any vertex in a simple graph with n vertices is
A. n–1
B. n+1
C.2n–1
D. n
A. Endpoints of e
B. Adjacent nodes
C. Neighbors
D. All of above
17. The problem of finding a path in a graph that visits every vertex exactly once is called?
18. What would be the number of zeros in the adjacency matrix of the given graph?
a) 10
b) 6
c) 16
d) 0
19. Dijkstras Algorithm will work for both negative and positive weights?
a)True
b) False
a)multigraph
b) Digraph
c) Isolated graph
d) Trivial graph
a) n-1
b) n
c) n(n-1)/2
d) n(n+1)/2
a) Only two vertices are of odd degree and rests are even
b) Only two vertices are of even degree and rests are odd
23. Which one of the following is TRUE for any simple connected undirected graph with
more than 2 vertices?
a) No two vertices have the same degree.
b) At least two vertices have the same degree.
c) At least three vertices have the same degree.
d) All vertices have the same degree.
c) Equations
25. The total number of degrees in a graph is 20. How many edges does it
have? a)40
b) 20
c) 10
d) 5
27. The maximum degree of any vertex in a simple graph with n vertices is
a. n–1
b. n+1
c. 2n–1
d. n
a) A graph drawn in a plane in such a way that any pair of edges meet only at their end vertices
b) A graph drawn in a plane in such a way that if the vertex set of graph can be partitioned into
two non - empty disjoint subset X and Y in such a way that each edge of G has one end in X
and one end in Y
a) 0
b) 1
c) 2
d) 3