0% found this document useful (0 votes)
43 views3 pages

DMGT Modal Paper

Uploaded by

resoce3697
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
43 views3 pages

DMGT Modal Paper

Uploaded by

resoce3697
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Part-A

2
1a | Define logically equivalent for compound propositions.
2
1b | Explain Modus pones and Modus tollen’s rules.

2.a | Define reflexive relation. 2

e. 2
2.b | Prove that the inverse of an element in a group is uniqu
2
3.a | Find ¢(20). (#-Euler’s Phi function)

3.b | Verify whether the integer 133 is prin;e or not. 2

4.a | Define Fibonacci recurrence relation. 2

5
ab Determine the order and degree of the recurrence relation
u,,, +i,, +u, =0, vnz0.
ple. 2
5.a | Define Complete bipartite graph and give a suitable exam
2
5.b | Explain Hamiltonian graph.

Part-B
UNIT-I

a) (i) Find principal conjunctive normal form of


10
[p—)(Q/\r)]/\[—‘p—)(—‘q/\—‘r)]‘
6 s of
(ii) What are connectives? Explain different type
connectives.
(OR)
B8) (1) Show that 5™ is a valid conclusion from the prumiscs
P g gV s > pLoar
(1) Show that the tollowing set of premises is inconsistent: “If
the contract is valid, then John is liable 10
for penalty. If John is
liable for penalty, he will 2o bankrupt. If the
bank will loan him
- money. he will not go bankrupt. As a matter of fact,
the contract |
s valid and the bank will loan him money™.
|
UNIT-Il
| A} (i) Prove that a binary relation Ris defined on a set of
| .. .
|
| positive integers as xRy < x =y (mod m)is. an equiva
.
lence
l relation.
10
l (i) Show that S = {[\ 1} /xeR *} is a group under
X X

multipfication of matrices. Is it commutative?


(OR)

B) (i) Let X ={1, 2,3,6,10,15, 30} and arelation 'R' be such [


that xRy if x divides y. Draw the Hasse diagram of a poset "
(X, R).
(ii) Show that the set.of all cube roots of unity forms an abelian
group w.r.to the binary operation of multiplication.
UNIT-1

A) (i) (a) In how many ways can six men and four women sit in a
row?
(b) In how many ways can they sit in a row if all the men sit
together and all the women sit together?
(c) In how many ways can they sit in a row if just the women 10
sit together?
(d) In how many ways can they sit in a row if just the men sit
together?
(ii) State and prove Pascal’s Identity.
(0R)
B) (i) State and prove Fermat’s theorem.
(i) Find the ged (1,000, 625) and /lem (1,000, 625) using
prime factorization and verify that 10
2ed (1,000, 625)xIem (1,000, 625) =1,000x 625.

UNIT-IV

A)
D
(i) Solve a, =a, |+ ————,
I n21, a, =2by using
) o
u(n+ l) 0
substitution method.
1
(ii) Apply the method of generating function to solve the
following recurrence relation: a, =3a, | —4a, , =4", n>2.
(OR)
B) (i) Apply the method of penerating function to solve the
following recurrence relation:
a,~7a, +10a,_, =0+8n,n=2,a,=1,a =2, 10
1 0

(i) Solve the recurrence relation


a,—2a,_+a,_,=2,n22,
P - =
a, ==25 a =16.
.

UNIT-V

A)(1) State and Prove Euler’s formula for a plane connected


graphs.

(ii) Show that the following graphs are not isomorphic.


10

‘/ o 6:L\j (3

]/>1 T
TN
(i}

\\" .

(F—{a €Y

(OR)
10

B)(i) Discuss in brief about BFS algorithm of a graph.


(ii) Apply Prim’s algorithm to find a minimum spanning tree in
the weighted graph
5
Ca>
|
/7 10

fi \ ls ///'/ 14
A

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy