FACULTY OF INFORMATION TECHNOLOGY

Final Report
Discrete Structures
Regulations
You should solve and submit this report to your elearning account within 14 days, from
the beginning of May 21st, 2024, to the end of Jun 3rd, 2024. Late submission is not
accepted.
This is an group final report. Number of students in a group can not be more than 3
In the test, there are questions that need to be customized according to a student ID.
Only the smallest student ID in your group will be used for this purpose. For example, in
group of 3 students, said 52200123, 52200136 and 52201001, then only 52200123 are
used.
Students need to submit a compressed file named with your Student IDs, eg.
52200123_52200136_52201001.zip/rar, including this structure:

 The document file is in Word format (.doc/docx), named by your Student IDs,
eg. 52200123_52200136_52201001.docx, using our faculty’s format, from 25
to 35 pages.

o The tasks of each member and self-evaluation of your group should be

declared at the end of this report.

o English is required for high-quality classes. Format violations will cost

from 10% to 50% of your total scores.

o Any case of plagiarism will get 0.

 The Python source code files are named by your Student ID and Task Number,
eg. 52200123_52200136_52201001_8.py and
52200123_52200136_52201001_9.py.

Question 1: Euclid’s algorithm and Bezout’s identity

a. Using Euclid’s algorithm to calculate gcd(2024, 1000 + m) and lcm(2024, 1000 + m),
where m is the last 3 digits of your student ID. For example, if your student ID is
52200123 then you need to calculate gcd(2024, 1123) and lcm(2024, 1123).
b. Apply above result(s) in to find 5 integer solution pairs (x,y) of this equation:
2024x + (1000 + m)y = gcd(2024, 1000 + m)
For example, if your student ID is 52000123 then your equation is:
2024x + 1123y = gcd(2024, 1123)

Question 2: Recurrence relation

Solve this recurrence relation.
 FACULTY OF INFORMATION TECHNOLOGY

an = 8.an−1 – 15.an−2
with a0 = 5 and a1 = m,
where m is the last 2 digits of your student ID. For example, if your student ID is
52200123 then a1 = 23.

Question 3: Set
a. Create a set Γ of characters from your case-insensitive non-diacritical full name.
b. Find the union, intersect, non-symmetric difference, and symmetric difference of Γ and Δ,
where Γ and Δ are from question 3a.

Question 4: Relations
Let ℜ be a binary relation defined on 2 integers as follow:
∀ a , b ∈ N (aRb↔m|( a . b ))
where is the last 2 digits of your student ID.
For example, if your student ID is 52200123 then the valid binary relation is
∀ a , b ∈ N (aRb↔23 |( a. b ))
Is R reflexive, symetric, anti-symetric, transitive? Prove your answer.

Question 5: Kruskal’s algorithm

Propose a solution for circuit-checking in Kruskal's algorithm. Give an example.

Question 6: Eulerian circuit

a. Does the following graph have an Eulerian circuit or Eulerian path? Why?

A-E-B-G-D-H-C-F-A-I-E-M-B-S-Y-B-e-G-k-D-l-m-D-n-H-j-C-d-
X - C - R - F - L - A- K - L - Q - R - X - W - c - d - j - i - n - m - h - g - l - k - f - e - Y - Z - T- S - M
-N-I-J-K-P-Q-W-V-b-c-i-h-b-a-g-f-Z-a-U-V-P-O-N-T-U-O-J-A
 FACULTY OF INFORMATION TECHNOLOGY

b. Study and present your knowledge about Hierholzer’s algorithm to find an Eulerian
circuit.
c. If the graph has an Eulerian circuit, use Hierholzer's algorithm to find an Eulerian
circuit of that graph when the initial circuit R1 is:
i. If abcd % 4 = 0 then R1 is EINME
ii. If abcd % 4 = 1 then R1 is abhga
iii. If abcd % 4 = 2 then R1 is UVbaU
iv. If abcd % 4 = 3 then R1 is XCdX
Where abcd is the 4-digit number combined by the last 4 digits in your StudentID. For
example, Student ID 52201234 has abcd = 1234.

Question 7: Map coloring

Given this map:
 FACULTY OF INFORMATION TECHNOLOGY

a. Modeling this map by a graph.

b. Color the map (graph) with a minimum number of colors. Present your solution step
by step.
Let abcd be the 4-digit number combined by the last 4 digits in your StudentID. For
example, StudentID 52201234 has abcd = 1234.
i. If abcd % 4 = 0 then start from Bihar.
ii. If abcd % 4 = 1 then start from Orissa.
 FACULTY OF INFORMATION TECHNOLOGY

iii. If abcd % 4 = 2 then start from Rajasthan.

iv. If abcd % 4 = 3 then start from Meghalaya.

Question 8: Finding an Inverse Modulo n

 Conduct research on Finding an Inverse Modulo n using the extended Euclidean
algorithm. Give your own examples.
 Implement a Python program to find an Inverse Modulo n using the extended
Euclidean algorithm. Related libraries are NOT allowed.
 Test the implemented program using sample data and verify the results. Capture
your screen results and explain them in your report document.

Question 9: RSA cryptosystem

 Conduct research on RSA cryptosystem. Understand the mathematical concepts
behind the RSA cryptosystem, including prime number generation, modular
arithmetic, extended Euclidean algorithm, prime factorization, etc. Give your
own examples.
 Implement a Python program to encrypt and decrypt a message with the RSA
cryptosystem. Cryptography libraries are allowed.
 Test the implemented RSA cryptosystem using sample messages and verify the
results. Capture your screen results and explain them in your report document.
 Analyze the efficiency and security of the implemented RSA cryptosystem.
 Discuss the potential security threats and limitations of the RSA cryptosystem.
 Conclude with recommendations for improving the RSA cryptosystem
implementation.
 FACULTY OF INFORMATION TECHNOLOGY

Rubric

Self-
Criteria Scale 1 2 3 Reason
evalutaion

Scor
0 score 1/2 score Full score
e /10
Correct gcd and lcm,
Do nothing or but incorrect Correct calculation,
Question 1 1
wrongly. solutions of the detailed explanation.
Bezout’s identity.
Correct calculation
Do nothing or Correct calculation,
Question 2 0.5 but wrong result or
wrongly. detailed explanation.
conclusion.
Do nothing or Correct Γ but Correct calculation,
Question 3 0.5
wrongly. incorrect operations. detailed explanation.
Do nothing or Correct results but Right results,
Question 4 0.5
wrongly. incorrect proofs. detailed explanation.
Reasonable but Reasonable detailed
Do nothing or
Question 5 1 indetailed proposion. proposion with
wrongly.
No illustration. illustration.
a-Correct a-Correct
recognition, right recognition, right
Do nothing or explanation. explanation.
Question 6 1
wrongly. b,c-Good study but b,c-Good study,
incorrect right calculation,
applications. detailed explanation.
Do nothing or Correct modeling Correct modeling
Question 7 1
wrongly. but wrong coloring. but right coloring.
 FACULTY OF INFORMATION TECHNOLOGY

Not enough
Theorical Do nothing or details, no Correct calculations,
0.5
research wrongly example, no detailed explanations
comment
Question 8 Correct but Correct and
Error
Implementation 0.5 bad good
performance performance
Test without
Test 0.5 No test Test and verification
verification
Not enough
Theorical Do nothing or details, no Correct calculations,
0.5
research wrongly example, no detailed explanations
comment
Correct but Correct and
Error
Implementation 0.5 bad good
performance performance
Test without
Test 0.5 No test Test and verification
verification
Not enough
Question 9 Do nothing or details, no Correct, detailed
Analysis 0.5
wrongly example, no explanations
comment
Not enough
Do nothing or details, no Correct, detailed
Discussion 0.5
wrongly example, no explanations
comment
Not enough
Recommendatio Do nothing or details, no Correct, detailed
0.5
n wrongly example, no explanations
comment
Total 10 Result 0
FACULTY OF INFORMATION TECHNOLOGY