Scribd
Upload
101 views8 pages

Properties of Relations

The document discusses properties of relations in programming. It defines several key properties like reflexivity, symmetry, transitivity, antisymmetry, irreflexivity, and asymmetry. The mini project aims to implement algorithms for various relations and their properties, reusing code from the course library. The user will provide data and the program will output the relations and properties satisfied in a matrix form.

Uploaded by

253 Komal Pise
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
101 views8 pages

Properties of Relations

The document discusses properties of relations in programming. It defines several key properties like reflexivity, symmetry, transitivity, antisymmetry, irreflexivity, and asymmetry. The mini project aims to implement algorithms for various relations and their properties, reusing code from the course library. The user will provide data and the program will output the relations and properties satisfied in a matrix form.

Uploaded by

253 Komal Pise
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 8

TATYASAHEB KORE INSTITUTE OF ENGINEERING AND

TECHNOLOGY WARANANAGAR- 416 113


Department of Computer Science & Engineering
Academic Year (2022-23)

Mini Project Synopsis On

“Title of MP”
Submitted By,
Group Number:
Group Members:

ROLL NO. NAME E-mail ID MOBILE NO.


63 Aarati Nititn Patil [email protected] 8767249796
65 Amruta Namdev Virkar [email protected] 9322489306
67 Neha Namdev Virkar [email protected] 7823820209
72 Pranjal Prakash Khamkar [email protected] 8411926828
75 Vaishnavi Vikas Mohite [email protected] 9307125878

Under the Guidance of,


Guide Name :- R. B. Patil Sir
INDEX
S.No Contents

1 Introduction

1.1. Problem Statement

1.2. Objective

2 Requirement Specification

2.1. Software Requirement

2.2. Hardware Requirement

3 Methodologies to Solve Problems

3.1. Input

3.2. Output

4 Flowchart or Algorithm

5 Modules

References
INTRODUCTION :

In programming, a relation is a connection between two or more variables or data elements. A relation can
have different properties that describe its behavior and characteristics. These properties are important to
understand when working with relations in programs.

Here are some of the properties of relations that you may want to consider for your mini project in C:

Reflexivity: A relation is reflexive if every element is related to itself. For example, the relation "is equal
to" is reflexive because any element is always equal to itself.

Symmetry: A relation is symmetric if whenever one element is related to another, the second element is
also related to the first. For example, the relation "is the sibling of" is symmetric because if A is the sibling of
B, then B is also the sibling of A.

Transitivity: A relation is transitive if whenever one element is related to another and the second element
is related to a third, then the first element is also related to the third. For example, the relation "is older than"
is transitive because if A is older than B and B is older than C, then A is also older than C.

Antisymmetry: A relation is antisymmetric if whenever one element reis related to another, the second
element is not related to the first. For example, the relation "is less than" is antisymmetric because if A is less
than B, then B is not less than A.

Irreflexivity: A relation is irreflexive if no element is related to itself. For example, the relation "is not
equal to" is irreflexive because no element is equal to itself.

Asymmetry: A relation is asymmetric if whenever one element is related to another, the second element is
not related to the first, and the relation is also irreflexive. For example, the relation "is a parent of" is
asymmetric because if A is a parent of B, then B is not a parent of A, and no element is a parent of itself.
1.1 Problem Statement :

To implement a variety of relations algorithms as generic algorithms, including


relations like Relfexivity , Symmetry , Antisymmetry , Irreflexivity , Asymmetry &
re-using code as much as possible from the course library.

1.2 Objective :
The main aim of this project is to implement a variety of relations algorithms as
generic algorithms, including relations like Relfexivity , Symmetry , Antisymmetry ,
Irreflexivity , Asymmetry, re-using code as much as possible from the course library,
different relations has different properties. The user has to give the data and get the
output with the properties which is satisfies by the given data and display it in the
form of matrix.

To understand the structure of relations: Studying properties of relations allows


us to understand the structure of relations and their behavior. This understanding is
important in many areas of mathematics and other fields such as computer science,
physics, and engineering.

To classify and categorize relations: Properties of relations can be used to classify


and categorize relations into different types such as equivalence relations, partial
orders, and total orders. This classification helps us to understand the relationship
between different types of relations and how they behave.

To identify special types of relations: Properties of relations can be used to


identify special types of relations that have certain desirable properties. For example,
partial orders are important in optimization problems, and equivalence relations are
important in algebra and geometry.

 
 
REQUIREMENT SPECIFICATION :

2.1 Software Requirement :


Text Editor : VS code
Operating System : Windows 10 Pro

2.2 Hardware Requirement :


RAM : 8.00 GB
Processor : Intel Core i5
Methodologies to Solve Problems :

3.1 Input :
User has to give the data. The elements to be sorted are taken into an array. The user
has to input the size of array. The array of entered size is declared. The elements are entered
by user.

3.2 Output :
On the output screen the sorted elements are displayed. The elements are arranged in
matrix form with the name of property which is it satisfies.

FLOWCHART OR ALGORITHM :
MODULES :
There are different modules and areas of mathematics that deal with properties of
relations, such as:

Set Theory: Relations are sets of ordered pairs, so properties of relations can be studied
within the context of set theory. For example, reflexive, symmetric, and transitive relations
can be defined using set operations.

Algebraic Structures: Relations can be defined on algebraic structures like groups,


rings, and fields. Properties of relations such as equivalence relations, partial orders, and total
orders can be studied within this context.

Graph Theory: Relations can be represented as directed or undirected graphs, and


properties of relations such as connectivity, acyclicity, and reachability can be studied within
the framework of graph theory.

Category Theory: Relations can be seen as morphisms between objects in a category, and
properties of relations can be studied within the context of category theory.

Logic: Properties of relations can be expressed and studied using first-order logic, where
predicates and quantifiers are used to describe the properties of the relation.

You might also like