Scribd
Upload
92 views2 pages

Dstl Question Bank

Notes

Uploaded by

nida
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
92 views2 pages

Dstl Question Bank

Notes

Uploaded by

nida
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

B.

Tech-III SEM / BCS303: Discrete structure and theory of logics/ Question


Bank/ Nida Rahman/ Assistant Professor / Department of CSE / JMS Institute of
Technology Ghaziabad

Subject Name: Discrete Structure & Theory Ms. NIDA


of Logic (BCS303) Faculty Name: RAHMA
N
S. Question (Statement) - appeared in AKTU Year (III Mark
No. End Sem Exams SEM) s
UNIT-1

1 Let A,B, and C, be three nonempty sets such that we 6


have A∩C = B∩C and A∪C = B∪C. Justify that A = B.
2 Let A = {1,2,3,4,5,6}. Use Warshall algorithm to 6
compute the transitive closure of the relation R on A
given by R ={(1,2),(1,3),(2,4), (5,6)}.
3 Consider the set P = {1,2,3,4,5,6,7,8} partially 6
ordeded by the relation ”divides”. Find the lower and
upper bounds of the subsets A = {1,2} and B =
{3,4,5} of the poset P. Also, find the sup(A), inf(A),
sup(B), and inf(B).
4 Let X = {1,2,3,...,6,7}, and R ={(x, y) ∈ X ×X | x−y is 6
divisible by 3}. Is R an equivalence relation on X?
Draw the digraph of R.
UNIT-2

7 Let f : A → B and g : B → C be two functions such that the 10

composite function g ◦ f : A → C is a bijective function then


Justify that f is injective, and g is surjective.Also if f : A → B
and g : B → C are bijective functions, then so is g ◦ f : A →
C.
6
8 Consider the elements α = (13562) and β = (1523)(46) of the
permutation group S6. Compute the elements α−1βα and
β−1αβ.
6
9 Justify that the set B = {1,2,3,6} is a Boolean algebra with
respect to operations given by a+b = lcm(a,b), a · b =
hcf(a,b), and a′ =6/a
Justify that a lattice with 5 elements cannot be a Boolean 6
10 algebra, with respect to usual operations.
6
11 Use truth table & algebraic method to obtain the DNF of the
Boolean expressions f(x, y, z) = (yz+xz′)(xy′ +z′)′ and g(x, y,
z)=xy'+z.
6
12 Use K-map to simplify the Boolean function F(a,b, c,d)=
∑(0,1,2,3,4,5,6,7,8,9,11).Also, draw the digital circuits of the
simplified expression.
B. Tech-III SEM / BCS303: Discrete structure and theory of logics/ Question
Bank/ Nida Rahman/ Assistant Professor / Department of CSE / JMS Institute of
Technology Ghaziabad

You might also like