Scribd
Upload
30 views

Discrete Structures 24 25

The document outlines an assignment problem set for the II Semester M.Sc. Software Systems at PSG College of Technology, detailing various tasks for eight groups of students. Each group is assigned specific problems related to discrete structures, including mathematical induction, validity of arguments, and recurrence relations. The document includes deadlines for submission and the members of each group.

Uploaded by

hemanthvasu822
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
30 views

Discrete Structures 24 25

The document outlines an assignment problem set for the II Semester M.Sc. Software Systems at PSG College of Technology, detailing various tasks for eight groups of students. Each group is assigned specific problems related to discrete structures, including mathematical induction, validity of arguments, and recurrence relations. The document includes deadlines for submission and the members of each group.

Uploaded by

hemanthvasu822
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/ 5

PSG COLLEGE OF TECHNOLOGY, COIMBATORE-641004

DEPARTMENT OF APPLIED MATHEMATICS AND COMPUTATIONAL SCIENCES


II Sem M.Sc. Software Systems
23XW21 - Discrete Structures
Assignment Problem Set

Group Members Marks Date


number

I 24PW15, 17/03/2025
24PW 1,
24PW 2,
24PW 6,
24PW 11
II 24PW 17, 17/03/2025
24PW 21,
24PW 28,
24PW 29,
24PW 37
III 24PW 26, 19/03/2025
24PW 24,
24PW25,
24PW 8,
24PW 39
IV 24PW 16, 20/03/2025
24PW 18,
24PW 40,
24PW 30,
24PW 34
V 24PW 27, 21/03/2025
24PW 22,
24PW 38,
24PW 31
VI 24PW 4, 24/03/2025
24PW 7,
24PW 33,
24PW 35,
24PW 3
VII 24PW 5, 24/03/2025
24PW 32,
24PW 10,
24PW 9,
24PW 13
VIII 24PW 12, 27/03/2025
24PW 23,
24PW 14,
24PW 20
Group –I

1. For each of these arguments, explain which rules of inference are used for each step.
a) “Each of the 93 students in this class owns a personal computer. Everyone who owns a
personal computer can use a word processing program. Therefore, Zeke, a student in this class,
can use a word processing program.”
b) “Everyone in New Jersey lives within 50 miles of the ocean. Someone in New Jersey has
never seen the ocean. Therefore, someone who lives within 50 miles of the ocean has never
seen the ocean.”
2. Use mathematical induction to prove that 𝑛3 − 𝑛 is divisible by 3 whenever 𝑛 is a positive
integer.
3. Check whether the following statement specification is consistent.
“If Ashok does not take a course in discrete mathematics, then she will not graduate.” “If Ashok
does not graduate, then she is not qualified for the job.” “If Ashok reads a good book on
discrete mathematics, then she is qualified for the job.” “Ashok does not take a course in
discrete mathematics but she reads a good book on discrete mathematics.”
4. Use generating function to solve the recurrence relation a n  8a n1  10 n1 , a1  9.
5. Show that the premises “Everyone in this discrete mathematics class has taken a course in
computer science” and “Marla is a student in this class” imply the conclusion “Marla has taken
a course in computer science.”

Group –II
𝑛(𝑛 + 1)
1. Show that if n is a positive integer, then 1 + 2 +· · · +𝑛 = .
2

2. Generate the permutations of the integers 1, 2, 3 in lexicographic order.

3. Show that the premises “A student in this class has not read the book,” and “Everyone in this
class passed the first exam” imply the conclusion “Someone who passed the first exam has not
read the book.”

4. Obtain the general solution of the recurrence relation:


an − 5an−1 + 6an−2 = 4n , a0 = 0, a1 = 1.

5. Use Dijkstra’s algorithm in the graph given below to find the shortest path from a vertex.
Group – III

1. Conjecture a formula for the sum of the first n positive odd integers. Then prove your
conjecture using mathematical induction.
2. Find the next bit string after 10 0010 0111.
3. Let R be the relation on the set of ordered pairs of positive integers such that
((a, b), (c, d)) ∈ R if and only if a + d = b + c. Show that R is an equivalence relation. Find
the equivalence class of (2, 5).
4. Determine whether for the given graph it is possible to assign either red or blue to each
vertex so that no two adjacent vertices are assigned the same color. If so prove that the given
graph is a bipartite graph if not give the reason.

5. Find the next larger 4-combination of the set {1, 2, 3, 4, 5, 6} after {1, 2, 5, 6}.

Group – IV

1. Explain the following: Universal instantiation, Universal generalization, Existential


instantiation, and Existential generalization.
2. Use mathematical induction to show that 1 + 2 + 22 +· · · +2𝑛 = 2𝑛+1 – 1.
3. Is the following argument valid? Justify.
If it does not rain and the sky is clear then we can go for swimming or biking. If it does not rain
then if we go for swimming then we have to take the van. There is no rain and the sky is clear.
We shall not go for biking. Hence, we shall take the van. (R, C, S, B, V)

4. Let P(x): “x is a humming bird”, Q(x): “x is large”, R(x): “x lives on honey” and S(x): “x is richly
coloured”. Check the validity of the following argument.
All humming birds are richly coloured.
No large birds live on honey.
Birds that do not live on honey are dull in colour.
Therefore humming birds are small.
5. Solve the following non-homogenous recurrence relation
an  4an1  4an2  3n  2n , a0  1, a1  1
.
Group – V

1. Explain the principle of mathematical induction in terms of predicates and quantifiers.


2. What is the next permutation in lexicographic order after 362541?
3. Show that the hypotheses “ It is not sunny this afternoon and it is colder than yesterday”,
“we will go swimming only if it is sunny”, “if we do not go swimming, then we will take a canoe
trip”, and “if we take a canoe trip, then we will be home by sunset” lead to the conclusion “we
will be home by sunset.”
4. Solve the following recurrence relation an  6an1  9an2  3 and a0  0, a1  1 .
n

Group – VI

1. Check the validity of the following argument.


(a) All students in this class understand logic. Xavier is a student in this class. Therefore, Xavier
understands logic.
b) Every computer science major takes discrete mathematics. Natasha is taking discrete
mathematics.
Therefore, Natasha is a computer science major.
2. Use mathematical induction to prove a formula for the sum of a finite number of terms of a
geometric progression with initial term 𝑎 and common ratio 𝑟.
3. How many solutions are there to the equation x1 + x2 + x3 + x4 + x5 = 21; where xi ,
1 ≤ i ≤ 5, is a non-negative integers such that if there are no restrictions; if 1 < x3 ≤ 6 and if
x1 < 2 and x2 ≥ 4 ?
4. Let 𝐴 be the set of factors of a particular positive integer 𝑚 and let 𝑅 be the relation divides,
𝑅= ( x, y) / x, y  A, y  kx, k  Z . Prove that 𝑅 is a partial ordered relation on 𝐴. Draw Hasse
diagram of (𝐴, 𝑅) for 𝑚 = 45.
5. Solve the following recurrence relation:
𝑎𝑛 = 7𝑎𝑛−1 − 16𝑎𝑛−2 + 12𝑎𝑛−3 + 𝑛4𝑛 , 𝑎0 = 3, 𝑎1 = 6.

Group – VII

1. Check the validity of the following argument.


a) All parrots like fruit. My pet bird is not a parrot. Therefore, my pet bird does not like fruit.
b) Everyone who eats granola every day is healthy. Linda is not healthy. Therefore, Linda does
not eat granola every day.
2. Use mathematical induction to prove the inequality 𝑛 < 2𝑛 for all positive integers 𝑛.
3. Explain Partition and covering of sets with suitable examples using equivalence relations.
4. Write shortest path algorithm and find shortest path from 𝐴 to all other vertices.
5. Find the next larger permutation in lexicographic order after each of these permutations.
a) 1432 b) 54123

Group – VIII

1. For each of these arguments, explain which rules of inference


are used for each step.
a) “Doug, a student in this class, knows how to write programs in JAVA. Everyone who knows
how to write programs in JAVA can get a high-paying job. Therefore, someone in this class can
get a high-paying job.”
b) “Somebody in this class enjoys whale watching. Every person who enjoys whale watching
cares about ocean pollution. Therefore, there is a person in this class who cares about ocean
pollution.”
2. Use mathematical induction to prove that 2𝑛 < 𝑛! for every integer 𝑛 with 𝑛 ≥ 4.
3. Define Graph Isomorphism. Determine whether the two graphs 𝐺1 and 𝐺2 shown below are
isomorphic?

4. Check whether the following two graphs 𝐺 and 𝐻 are isomorphic or not?

You might also like