UCS405: Discrete Mathematical Structures

Department of Computer Science and Engineering

Thapar Institute of Engineering & Technology, Patiala
Assignment
Total Marks: 15

Submission Instruction:
1. The submission date is before 2 December 2023, 5:00 P.M. It is the hard deadline.
2. No more submission will be considered after the due date and time.
3. Submit the scanned copy of handwritten assignments

1. (a) Show that there is exactly one maximal element in a poset with a greatest element.
(b) Show that the least upper bound of a set in a poset is unique if it exists.

2. (a) Find a graph with seven number of vertices such that both 𝐺 and 𝐺̅ contain Eulerian
circuits.
(b) Is the following graph Eulerian?

3. Fix a prime 𝑝 and a positive integer 𝑛. Draw the Hasse diagram of D(𝑝𝑛 ). Does this
correspond to a linearly ordered set? Give reasons for your answer.

4. You are a bioinformatics researcher working on optimizing fluid flow in a microfluidic

biochip used for DNA analysis. The biochip comprises a network of channels and
reservoirs designed to process DNA samples efficiently. Your task is to apply the Ford-
Fulkerson algorithm to maximize the flow of DNA samples through the biochip,
ensuring rapid and accurate analysis.
Given Information:
Reservoirs (Nodes):
- R1 (Source Reservoir)
- R2
- R3
- R4
- R5 (Destination Reservoir)
 Channels (Edges) with Capacities:
- Edge from R1 to R2 (Capacity: 6)
- Edge from R1 to R3 (Capacity: 8)
- Edge from R3 to R5 (Capacity: 3)
- Edge from R3 to R4 (Capacity: 5)
- Edge from R2 to R4 (Capacity: 7)
- Edge from R4 to R5 (Capacity: 9)
- Edge from R2 to R5 (Capacity: 4)

Reservoirs are represented as nodes in the network, labeled R1, R2, R3, R4, R5.
Channels are represented as directed edges connecting the reservoirs, forming the
pathways for DNA samples. Each channel has a capacity indicating the maximum flow
of DNA samples it can accommodate. The biochip is initially configured to process DNA
samples from the source reservoir to the destination reservoir(s) for analysis.

a) Create a directed graph representation of the microfluidic biochip, depicting

reservoirs as nodes and channels as directed edges with their respective
capacities.
b) Apply the Ford-Fulkerson algorithm to optimize the flow of DNA samples
within the biochip. Begin with the initial flow configuration and iteratively
improve the flow using the augmentation path method until achieving
maximum flow or reaching the desired destination reservoir(s).
Depict all the intermediate steps in detail.

5. Suppose a city has a planar transportation network with 8 intersections and 12 roads
forming a planar graph.
a) Calculate the minimum number of colors required to ensure that no two
adjacent intersections have the same color in this transportation network. Give
a detailed proof for the same.
b) If the city decides to add 4 more roads to the existing network without creating
any intersections where roads cross, determine the maximum number of
additional roads that can be added. Provide a detailed explanation for the
same.

6. Answer the following questions with preposition logic

a) Sherlock Holmes, renowned for his deductive skills, investigates a complex case
involving a stolen valuable artifact from a museum. Four suspects – Professor
Moriarty (M), Irene Adler (I), John Watson (W), and Mrs. Hudson (H) – provide
statements about their whereabouts at the time of the theft:
 Professor Moriarty claims, "I was not at my laboratory, and Irene was not
attending a theater performance."
 Irene Adler says, "John Watson and Mrs. Hudson were not together, and
neither was at the museum."
  John Watson states, "Either Professor Moriarty was at his laboratory, or Mrs.
Hudson was not at the restaurant."
 Mrs. Hudson declares, "If Irene was at the theatre, then John Watson was not
at the restaurant."

Let the statements be represented by the respective logical propositions:

M: "Professor Moriarty was at his laboratory."
I: "Irene Adler was attending a theatre performance."
W: "John Watson was at a restaurant."
H: "Mrs. Hudson was together with John Watson."
Let T represent the truthfulness of each statement and F represents falsity.

Answer the following Questions:

i. Construct logical expressions representing the statements provided by each
suspect using propositional logic connectives (AND, OR, NOT, IMPLIES, IF AND
ONLY IF).
ii. Formulate a combined logical expression to represent the situation where only
one suspect was telling the truth.
iii. Apply logical deductions, truth table analysis, and equivalences to deduce the
identity of the real culprit (the suspect who was telling the truth) based on the
constructed logical expressions statements.
b) Suppose there are signs on the doors to two rooms. The sign on the first door reads
“In this room, there is a lady, and in the other one, there is a tiger” and the sign on the
second door reads, “In one of these rooms, there is a lady, and in one of them there
is a tiger.” Suppose you know one of these signs is true and the other false. Behind
which door is the lady?

7. Solve the following:

a) Let G and H be isomorphic graphs. Prove the following:
i. G is bipartite if and only if H is bipartite.
ii. G and H have the same number of vertices.
b) Suppose G and H are two graphs with the same vertex set: V(G) = V(H). and G and
H have the same vertex degrees: degG(v)= degH(v) for all vertices v.
Prove that this neither implies nor is implied by G being isomorphic to H. In other
words:
i. Give an example where degG(v) = degH(v) for all vertices v, but G and H are not
isomorphic.
ii. Give an example where G and H are isomorphic, but degG(v) is not equal to
degH(v) for at least some vertices v.

8. Write the argument below in symbolic form. If the argument is valid, prove it. If the
the argument is not valid, give a counterexample:
If you are pregnant or have a heart condition, then you can not use the hot tub.
You do not have a heart condition.
 You can use the hot tub.
 You are not pregnant.
9. Establish the validity of the argument
𝑢→𝑟
(𝑟 ⋀ 𝑠) → (𝑝 ⋁ 𝑡)
𝑞 → (𝑢 ⋀ 𝑠)
¬𝑡
𝑞
 𝑝

10. Prove by contradiction that is irrational.

11. Explain why this argument is valid or invalid:

(a) If I go to the movies, I will not do my homework.
I do my homework.
Therefore, I did not go to the movies.
(b) If the movie is long, I will fall asleep.
I do fall asleep.
Therefore, the movie was long.

12. Show that for all positive integers 𝑛, 10𝑛 − 3𝑛 is divisible by 7 using weak induction.

13. What is the solution to the recurrence relation an=an-1+2n, with the initial term a0=2.

14. How many numbers must be selected from the set {1,2,3,4,5,6} to guarantee that at
least one pair of these numbers adds up to 7.