OBJECTIVES ON DISCRETE STRUCTURE

PREPARED BY: PROF. POOJA DHULE

COLLEGE NAME: MMCOE, PUNE
No Question Answer
1 Let A and B be sets. A is a _________ of B, if, and only if, D
every element of A is in B but there is at least one element of
B that is not in A.
a) Union b) Real set c) Subset d) Proper Subset

2 Every set is subset of itself. A

a) True b) False
3 A well defined collection of distinct objects is called as_____ C
a) Union b) Element c) Set d) Member of set

4 The Universal Set is represented by the interior of a rectangle, A

and the other sets are represented by disks lying within the
rectangle.
a) True b) False
5 Empty set is not subset of every set. B
a) True b) False
6 A Venn diagram is a graphical representation of sets by A
regions in the plane.
a) True b) False
7 It the results of two sets is Ф then it is called C
a) Real b) Pictorial c) Disjoint d) Joint

8 The difference set is C

a) All are wrong b) In A & B c) In A but not in B
d) In A & B-A

9 Let A be a subset of Universal set U. The complement of A is D

the set of all elements in U that do not belong to “A” is called
_________.
a) None b) Complement of U c) Difference of A
d) Complement of U

10 A= {1,2} and B={a, b, c} then A* A ={(1,1), (1,2), (2,1), A

(2,2)}
a) True b) False
11 The _________of a relation R from A to B is the set of all A
second elements of the ordered pairs, which belongs to R,
denoted Ran(R).
a) Range b) Domain
12 Which of the following statement is the negation of the D
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.
13 A partial ordered relation is transitive, reflexive and A
(A) antisymmetric. (B) bisymmetric.
(C) antireflexive. (D) asymmetric.
14 Let N = {1, 2, 3, ….} be ordered by divisibility, which of the A
following subset is totally
ordered,
(A) (24, 6, 2). (B) (15, 5, 3).
(C) (16, 9 ,2 ). (D) (15, 4 30 , ).
15 p → q is logically equivalent to D
(A) ~ q → p (B) ~ p → q
(C) ~ p ∧ q (D) ~ p ∨ q
16 ~ q ∧ (p → q)]→~ p is C
(A) Satisfiable. (B) Unsatisfiable.
(C) Tautology. (D) Invalid.
17 For a relation R on set A, let M [m ] , m 1 R = ij ij = if iRa j B
a and 0 otherwise, be the matrix of
relation R. If ( )2 M = R MR then R is,
(A) Symmetric (B) Transitive
(C) Antisymmetric (D) Reflexive
18 The statement ( p∧q) ⇒ p is a C
(A) Contingency. (B) Absurdity
(C) Tautology (D) None of the above
19 The relation { (1,2), (1,3), (3,1), (1,1), (3,3), (3,2), (1,4), (4,2), B
(3,4)} is
(A) Reflexive. (B) Transitive.
(C) Symmetric. (D) Asymmetric.
20 A tree with n vertices has _____ edges D
(A) n (B) n+1
(C) n-2 (D) n-1
21 Which of the following statement is true: D
(A) Every graph is not its own sub graph.
(B) The terminal vertex of a graph are of degree two.
(C) A tree with n vertices has n edges.
(D) A single vertex in graph G is a sub graph of G.
22 Pigeonhole principle states that A→B and A > B then: B
(A) f is not onto (B) f is not one-one
(C) f is neither one-one nor onto (D) f may be one-one
23 A graph in which all nodes are of equal degrees is known as: B
(A) Multigraph (B) Regular graph
 (C) Complete lattice (D) non regular graph
24 A binary Tree T has n leaf nodes. The number of nodes of A
degree 2 in T is:
(A) log n (B) n
(C) n-1 (D) n+1
25 In how many ways can a party of 7 persons arrange A
themselves around a circular table?
(A) 6! (B) 7!
(C) 5! (D) 7
26 In how many ways can a hungry student choose 3 toppings for B
his prize from a list of 10 delicious possibilities?
(A) 100 (B) 120
(C) 110 (D) 150
27 A debating team consists of 3 boys and 2 girls. Find the A
number of ways they can sit in a row?
(A) 120 (B) 24
(C) 720 (D) 12
28 Suppose v is an isolated vertex in a graph, then the degree of v A
is:
(A) 0 (B) 1
(C) 2 (D) 3
29 Let p be “He is tall” and let q “He is handsome”. Then the B
statement “It is false that he is
short or handsome” is:
(A) p ∧ q (B) ~ (~ p ∨ q)
(C) p∨ ~ q (D) ~ p ∧ q
30 Which of the following statement is true: D
(A) Every graph is not its own subgraph
(B) The terminal vertex of a graph are of degree two.
(C)A tree with n vertices has n edges.
(D)A single vertex in graph G is a subgraph of G.
31 Which of the following proposition is a tautology? C
(A) (p v q)→p (B) p v (q→p)
(C) p v (p→q) (D) p→(p→q)
32 The length of Hamiltonian Path in a connected graph of n A
vertices is
(A) n–1 (B) n
(C) n+1 (D) n/2
33 If R is a relation “Less Than” from A = {1,2,3,4} to B = C
{1,3,5} then RoR-1 is
(A) {(3,3), (3,4), (3,5)}
(B) {(3,1), (5,1), (3,2), (5,2), (5,3), (5,4)}
(C) {(3,3), (3,5), (5,3), (5,5)}
(D) {(1,3), (1,5), (2,3), (2,5), (3,5), (4,5)}
34 Which one is the contrapositive ofq → p ? B
(A) p → q (B) ¬p → ¬q
 (C) ¬q → ¬p (D) None of these
35 A Euler graph is one in which D
(A) Only two vertices are of odd degree and rests are even
(B) Only two vertices are of even degree and rests are odd
(C) All the vertices are of odd degree
(D) All the vertices are of even degree
36 A spanning tree of a graph is one that includes A
(A) All the vertices of the graph
(B) All the edges of the graph
(C) Only the vertices of odd degree
(D) Only the vertices of even degree