Scribd
Upload
25 views9 pages

SET-1 - Key

Uploaded by

saicharanghantasala64
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
25 views9 pages

SET-1 - Key

Uploaded by

saicharanghantasala64
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/ 9

Student Id: Student Name:

Academic year: 2023-24


Sem-In Examinations-II,
B. Tech. (AIDS,CSE,CSIT,ECE), 2023 Batch I/IV, ODD Semester
Subject Code: 23MT1002
TITLE: Discrete Structures
Time: 2 hours Max. Marks: 50
(Assume any missing data suitably and design adequate hypothesis, if required)
CO1 Max. Marks Mark
25 s
Answer ALL Questions
1.a How many permutations of the letters ABCDEFGH contain the string ABC? 2M

So, we have 5 remaining letters (DEFGH) and 1 entity (ABC) for a total of
6 "elements." The number of permutations of these 6 elements is 6!6!
(6 factorial), which is the product of all positive integers up to 6.

6!=6×5×4×3×2×1=7206!=6×5×4×3×2×1=720

b There are 10 people at a party who shakes hands with each other. If each two 2M
of them shake hands with each other, how many handshakes happen at the
party?

To find the number of handshakes in a group where each person


shakes hands with every other person, you can use the formula for
combinations.

The number of handshakes H can be calculated using the formula:

H=2n×(n−1)

where n is the number of people.

In this case, n=10, so:

H=210×(10−1)=210×9=290=45

So, there are 45 handshakes that happen at the party.

c 2M
Write the Pigeonhole principle.
"If n objects are placed into m pigeonholes and n>m, then at least one
pigeonhole must contain more than one object."

d 2M
Write the degree of each vertex of a graph:

V1 V2 V3

V5
V4

Vertices V1 V2 V3 V4 V5
Degree 5 3 5 4 1
e Write the in-degrees of each vertex in the directed graph G? 2M

Vertices A B C D E f

Indegree 2 2 3 2 3 0

f 2M
Draw a regular graph of degree 3.

2a Determine the solution of recurrence relation Fn =2Fn−1−2Fn−2 4M


where F0=1 and F1=3.

The characteristic equation is obtained by assuming a solution of the


form Fn=rn and substituting it into the recurrence relation:
A=1: B=2

b Use generating functions to solve the non-homogenous recurrence relation 𝑎𝑛 = 4M


3𝑎𝑛−1 + 2 for k=1,2,3- -- with the initial condition 𝑎0 = 2.

c Draw the digraph G corresponding to adjacency matrix A, where 4M

d Apply Dijkstra’s Algorithm to find the length of a shortest path between a and 4M
z in the given weighted graph:
Step 1: First, we will mark the source node A with a current distance of 0
and set the rest of the nodes to INFINITY.

Step 2: visit A-B and replace infinity by lesser value to that node path
value A-B by 4

Step:3 We will then set the unvisited node C as A-B-C (6) since it ois more
than A-C (3)

Step 4: We will then mark the current node B as visited.

Step 5: We will repeat the process from 'Step 2' if there is any node
unvisited left in the graph.

Finally, the shortest path between A to F is A-C-D-E-G-Z is 16

3a 1. Suppose that a valid code word is an n-digit number in decimal notation containing an 5M
even number of 0s. Let an denote the number of valid code words of length n. Then,
the corresponding recurrence relation is 𝑎𝑛 = 8𝑎𝑛−1 + 10n-1 for n =
1,2, 3, 4----with initial condition a0 = 1. Use generating functions to find an explicit
formula for an .
b Solve the recurrence relation 𝑎𝑛 = −5𝑎𝑛−1 − 6𝑎𝑛−2 + 42 . 7𝑛 , wherer 𝑎1 = 56w 6M
and 𝑎2 = 278.
4 a 2. Use the method of generating function to solve the recurrence relation 𝑎𝑛 − 2𝑎𝑛−1 − 5M
3𝑎𝑛−2 = 0 , 𝑛 ≥ 2 𝑤𝑖𝑡ℎ 𝑎0 = 3 , 𝑎1 = 1

b A young pair of rabbits (one of each gender) is placed on an island. A pair of 6M


rabbits does not breed until they are 2 months old. After they are 2 months old,
each pair of rabbits produces another pair each month. Model it as a recurrence
relation (assuming that rabbits never die) and solve by characteristic root
method.

For the given problem the number of rabbits existed in each month as follows

1, 1, 2, 3, -----

The recurrence relation is with 𝑎0 = 𝑎1 = 1


CO2 Max.
Marks 25
Answer ALL Questions
5a Draw the complete bipartite graph K3,4. 5M

b Obtain all spanning trees of the graph G shown in the following figure: 6M
6a Determine whether the following graphs G and H are isomorphic or not. 5M

Graph G Graph H
No Of Vertices 8 8
No of Edges 10 10
Degree sequence 2,2,2,2,3,3,3,3 2,2,2,2,3,3,3,3
Closed circuits of 4,4,6,6 4,4,4,6
length
Since they are not having equal length of circuits G and H are not
Isomorphic
b Construct the minimum spanning tree (MST) for the given graph using 6M
Kruskal’s Algorithm:

No of Vertices=7
No Of edges in MST is 7-1=6

Connect as follows
Step Edge Waight
1 6-1 10
2 3-4 12
3 2-7 14
4 2-3 16
5 4-5 22
6 5-6 24
Total value 99
Step by step gph is needed.
Final graph

You might also like