Scribd
Upload
198 views3 pages

Gtu Information Technology 3140708 Winter 2023

nbmbmmbmb

Uploaded by

kotvalbaban
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
198 views3 pages

Gtu Information Technology 3140708 Winter 2023

nbmbmmbmb

Uploaded by

kotvalbaban
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

Seat No.: ________ Enrolment No.

___________

GUJARAT TECHNOLOGICAL UNIVERSITY


BE - SEMESTER–IV (NEW) EXAMINATION – WINTER 2023
Subject Code:3140708 Date: 06-02-2024
Subject Name: Discrete Mathematics
Time: 10:30 AM TO 01:00 PM Total Marks:70
Instructions:
1. Attempt all questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.
4. Simple and non-programmable scientific calculators are allowed.
Marks
Q.1 (a) A function 𝑓: ℝ+ → ℝ is defined by 𝑓(𝑥) = 𝑥 2 − 8. Check whether 𝑓 is 03
one-one and onto.
(b) Determine the relation ∥ (parallel) on the set L of lines in the plane are 04
reflexive, symmetric, anti-symmetric, transitive, irreflexive.
(c) (i) Show that the functions 𝑓(𝑥) = 𝑥 3 and 𝑔(𝑥) = 𝑥 13 for 𝑥 ∈ ℝ are 03
inverses of one another.
(ii) Check whether the following graphs are isomorphic. 04

Q.2 (a) Identify the statement (𝑝⋀𝑞) ⋀ ¬(𝑝⋁ 𝑞) is tautology or contradiction. 03


(b) (i) Show that in a group (𝐺,∗), for any 𝑎, 𝑏 ∈ 𝐺 if (𝑎 ∗ 𝑏)2 = 𝑎2 ∗ 𝑏 2 then 04
(𝐺,∗) must be abelian.
(ii) If (𝐺,∗) be a group then for any two elements 𝑎 and 𝑏 of (𝐺,∗), prove
that (𝑎 ∗ 𝑏)−1 = 𝑏 −1 ∗ 𝑎 −1.
(c) Use a truth table to determine whether the following argument form is 07
valid.
𝑝→𝑞
𝑞→𝑟
∴𝑝→𝑟
OR
(c) Express the following using predicate, quantifier and logical connectives. 07
Also verify the validity of the consequence.
(i) Every computer science major takes discrete mathematics. Natasha is
taking discrete mathematics. Therefore, Natasha is a computer science
major.
(ii) All parrots like fruit. My pet bird is not a parrot. Therefore, my pet bird
does not like fruit.
Q.3 (a) Show that (ℤ∗5 ,×6 ) is cyclic group, where ℤ5∗ = ℤ5 \{0}. 03

1
(b) Given A = {x ∶ x is an integer and 1 ≤ x ≤ 5}, 04
𝐵 = {3, 4, 5, 17}, and 𝐶 = {1, 2, 3, . . . }, find 𝐴 ∩ 𝐵, 𝐴 ∪ 𝐵, 𝐴 ∩ 𝐵 ∩ 𝐶
and 𝐴 ∪ 𝐶.
(c) (i) Show that every subgroup of a cyclic group is normal 03

(ii) The subset 𝐻 = {0,2} is a subgroup of (ℤ4 , +4 ). Find all left and right 04
cosets of 𝐻 in (ℤ4 , +4 ). Is 𝐻 a normal subgroup?
OR
Q.3 (a) Define 𝑓: (ℕ × ℕ,∗) → (ℚ,×) by 𝑓(𝑎, 𝑏) = 𝑎. Show that 𝑓 is a 03
𝑏
homomorphism.
(b) In a class of 50 students, 12 enrolled for both Mathematics and Science, 32 04
enrolled for Science. If the students of the class enrolled for at least one of
the two subjects, then how many students enrolled for only Mathematics but
not Science?
(c) Consider the ring ℤ10 = {0, 1, 2, … ,9} of integers modulo 10. 07
(a) Find the units of ℤ10 .
(b) Find −3, −8 and 3−1 .
(c) Let 𝑓 (𝑥) = 2𝑥 2 + 4𝑥 + 4. Find the roots of 𝑓 (𝑥) over ℤ10 .

Q.4 (a) Let 𝑋 = {1, 2, 3, 4} and 𝑅 = {〈𝑥, 𝑦〉/ 𝑥 > 𝑦} . Draw the graph of 𝑅 and 03
also give its matrix.

(b) Find out maximal compatibility blocks of following simplified graph of 04


digraph and write its relation matrix.

(c) Prove that 〈𝑆30 , 𝐷〉 is a Boolean algebra. 07


OR
Q.4 (a) Define equivalence relation. Let 𝑋 = {1, 2, 3, 4,5}, 03
𝑅 = {〈𝑥, 𝑦〉/ 𝑥 is divisible by 𝑦}. Check whether the relation an
equivalence relation?
(b) Let 𝐴 = {𝑎, 𝑏, 𝑐, 𝑑} and 𝜌(𝐴) its power set. Let ⊆ be the inclusion relation 04
on the elements of 𝜌(𝐴). Draw the Hasse diagram of 〈𝜌(𝐴), ⊆〉.

(c) Solve 07
𝑎𝑛 = 11𝑎𝑛−1 − 39𝑎𝑛−2 + 45𝑎𝑛−3, 𝑎0 = 5, 𝑎1 = 11, 𝑎2 = 25.

Q.5 (a) A tree 𝑇 has 3 vertices of degree 4, 3 vertices of degree 3. Find the number 03
of pendant vertices in tree 𝑇.

2
(b) Find reachable set of each node of the given digraph. Also find 04
𝑑(𝑉1 , 𝑉3 ), 𝑑(𝑉3 , 𝑉1 ).

(c) Define Strong, unilateral, week component. Also Find strong, unilateral, 07
week component from the given digraph.

OR
Q.5 (a) Define null graph, centre of a graph and complete graph. 03
(b) Find the path matrix using adjacency matrix of the following graph. 04

(c) Define tree. In which order does a pre-order, in-order and post-order 07
traversal visit the vertices of the ordered rooted tree shown in figure?

*****

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy