Download PTU B.Tech 2020 March CSE-IT 3rd Sem BTCS 302 Discrete Structures Question Paper

FirstRanker.com
Firstranker's choice
FirstRanker.com

--- Content provided by FirstRanker.com ---

Roll No. ‘ ‘ ‘ ‘ ‘ ‘ ‘ ‘ ‘ Total No. of Pages : 02
Total No. of Questions : 18
B.Tech.(Computer Science & Engineering) (Sem.=3)
DISCRETE STRUCTURES

--- Content provided by FirstRanker.com ---

INSTRUCTIONS TO CANDIDATES :

--- Content provided by FirstRanker.com ---

1. SECTION-A is COMPULSORY consisting of TEN questions carrying TWO marks each.
2. SECTION-B contains FIVE questions carrying FIVE marks each and students have to attempt any FOUR questions.
3. SECTION-C contains THREE questions carrying TEN marks each and students have to attempt any TWO questions.

SECTION-A

Answer briefly :

--- Content provided by FirstRanker.com ---

1. Define Partial order relations.
2. Define Hashing Functions.
3. Define Sub-Ring.
4. Define Euclidean Domain.
5. In how many ways can an 8 people be seated in a round table?

--- Content provided by FirstRanker.com ---

6. Define Semi-Group.
7. Define Monoids.
8. Define Dihedral Groups.
9. Define un-directed graph.
10. Define Chromatic number.

--- Content provided by FirstRanker.com ---

1| M-56592 (52)-2671

FirstRanker.com

FirstRanker.com

--- Content provided by FirstRanker.com ---

SECTION-B

11. Let R be the relation on the set {0,1,2,3} containing the ordered pairs (0,1), (1,1), (1,2), (2,0), (2,2), and (3,0). What is the reflexive closure, symmetric closure and transitive closure of R?
12. Find the field of quotients of the integral domain Z (\/E )
13. Solve: T(k) — 8T(K — 1) + 16T(K — 2) = 0.

--- Content provided by FirstRanker.com ---

14. Let G be a finite group and let a € G be an element of order n. Then show that " = e if n is a divisor of m.
15. State and prove Euler Formula.

SECTION-C

16. Prove that any finite semi-group is a group iff both the cancellation laws hold.
17. If I and J be any two ideals of a ring R, then prove that ZJ is an ideal of R. Moreover I JcInd.

--- Content provided by FirstRanker.com ---

18. A finite connected graph is Eulerian iff each vertex has even degree.

NOTE : Disclosure of Identity by writing Mobile No. or Making of passing request on any page of Answer Sheet will lead to UMC against the Student.

2| M-56592 (52)-2671

FirstRanker.com

--- Content provided by FirstRanker.com ---