Texas College of Management & IT

Bachelor of Computer Science (Cyber Security & Network Technology)

Assignment Details

• Assignment Title: [Assignment 1 – Number System, Relation, Advance

Subimitted By

Name: Nabin Tiwari

Subimitted To Department Mathematics

Instructor: Mr.Pradip Bastola

1|Page
Table of Contents
Complete the following tasks as part of this assignment: .............................. 3-22
Why number system conversions are needed?
Elaborate the application of number system ………………………………...……..3
Convert ....................................................................................................................... 4
Perform following operations: ............................................................................... 4-6
Convert as indicated ............................................................................................... 7-8
Write about reflexive, irreflexive, symmetric, asymmetric,
anti-symmetric and transitive relation with an example each ............................. 9-10
Determine whether the given relation on set A………………………………11-13
Show that the relation congruence modulo m on set of
integers………………………………………………………………………..14-15
Solve the recurrence relation…………………………………………………16-22

2|Page
Assignment Tasks
1. Why number system conversions are needed? Elaborate the application of
number system in real world along with at least two examples.
Number system conversions are important in that they portray the relationship
between human thought and how the computer works. The human being uses a
decimal system, base 10, when working manually for everyday applications.
Computers use the binary, base 2, when processing information. It is the
conversions that enable us to communicate with the computers, create technology,
and solve real-life problems.
Example:
• When you type a number on your keyboard, your computer converts it into
binary to process it.
• Programmers often use systems like hexadecimal (base 16) because they are
short and more readable than long binary numbers.
Real-Life Applications of Number Systems:
Digital Clocks:
• Digital clocks count in binary internally but display time in decimal for us to
understand.
• Example: 00110011 in binary translates to 33 in seconds or minutes.
Web Development-Colors in Hexadecimal:
• Color can be given as hexadecimal numbers.
• Example: FF0000 code will give us pure red color. This notation is more
compact and human readable, as compared with binary.
Networking-IP addresses are in binary
• Devices on the internet use IP addresses to communicate. While humans use
a decimal format like 192.168.0.1, computers convert it to binary for
routing.
• Example: 192.168.0.1 becomes 11000000.10101000.00000000.00000001.

3|Page
4|Page
5|Page
6|Page
7|Page
8|Page
3. Write about reflexive, irreflexive, symmetric, asymmetric, anti-symmetric
and transitive relation with an example each.
Answer:
1. Reflexive Relation
A relation R on a set A is reflexive if every element in A is related to itself.
Condition: (a,a) ∈ R for all a ∈ A.
Example:
• Set A={1,2,3}
• Relation R={(1,1),(2,2),(3,3),(1,2)}
• Here, all elements (1, 2, 3) are related to themselves, so R is reflexive.

2. Irreflexive Relation
A relation R on a set A is irreflexive if no element in A is related to itself.
Condition: (a,a)∉R for all a∈A.
Example:
• Set A={1,2,3}
• Relation R={(1,2),(2,3)}
• Here, no element (1, 2, or 3) is related to itself, so R is irreflexive.

3. Symmetric Relation
A relation R on a set A is symmetric if (a,b)∈R implies (b,a)∈R.
Condition: If A is related to b, then bis also related to A.
Example:
• Set A={1,2,3}
• Relation R={(1,2),(2,1),(3,3)}
• Here, if (1,2)∈R(1,2), then (2,1)∈R(2,1). Therefore, R is symmetric.
9|Page
4. Asymmetric Relation
A relation R on a set A is asymmetric if (a,b)∈R implies (b,a)∉R(b, a).
Condition: If A is related to bbb, bbb cannot be related to A.
Example:
• Set A={1,2,3}
• Relation R={(1,2),(2,3)}
• Here, (1,2)∈R(1,2 but (2,1)∉RR. Similarly, (2,3)∈R but (3,2)∉R(3,2)
.Thus, R is asymmetric.

5. Anti-Symmetric Relation

A relation R on a set A is anti-symmetric if (a,b)∈R and (b,a)∈R(b, a) imply a=b.

Example:

• Set A={1,2,3}
• Relation R={(1,1),(2,2),(1,2)}
• Here, (1,2)∈R but (2,1)∉R(2,1) , and all pairs (a,a) are present. Thus, R is
anti-symmetric.

6. Transitive Relation
A relation R on a set A is transitive if (a,b)∈R and (b,c)∈R (a,c)∈R(a, c).
Condition: If A is related to b, and b is related to c, then A must be related to
c.
Example:
• Set A={1,2,3}
• Relation R={(1,2),(2,3),(1,3)}
• Here, (1,2)∈R and (2,3)∈R imply (1,3)∈R. Thus, R is transitive.

10 | P a g e
11 | P a g e
12 | P a g e
13 | P a g e
14 | P a g e
15 | P a g e
16 | P a g e
17 | P a g e
18 | P a g e
19 | P a g e
20 | P a g e
21 | P a g e
22 | P a g e