Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
151 views1 page

DSTL Ut-1... 2023

This document is the question paper for a discrete structures and theory of logic exam for third semester B.Tech CS/IT students given by Rajshree Institute of Management and Technology in Bareilly. The paper has three sections - Section A contains 6 short answer questions, Section B contains 3 long answer questions to attempt any 3, and Section C contains 2 long answer questions to attempt 1. The questions cover topics like set representation, equivalence relations, K-maps, bijective functions, SOP and POS forms, partial orders, lattices, Boolean algebra, and modular lattices. Students have 1 hour and 30 minutes to complete the paper worth 20 marks.

Uploaded by

Ashish Saxena
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
151 views1 page

DSTL Ut-1... 2023

This document is the question paper for a discrete structures and theory of logic exam for third semester B.Tech CS/IT students given by Rajshree Institute of Management and Technology in Bareilly. The paper has three sections - Section A contains 6 short answer questions, Section B contains 3 long answer questions to attempt any 3, and Section C contains 2 long answer questions to attempt 1. The questions cover topics like set representation, equivalence relations, K-maps, bijective functions, SOP and POS forms, partial orders, lattices, Boolean algebra, and modular lattices. Students have 1 hour and 30 minutes to complete the paper worth 20 marks.

Uploaded by

Ashish Saxena
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/ 1

RAJSHREE INSTITUTE OF MANAGEMENT AND TECHNOLOGY, BAREILLY

UNIT-TEST-1
B.TECH CS/IT Third SEM. (2023-24)
Discrete Structures and Theory of Logic

TIME: 1:30 hours MM: 20 MARKS

SECTION A
1. Attempt allquestions in brief. 1x6=6
a) Discuss the ways of set representation. (CO1)
b) Explain an equivalent relation. (CO1)
c) Explain maxtermsin K-map. (CO2)
d) What is a bijective function? (CO2)
e) What are SOP and POS forms? (CO2)
f) What is a POSET?(CO1)

SECTION B

2. Attempt any three questions. 3*3=9

a) If A={1,2,3,6} where a is related to b by divisibility. Check whether the relation is partial


order or not. Construct a hasse diagram and determine maximal and minimal elements.
(CO1)
b) Explain lattice and its properties pictorially. (CO1)
c) Define Boolean algebra. Show that a’.[(b’+c)’+ b.c] + [(a+b’)’.c] = a’.b using rules of
Boolean Algebra. Where a’ is the complement of an element a. (CO2)
d) Simplify using K-map: F(A,B,C,D) = ∑( m0, m1, m2, m4, m5, m6, m8, m9, m12, m13,
m14 ). (CO2)

SECTION C
3. Attempt any one question. 1*5=5
a)Define Modular Lattice. Justify that if ‘a’ and ‘b’ are the elements in abounded
distributive lattice and if ‘a’ has complement a′. Then, (CO1)
I) a ˅ (a′˄ b)=a˅ b II ) a˄ (a′˅ b)=a˄ b
b) Simplify the following Boolean expressions using Boolean algebra (CO2)
i. xy + x ́z +yz
ii. C(B + C)(A + B + C)
iii. A + B(A + B) + A(A ́ + B)
iv. XY + (XZ) ́ + XY ́Z(XY + Z)

You might also like