Scribd
Upload
5 views3 pages

19CSC202A Assignment-2

The document outlines the course assessment for the B. Tech Discrete Mathematics program at Ramaiah University, detailing the assignment structure, marking scheme, and submission guidelines. It consists of three parts focusing on topics such as n-ary relations, recurrence relations, and closures in set theory, with specific tasks and questions for students to complete. Students are required to submit their assignments by a specified date, adhering to formatting and citation requirements.

Uploaded by

Pranav
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
5 views3 pages

19CSC202A Assignment-2

The document outlines the course assessment for the B. Tech Discrete Mathematics program at Ramaiah University, detailing the assignment structure, marking scheme, and submission guidelines. It consists of three parts focusing on topics such as n-ary relations, recurrence relations, and closures in set theory, with specific tasks and questions for students to complete. Students are required to submit their assignments by a specified date, adhering to formatting and citation requirements.

Uploaded by

Pranav
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

Faculty of Engineering and Technology

Ramaiah University of Applied Sciences


Department / Faculty Mathematics and Statistics / Programme B. Tech
FMPS
Semester/Batch 3th / 2019
Course Code 19CSC202A Course Title Discrete Mathematics
Course Leader(s) Hemanthkumar B.

Course Assessment
Reg. No. Name of the Student
Marks

Max Marks
Sections

Marking Scheme

Scored
Marks

CO
Definition 1 1
Part-A

1.1 Representing Databases using relation 2 5


Illustration of SQL commands 2 6
2.1 Conjecture and Proof by induction 5 3
Part-B

Number of ways to paint a train 1 3


2.2
Number of ways to paint a merry-go-round 4 3
The reflexive and the symmetric closure 1 3
3.1 Transitive closure by Warshall’s algorithm 2 5
MATLAB function for Warshall’s algorithm 2 5
Part-C

Hasse diagram 2 4
3.2
Topological sort to find the compatible total ordering 3 6
Total Assignment Marks 25

Page 1 of 3
Assignment
Instructions to students:
1. The assignment consists of 3 parts
2. The assignment has to be neatly word processed as per the prescribed format
3. The maximum number of pages should be restricted to 20
4. Use only SI units
5. Submission Date: 16/01/2021
6. Submission after the due date is not permitted
7. Method of evaluation as per the submission and marking scheme
8. At the end, you are required to comment on -
a. Benefits you have derived by solving this assignment
b. Whether assignment was able to assess module learning outcomes or not?
9. IMPORTANT: It is essential that all the sources used in preparation of the assignment must be
suitably referenced in the text.

Part – A (5 Marks)
1.1 Define 𝑛 −ary relation. Your report on 𝑛 −ary relations should contain the following:
1.1.1 Discuss how these relations are used to represent computer databases with
an example.
1.1.2 Illustrate how SQL commands are related to operations − selection,
projection, and join on 𝑛 −ary relations with an example.

Part – B (5+5=10 Marks)

2.1 Let {𝐵𝑛 } be a sequence given by the following recurrence relation:


𝐵1 = 1
𝐵2 = 4
𝐵3 = 9
𝐵𝑛 = 𝐵𝑛−1 − 𝐵𝑛−2 + 𝐵𝑛−3 + 4𝑛 − 6 for 𝑛 ≥ 4
Making use of the recurrence, conjecture a formula of 𝐵𝑛 . Then, prove your conjecture
by mathematical induction.

2.2 Let 𝑝 be a prime, suppose that we have 𝑝 − carriages and 𝑛 − different colours
2.1.1 In how many ways can we paint a train with 𝑝 − carriages, if we can paint
each carriage in one of 𝑛 colours.
2.1.2 In how many ways can we paint a merry-go-round with 𝑝 − carriages, if we can
paint each carriage in one of 𝑛 colours.

Part – C (5+5=10 Marks)

3.1 Let 𝑅 be a relation on the set 𝐴 = {𝑎, 𝑏, 𝑐, 𝑑, 𝑒}, defined by 𝑅=


{(𝑎, 𝑏), (𝑎, 𝑐), (𝑎, 𝑒), (𝑏, 𝑎), (𝑏, 𝑐), (𝑐, 𝑎), (𝑐, 𝑏), (𝑑, 𝑎), (𝑒, 𝑑)}

Page 2 of 3
3.1.1 Determine the reflexive and the symmetric closure of 𝑅.
3.1.2 Utilize Warshall’s algorithm to find the transitive closure of 𝑅.
3.1.3 Write a MATLAB function for Warshall’s algorithm, hence find the matrix
representing transitive closure of 𝑅.

3.2 Let {𝑎, 𝑏, 𝑐, 𝑑, 𝑒, 𝑓, 𝑔, ℎ, 𝑖} be the tasks to be carried out for the completion of a project at a
computer company. A partial ordering on tasks is set up below by considering task 𝑥 ≺ task
𝑦 if task 𝑦 cannot be started until task 𝑥 has been completed.
{(𝑎, 𝑐), (𝑎, 𝑓), (𝑎, ℎ), (𝑎, 𝑖), (𝑎, 𝑔), (𝑎, 𝑑), (𝑏, 𝑓), (𝑏, ℎ), (𝑏, 𝑖), (𝑐, 𝑓), (𝑐, ℎ), (𝑐, 𝑖),
(𝑑, 𝑔), (𝑑, 𝑖), (𝑑, ℎ), (𝑒, 𝑔), (𝑒, 𝑖), (𝑒, ℎ), (𝑓, ℎ), (𝑓, 𝑖), (𝑔, ℎ), (𝑔, 𝑖)}
3.2.1 Draw the Hasse diagram for the tasks, with respect to the given partial
ordering.
3.2.2 Make use of topological sorting algorithm to find the order in which these
tasks can be carried out to complete the project.

Guidelines for Submission


Citation of the references in the text is necessary in all the parts.
 Restrict your report for Part-A to 2 pages only
 Use of figures could be avoided in Part-A
 Divide your discussions clearly as per the sections mentioned above.
 Restrict your report for Part-B and C to a maximum of 10 and 12 pages respectively
 Divide your discussions clearly as per the sections mentioned above and draw the conclusion at the
end of each section.
 Please note: Marks will be awarded only to the sections and sub-sections clearly indicated as per
the problem statement.
 A presentation on the assignment should be given to the Examiner in MSRUAS format only.


Page 3 of 3

You might also like