Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
30 views1 page

DMS Tutorial Sheet 7

The document outlines the course details for B.Tech in Discrete Mathematical Structures, including objectives and questions for students. It emphasizes the representation of relations and functions using matrices and digraphs, as well as the properties of relations. Additionally, it includes various mathematical problems related to functions and mappings.

Uploaded by

Siva Sai
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 views1 page

DMS Tutorial Sheet 7

The document outlines the course details for B.Tech in Discrete Mathematical Structures, including objectives and questions for students. It emphasizes the representation of relations and functions using matrices and digraphs, as well as the properties of relations. Additionally, it includes various mathematical problems related to functions and mappings.

Uploaded by

Siva Sai
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/ 1

School of Computer Science Engineering and Technology

Course-B.Tech Type- Core


Course Code- CSET106 Course Name- Discrete Mathematical Structures

Year- 2025 Semester- Even


Date- 19/03/2025 Batch- 2024-2028

CO-Mapping
Q1 Q2 Q3 Q4 Q5 Q6 Q7
CO1       
CO2
CO3

Objectives
1. Students will be able to represent relations as matrix and digraph.
2. Students will be able to recognize types of relations and functions.
3. Students will be able to understand the difference between relations and functions.

Questions:
1. Represent the relation R = {(1, 1), (1, 3), (1, 4), (2, 2), (3, 1), (3, 4), (4, 1), (4, 3)} on the set A = {1, 2, 3,
4} by matrix and Digraph.

2. Represent the divisibility relation on the set A = (1, 2, …, 12) by a digraph.

3. Let R1 and R2 be given by the matrices ( ) and ( )

a) Determine whether or not R1 is reflexive, symmetric, antisymmetric, transitive.


b) Determine whether or not R2 is reflexive, symmetric, antisymmetric, transitive.
c) Find the matrices representing R1C (Complement of R1), R1 ∪ R2, R1 ∩ R2, and R1 ◦ R2.

4. Let R = {(1, 2), (2, 2), (2, 3), (5, 4)} is a relation on S = {1, 2, 3, 4, 5}. Obtain reflexive, symmetric and
transitive closures of R.

5. If 𝑓(𝑥) = 3𝑥3 + 2𝑥2 − 5𝑥 + 2 and 𝑔(𝑥) = −𝑥3 – 𝑥2 + 5, find 𝑓(𝑥) + 𝑔(𝑥), 𝑓(𝑥) − 𝑔(𝑥), 𝑓(𝑥) * 𝑔(𝑥), 𝑓(𝑔(𝑥))
and g (𝑓(𝑥)).

6. Which of the following maps is injective, surjective, or bijective?


a) f : R → R, f(x) = x2 for all x ∈ R.
b) f : R → R≥0, f(x) = x2 for all x ∈ R.
c) f : R≥0 → R≥0, f(x) = x2 for all x ∈ R.
7. Let f : R\{-2} → R\{1} be the function defined by f (x) = (x+1)/(x+2). Then, show that f is one-one and
-1
onto also write f (x).

In other words, general set theory is pretty trivial stuff really, but, if you want to be a
mathematician, you need some and here it is; read it, absorb it, and forget it.
-Paul Halmos

No one shall expel us from the paradise which Cantor has created for us.
- David Hilbert

You might also like