PRINTED PAGES : 3
Paper ID: 16250 Roll No..............................
END-SEMESTER EXAMINATION, 2023-24
B. Tech. (SEMESTER : 03)
CSE 245 : DISCRETE STRUCTURES
Time: 3 Hrs. Max. Marks: 100
Note: 1. All questions are compulsory.
2. Assume missing data suitably, if any.
CO-1. Apply the basic principles of sets and operations in sets.
CO-2. Classify logical notation and determine if the argument is or is not valid.
CO-3. Construct and prove models by using algebraic structures
CO-4. Analyze basic principles of Boolean algebra with mathematical description.
CO-5. Construct Permutations and combinations in counting techniques and applications of Graph
Theory.
CO-6. Compose computer programs in a formal mathematical manner.
COS Marks BTL
SECTION-A
All Questions are Compulsory: (10×4=40 Marks)
1. Choose an example of a relation on a set which is CO1 4 K1
(i) Reflexive but not symmetric
(ii) Transitive and reflexive but not symmetric
2. Show whether A – (B∪C) = (A–B) ∪(A–C). CO1 4 K2
3. Show whether true or false on two propositions about arithmatic over the CO2 4 K1
integers x and y:
(i) ∀x∃y(x+y=0) (ii) ∃y∀x(x+y=0)
4. Draw truth table for ¬(p↔q) ⋁ (pq). CO2 4 K2
5. Consider G= {1,2,3,4} classify whether <G, +> is semi group or not, where CO3 4 K2
+ is binary addition.
6. Apply the properties of algebric structures toi Prove that G ={0,1,2,3,4} is CO3 4 K3
an abelian group of order 5 with respect to addition modulo 5.
7. Interpret the output. CO4 4 K2
8. Develop truth tables with explanation for NOT, NOR and NAND gates. CO4 4 K3
9. Contrast the differences between Combinational and sequential Circuits. CO5 4 K2
10. Identify the differences between planner graph and non planner graph. CO5 4 K3
f
1 13
SECTION-B
All Questions are Compulsory: (3×6=18 Marks)
11. (a) Examine following cyclic groups. Find all the generators of the cyclic CO3 6 K4
group:
1. (G= {0,1,2,3,4,5}, +6)
2. (G= {1,2,3,4}, ×5)
--- OR ---
(b) Assume (R, +, *) is a ring defined by a * a = a. Determine whether the
ring is commutative or not.
12. (a) Check if following statement is valid argument or not: CO4 6 K4
p ⇒q
q ⇒r
∴ p ⇒r
--- OR ---
(b) simplify and find solution to the recurrence relation an-7an-1+10an-2 =0
for n ≥ 2 given that a0=10, a1=41 using generating functions.
13. (a) Simplify, how many different words are there in the word CO5 6 K4
MATHEMATICS.
--- OR ---
(b) What are Kuratowski’s graphs? Examine their properties as non-planar
graphs.
SECTION-C
All Questions are Compulsory: (3×10=30 Marks)
14. (a) Examine the following: Maximal, Minimal, Lower Bound, Upper CO3 10 K4/K5
Bound, Greatest Lower Bound (GLB), and Least Upper Bound for the
subsets i) {d, k, f} ii) {b, h,f} iii) {a, b, c}. The Hasse diagram is given
below;
--- OR ---
(b) Define COSET and its types in detail with example.
15. (a) Simplify the following Boolean function using the four variable K-map. CO4 10 K4/K5
2 23
F(w,x,y,z) = Σ (2,3,10,11,12,13,14,15)
--- OR ---
(b) Find the generating function for the finite sequence a) 2, 2, 2, 2, 2, 2. 2. b)
1, 4, 16, 64, 256
16. (a) Discover the inorder, preorder and post-order traversal of the given tree. CO5 10 K4/K5
3
18
6
19 8
8 3
7
2
--- OR ---
(b) Analyse the recurrence relation yn+2 – 5yn+1 + 6yn = 5n subject to the
condition y0 = 0, y1 = 2.
SECTION-D
Attempt the following Question: (1×12=12 Marks)
17. (a) Evaluate the generating function for the sequence 1, a, a2, a3,a4, . . . . CO6 12 K5/K6
And also find the recurrence relation of the Fibonacci sequence.
--- OR ---
(b) Create a graph and explain graph coloring and chromatic number, Euler,
and Hamiltonian path in detail with example.
*******
3 33
