Scribd
Upload
26 views3 pages

19MAT115 Discrete Math P2

This document is an examination paper for the course 'Discrete Mathematics' at Amrita School of Engineering, detailing the structure of the exam, including course outcomes and types of questions. It consists of three parts: Part-A with short answer questions, Part-B with two questions to be answered, and Part-C with four questions to be answered. The exam covers various topics in discrete mathematics, including functions, relations, number theory, and equivalence relations.

Uploaded by

SAAYAANTAAN NIT
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
26 views3 pages

19MAT115 Discrete Math P2

This document is an examination paper for the course 'Discrete Mathematics' at Amrita School of Engineering, detailing the structure of the exam, including course outcomes and types of questions. It consists of three parts: Part-A with short answer questions, Part-B with two questions to be answered, and Part-C with four questions to be answered. The exam covers various topics in discrete mathematics, including functions, relations, number theory, and equivalence relations.

Uploaded by

SAAYAANTAAN NIT
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

Roll No.

——————————————————

Amrita Vishwa Vidyapeetham


Amrita School of Engineering, Amaravati
Periodical-2
Second Semester
Computer Science and Engineering
19MAT115 Discrete Mathematics
Duration: 120 Minutes Maximum: 50 Marks

CO Course Outcomes
Understand the concepts of various types of relations, partial ordering and equivalence re-
CO2
lations.
CO5 Understand various definitions in number theory and study their properties.

————-Part-A————

Answer all questions from part-A.

1. Determine whether f is a function from Z to R if [3] [CO02][BTL2]


1
p
(a) f (n) = ±n (b) f (n) = n2 + 1 (c) f (n) =
n2 −4

2. Let P ({0, 1, 2}) denote the power set of {0, 1, 2}. Is (P ({0, 1, 2}), ⊆) a poset? If yes, Find two
incomparable elements in it. [3] [CO02][BTL3]

3. Prove or disprove that if a, b, and d are integers with d > 0, then [3] [CO05][BTL4]

(a + b) div d = a div d + b div d.

4. Find each of these values. [3] [CO05][BTL1]

(a) (177 mod 31 + 270 mod 31) mod 31


(b) (177 mod 31 · 270 mod 31) mod 31
(c) (212 mod 15)3 mod 22.

5. Give an example of a function from N to N that is [3] [CO02][BTL6]

(a) one-to-one but not onto. (b) neither one-to-one nor onto.

6. If f and f ◦ g are one-to-one, does it follow that g is one-to-one? Justify your answer. [3]
[CO02][BTL4]
————Part-B————

Answer any two questions from part-B.

7. Is the function f (x) = |x| from the set of real numbers R to the set of nonnegative real numbers
R invertible? If yes, find its inverse. If not, find the restricted domain so the resulting function
becomes invertible, then find the inverse. [4] [CO02][BTL2]

8. Determine with proper explanation whether the function f : Z × Z → Z defined by

f (m, n) = (m + n, m − n)

one-to-one and onto. Is it a bijective function? If yes, find its inverse. [4] [CO02][BTL3]

9. List the ordered pairs in the relation [2 + 2] [CO02][BTL1]


 
1 1 0 1
1 0 1 0
 
0 1 1 1
1 0 1 1

on {1, 2, 3, 4} (where the rows and columns correspond to the integers listed in increasing
order). Draw the directed graph representing the above relation.

————Part-C————

Answer any four questions from part-C.

10. Let m be an integer with m > 1. Determine with proper explanation whether the relation

R = {(a, b)|a ≡ b(modm)}

is an equivalence relation on the set of integers. What are the equivalence classes of 0, 1, 2, 3,
and 4 when m = 5 in the above relation? [6] [CO02][BTL1]

11. (a) State the division algorithm.


(b) State the twin prime conjecture.
(c) State Chinese Remainder theorem [2 + 2 + 2] [CO05][BTL1]

12. (a) Prove that if n is an integer then [3] [CO05][BTL2]

n2 ≡ 0 or 1( mod 4).
(b) Prove that if n is an odd positive integer, then [3] [CO01][BTL1]

n2 ≡ 1( mod 8).

13. Use the Euclidean algorithm to find the greatest common divisor of the integers 2002 and 2339.
Further, express the greatest common divisor as a linear combination of the given integers. [6]
[CO05][BTL5]

Page 2
14. Solve the congruence equation 1092x ≡ 213( mod 2295). [6] [CO05][BTL5]

OR

Find a positive integer x that leaves remainders 1, 2, 3, 4 when divided by 2, 3, 5, 7, respectively.

CO Marks BTL Marks


CO01 0 BTL 1 13
CO02 30 BTL 2 13
CO03 0 BTL 3 13
CO04 0 BTL 4 6
CO05 30 BTL 5 12
BTL6 3

ALL THE BEST

Page 3

You might also like