Scribd
Upload
113 views2 pages

DISCRETE STRUCTURE CSE III Sem.

This document appears to be an exam for a Discrete Structures course. It contains 5 questions testing concepts like sets, logic, functions, relations, groups, lattices and graphs. Students are required to prove statements and solve problems related to discrete mathematics topics.

Uploaded by

jatinshaarmaa
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
113 views2 pages

DISCRETE STRUCTURE CSE III Sem.

This document appears to be an exam for a Discrete Structures course. It contains 5 questions testing concepts like sets, logic, functions, relations, groups, lattices and graphs. Students are required to prove statements and solve problems related to discrete mathematics topics.

Uploaded by

jatinshaarmaa
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/ 2

Sub Code: BCST 302 ROLL NO……………..……………..

III SEMESTER EXAMINATION, 2022 – 23


IInd year, B.Tech. – Computer Science & Engineering
DISCRETE STRUCTURE
Duration: 3:00 hrs Max Marks: 100
Note: - Attempt all questions. All Questions carry equal marks. In case of any ambiguity or missing data,
the same may be assumed and state the assumption made in the answer.

Q 1. Answer any four parts of the following. 5x4=20


a) Prove the distributive law which states that A ∩ (B ∪ C) = (A ∩ B) ∪ (A ∩ C) for
all sets A, B, and C.
b) Define relation. How many relations are there on a set with n elements?
c) The relation R on a set A is transitive if and only if Rn ⊆ R for n = 1, 2, 3,....
d) Explain all set operations with suitable examples.
e) Define function with suitable example. Let f1 and f2 be functions from R to R such
that f1(x) = x2 and f2(x) = x − x2. What are the functions f1 + f2 and f1f2?
f) Prove that if there is a surjective funtion f : A → B then |B| ≤ |A|. If there is a bijective
function f : A → B then |A| = |B|.
Q 2. Answer any four parts of the following. 5x4=20
a) Define Propostion with Example. Also find the negation of the following
propositions and express this in simple English.
(i) Vandana’s smartphone has at least 32GB of memory.
(ii) Michael’s PC runs Linux.
(iii) 2 + 1 = 3.
b) What are the contrapositive, the converse, and the inverse of the conditional
statement - “The home team wins whenever it is raining”?
c) Define tautology, contradiction and contingency. Also show that
(p ∨ q) ↔ (q ∨ p) is a tautology.
d) Define quantifiers and its types. Translate the statement
∀ x(C(x) ∨ ∃ y(C(y) ∧ F (x, y)))
into English, where C(x) is “x has a computer,” F (x, y) is “x and y are friends,” and
the domain for both x and y consists of all students in your college.
e) Prove that If α2 is an even integer, then α is an even integer.
f) Prove the De Morgan’s Laws of the poposition logic.
Q 3. Answer any two parts of the following. 10x2=
a) Prove that If (A, ≤) and (B, ≤) are partially ordered sets, then (A × B, ≤) is a partially 20
ordered set with the partial order ≤, defined by (a , b) ≤ (a′ , b′ ) if a ≤ a′ in A and
b ≤ b′ in B.
b) What is POSET? Draw the Hasse diagram representing the positive divisions of 36
(i.e., D36). Also find out minimal, maximal, greatest, and least elements.
c) Describe lattice and its types. Determine whether the ({1, 2, 3, 4, 5}, /) and
({1, 2, 4, 8, 16}, /) are lattices.
Q 4. Answer any two parts of the following. 10x2=
a) Show that the set G = {1, –1, i, –i} where i = √−1 is an abelian group with respect 20
to multiplication as a binary operation. what is the inverse in this case? 1
b) Prove all the five properties of the group.
c) Explain ring, integral domain, and field. Also show that R = {0, 1, 2, 3, 4, 5, 6} is a
ring under addition and multiplication modulo 7.
Q 5. Answer any two parts of the following. 10x2=
a) Find all solutions of the recurrence relation an = 3an−1 + 2n. What is the solution with 20
a1 = 3?
b) Prove the pigeonhole principal. What is the minimum number of students required
in a discrete mathematics class to be sure that at least six will receive the same grade,
if there are five possible grades, A, B, C, D, and F?
c) Prove that an undirected graph has an even number of vertices of odd degree. How
many edges are there in a graph with 10 vertices each of degree six?

**********

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