MTH202 Final Term 2009 Paper

http://vujannat.ning.
com
Best Website To Help VUStudents
FINALTERM EXAMINATION
Fall 2009
MTH202- Discrete Mathematics
Ref No: 1294813
Time: 120 min
Marks: 80
For Teacher's Use Only

Q No. 1 2 3 4 5 6 7 8 Total
Marks
Q No. 9 10 11 12 13 14 15 16
Marks
ts
en
Q No. 17 18 19 20 21 22 23 24
ud
Marks
St
el m
Q No. 25 26 27 VU 28 29 30 31 32
H .co
Marks
p
To ing
Q No. 33 34 35 36 37 38 39 40
te .n
si at
Marks
eb nn
W ja
Q No. 41 42 43 44 45 46 47 48
st //vu
Marks
Be tp:
Q No. 49 50
ht
Marks
http://vujannat.ning.com
Question No: 1 ( Marks: 1 ) - Please choose one
The negation of “Today is Friday” is
► Today is Saturday
► Today is not Friday
► Today is Thursday
ts
en
ud
St
el m
VU
H .co
p
To ing
In method of proof by contradiction, we suppose the statement to be proved is

te .n
false.
si at
eb nn
W ja
► True
st //vu
► False
Be tp:
ht
Whether the relation R on the set of all integers is reflexive, symmetric,

( x, y ) ∈ R xy ≥ 1
antisymmetric, or transitive, where if and only if
► Antisymmetric
► Transitive
► Symmetric
► Both Symmetric and transitive
The inverse of given relation R = {(1,1),(1,2),(1,4),(3,4),(4,1)} is
► {(1,1),(2,1),(4,1),(2,3)}
► {(1,1),(1,2),(4,1),( 4,3),(1,4)}
► {(1,1),(2,1),(4,1),(4,3),(1,4)}
ts
en
ud
St
el m
VU
H .co
A circuit with one input and one output signal is called.

p
To ing
te .n
si at
eb nn
► NOT-gate (or inverter)

W ja
st //vu
► OR- gate
Be tp:
ht
► AND- gate
► None of these
A sequence in which common difference of two consecutive terms is same is

called
► geometric mean
► harmonic sequence
► geometric sequence
► arithmetic progression
ts
{an } = 2. ( −3)
en
n
+ 5n a!
If the sequence then the term is
ud
St
► -1
el m
VU
H .co
►0
p
To ing
►1
te .n
si at
►2
eb nn
W ja
st //vu

Be tp:
ht
How many integers from 1 through 100 must you pick in order to be sure of
getting one that is divisible by 5?
► 21
► 41
► 81
► 56
What is the probability that a randomly chosen positive two-digit number

is a multiple of 6?
► 0.5213
► 0.167
► 0.123
ts
en
ud
If a pair of dice is thrown then the probability of getting a total of 5 or 11 is
St
el m
VU
H .co
1
p
To ing
18
te .n
►
si at
eb nn
1
W ja
9
st //vu
►
Be tp:
1
ht
6
►
If a die is rolled then what is the probability that the number is greater than 4
1
3
►
3
4
►
1
2
►
ts
en
ud
If a coin is tossed then what is the probability that the number is 5
St
el m
VU
H .co
1
p
To ing
2
te .n
►
si at
eb nn
►0
W ja
►1
st //vu
Be tp:
ht
If A and B are two sets then The set of all elements that belong to both A and
B , is
►A∪B
►A∩B
► A--B
► None of these
If A and B are two sets then The set of all elements that belong to A but not B , is
ts
en
ud
►A∪B
St
el m
VU
H .co
p
To ing
►A∩B
te .n
si at
eb nn
► None of these
W ja
st //vu
► A--B
Be tp:
ht
If A, B and C are any three events, then
P(A∪B∪C) is equal to
► P(A) + P(B) + P(C)
► P(A) + P(B) + P(C)- P(A∩B) - P (A ∩C) - P(B ∩C) + P(A ∩B ∩C)
► P(A) + P(B) + P(C) - P(A∩B) - P (A ∩C) - P(B ∩C)
► P(A) + P(B) + P(C) + P(A ∩B ∩C)
If a graph has any vertex of degree 3 then
► It must have Euler circuit
ts
en
► It must have Hamiltonian circuit
ud
► It does not have Euler circuit
St
el m
VU
H .co
p
To ing

te .n
si at
eb nn
The contradiction proof of a statement pÆq involves

W ja
st //vu
► Considering p and then try to reach q

Be tp:
ht
► Considering ~q and then try to reach ~p
► Considering p and ~q and try to reach contradiction
► None of these
How many ways are there to select a first prize winner a second prize winner, and a
third prize winner from 100 different people who have entered in a contest.
► None of these
► P(100,3)
ts
en
ud
► P(100,97)
St
el m
VU
H .co
► P(97,3)
p
To ing
te .n
si at
eb nn

W ja
st //vu
A vertex of degree 1 in a tree is called a

Be tp:
ht
► Terminal vertex
► Internal vertex
Suppose that a connected planar simple graph has 30 edges. If a plane drawing
of this graph has 20 faces, how many vertices does the graph have?
► 12
► 13
► 14
How many different ways can three of the letters of the word BYTES be chosen if
the first letter must be B ?
► P(4,2)
ts
en
ud
► P(2,4)
St
el m
VU
H .co
► C(4,2)
p
To ing
te .n
► None of these
si at
eb nn
W ja
st //vu

Be tp:
ht
For the given pair of graphs whether it is
ts
en
ud
St
el m
VU
H .co
p
To ing
te .n
► Isomorphic
si at
eb nn
W ja
► Not isomorphic
st //vu
Be tp:
ht
On the set of graphs the graph isomorphism is
► Isomorphic Invariant
► Equivalence relation
► Reflexive relation
A matrix in which number of rows and columns are equal is called
► Rectangular Matrix
► Square Matrix
► Scalar Matrix
ts
If the transpose of any square matrix and that matrix are same then matrix is
en
called
ud
St
► Additive Inverse
el m
VU
H .co
► Hermition Matrix
p
To ing
► Symmetric Matrix
te .n
si at
eb nn

W ja
st //vu
The number of k-combinations that can be chosen from a set of n elements can be
Be tp:
written as
ht
n
► Ck
k
► Cn
n
► Pk
k
► Pk
The value of C(n, 0) =
►1
►0
►n
► None of these
ts
en
ud
St
el m
VU
H .co
If the order does not matter and repetition is not allowed then total number of
p
To ing
ways for selecting k sample from n. is

te .n
si at
eb nn
► P(n,k)
W ja
st //vu
► C(n,k)
Be tp:
ht
► nk
► C(n+k-1,k)
If A and B are two disjoint sets then which of the following must be true
► n(A∪B) = n(A) + n(B)
► n(A∪B) = n(A) + n(B) - n(A∩B)
► n(A∪B)= ø
► None of these
ts
en
Among 200 people, 150 either swim or jog or both. If 85 swim and 60 swim and jog,
how many jog?
ud
St
el m
► 125 VU
H .co
p
To ing
► 225
te .n
si at
eb nn
► 85
W ja
st //vu
► 25
Be tp:
ht
If two sets are disjoint, then P∩Q is
►∅
►P
►Q
► P∪Q
Every connected tree
► does not have spanning tree
► may or may not have spanning tree
► has a spanning tree
ts
en
ud
St
When P(k) and P(k+1) are true for any positive integer k, then P(n) is not true for
el m
all +ve Integers. VU
H .co
► True
p
To ing
te .n
► False
si at
eb nn
W ja

st //vu
Be tp:
When 3k is even, then 3k+3k+3k is an odd.

ht
► True
► False
5n -1 is divisible by 4 for all positive integer values of n.
► True
► False
Quotient –Remainder Theorem states that for any positive integer d, there exist
unique integer q and r such that n=d.q+ r and _______________.
► 0≤r<d
► 0<r<d
► 0≤d<r
ts
► None of these
en
ud
St
el m
VU
H .co
p
To ing
The given graph is

te .n
si at
eb nn
W ja
st //vu
Be tp:
ht
► Simple graph
► Complete graph
► Bipartite graph
► Both (i) and (ii)
► Both (i) and (iii)
An integer n is even if and only if n = 2k for some integer k.
► True
ts
en
ud
St
► False
el m
VU
H .co
p
To ing
te .n
► Depends on the value of k

si at
eb nn
W ja
st //vu

Be tp:
ht
The word "algorithm" refers to a step-by-step method for performing some

action.
► True
► False
► None of these
The adjacency matrix for the given graph is
ts
en
ud
St
el m
⎡0 1 1 0 0⎤ VU
H .co
⎢1 0 0 1 0⎥
⎢ ⎥
p
To ing
⎢1 0 01 1⎥
te .n
⎢ ⎥
si at
⎢0 0 1 0 1⎥
eb nn
⎢⎣1 0 01 0 ⎥⎦
W ja
st //vu
Be tp:
►
ht
⎡0 1 1 0 1⎤
⎢1 0 0 0 0⎥
⎢ ⎥
⎢1 0 0 1 1⎥
⎢ ⎥
⎢0 0 1 0 1⎥
⎢⎣1 0 1 1 0 ⎥⎦
⎡0 1 0 0 1⎤
⎢1 0 0 0 0⎥
⎢ ⎥
⎢1 0 0 1 0⎥
⎢ ⎥
⎢0 0 1 0 1⎥
⎢⎣0 0 1 1 0 ⎥⎦
► None of these
ts
en
ud
St
Question No: 41 ( Marks: 2 )
el m
VU
H .co
Let A and B be events with

p
To ing
te .n
1 1 1
P ( A) = , P( B) = and P( A ∩ B) =
si at
2 3 4
eb nn
Find
W ja
P( B | A)
st //vu
Be tp:
Ans =
ht
P(A ∩ B) = P(A) P(B|A)
P(B|A)= P(A ∩ B)/ P(A)
= 0.5
Suppose that a connected planar simple graph has 15 edges. If a plane drawing of
this graph has 7 faces, how many vertices does this graph have?
Vertices-edges+faces=2
V - 15 +7=2
V -8 = 2
V =10
Find integers q and r so that a=bq+r , with 0≤r<b.

a=45 , b=6.
Draw a graph with six vertices, five edges that is not a tree.
ts
en
ud
St
el m
VU
H .co
Asn:
p
To ing
Here is the graph with six vertices, five edges that is not a tree
te .n
si at
eb nn
W ja
st //vu
Be tp:
ht
Prove that every integer is a rational number.
Ans:
Every integer is a rational number, since each integer n can be written in the form
n/1. For example 5 = 5/1 and thus 5 is a rational number. However, numbers like
1/2, 45454737/2424242, and -3/7 are also rational; since they are fractions whose
numerator and denominator are integers.
a. Evaluate P(5,2)
b. How many 4-permutations are there of a set of seven
objects?
Find the GCD of 500008, 78 using Division Algorithm.
ts
en
ud
St
el m
VU
H .co
There are 25 people who work in an office together. Four of these people are
p
To ing
selected to attend four different conferences. The first person selected will go to a
te .n
conference in New York, the second will go to Chicago, the third to San
si at
Franciso, and the fourth to Miami. How many such selections are possible?
eb nn
W ja
Ans= 12650
st //vu
Be tp:

ht
Consider the following graph
v1 v4
(a) How many simple paths are there from to ====1
v1 v4
(b) How many paths are there from to ?===========3
v1 v4
(c) How many walks are there from to ?==========3
ts
In the graph below, determine whether the following walks are paths, simple
en
paths, closed walks, circuits,
ud
simple circuits, or are just walk?
St
el m
VU
H .co
p
To ing
te .n
si at
eb nn
W ja
st //vu
i) v0 e1 v1 e10 v5 e9 v2 e2 v1== paths

Be tp:
ii) v4 e7 v2 e9 v5 e10 v1 e3 v2 e9 v5========, circuits

ht
iii) v2========== closed walks

iv) v5 v2 v3 v4 v4v5=========== closed walks
v) v2 v3 v4 v5 v2v4 v3 v2========= paths

MTH202 Final Term 2009 Paper

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

MTH202 Final Term 2009 Paper

Uploaded by

Copyright:

Available Formats

http://vujannat.ning.

For Teacher's Use Only

Question No: 1 ( Marks: 1 ) - Please choose one

The negation of “Today is Friday” is

► Today is not Friday

In method of proof by contradiction, we suppose the statement to be proved is

Question No: 3 ( Marks: 1 ) - Please choose one

Whether the relation R on the set of all integers is reflexive, symmetric,

► Both Symmetric and transitive

Question No: 4 ( Marks: 1 ) - Please choose one

The inverse of given relation R = {(1,1),(1,2),(1,4),(3,4),(4,1)} is

A circuit with one input and one output signal is called.

► NOT-gate (or inverter)

Question No: 6 ( Marks: 1 ) - Please choose one

A sequence in which common difference of two consecutive terms is same is

Question No: 7 ( Marks: 1 ) - Please choose one

Question No: 8 ( Marks: 1 ) - Please choose one

Question No: 9 ( Marks: 1 ) - Please choose one

What is the probability that a randomly chosen positive two-digit number

Question No: 10 ( Marks: 1 ) - Please choose one

Question No: 11 ( Marks: 1 ) - Please choose one

Question No: 12 ( Marks: 1 ) - Please choose one

Question No: 13 ( Marks: 1 ) - Please choose one

Question No: 14 ( Marks: 1 ) - Please choose one

Question No: 15 ( Marks: 1 ) - Please choose one

If A, B and C are any three events, then

► P(A) + P(B) + P(C)

► P(A) + P(B) + P(C)- P(A∩B) - P (A ∩C) - P(B ∩C) + P(A ∩B ∩C)

► P(A) + P(B) + P(C) - P(A∩B) - P (A ∩C) - P(B ∩C)

► P(A) + P(B) + P(C) + P(A ∩B ∩C)

Question No: 16 ( Marks: 1 ) - Please choose one

If a graph has any vertex of degree 3 then

► It must have Euler circuit

Question No: 17 ( Marks: 1 ) - Please choose one

The contradiction proof of a statement pÆq involves

► Considering p and then try to reach q

► Considering ~q and then try to reach ~p

► Considering p and ~q and try to reach contradiction

Question No: 18 ( Marks: 1 ) - Please choose one

Question No: 19 ( Marks: 1 ) - Please choose one

A vertex of degree 1 in a tree is called a

Question No: 20 ( Marks: 1 ) - Please choose one

Question No: 21 ( Marks: 1 ) - Please choose one

Question No: 22 ( Marks: 1 ) - Please choose one

For the given pair of graphs whether it is

Question No: 23 ( Marks: 1 ) - Please choose one

On the set of graphs the graph isomorphism is

Question No: 24 ( Marks: 1 ) - Please choose one

A matrix in which number of rows and columns are equal is called

Question No: 25 ( Marks: 1 ) - Please choose one

Question No: 26 ( Marks: 1 ) - Please choose one

Question No: 27 ( Marks: 1 ) - Please choose one

The value of C(n, 0) =

ways for selecting k sample from n. is

Question No: 29 ( Marks: 1 ) - Please choose one

► n(A∪B) = n(A) + n(B)

► n(A∪B) = n(A) + n(B) - n(A∩B)

Question No: 30 ( Marks: 1 ) - Please choose one

Question No: 31 ( Marks: 1 ) - Please choose one

If two sets are disjoint, then P∩Q is

Question No: 32 ( Marks: 1 ) - Please choose one

Every connected tree

► does not have spanning tree

► may or may not have spanning tree