Discrete Structures (Cse245) 2022-23 (2)

PRINTED PAGES : 3
Paper ID: 16250 Roll No..............................
END-SEMESTER EXAMINATION, 2022-23

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. Let U = {1,2,3,4,5,6,7,8,9}, A = {1,2,3,4,5}, B = {4,5,6,7}, C = { 5,6,7,8,9} CO1 4 K1
and D = {1,3,5,7,9}. Find the following:
(a) A Ո C (b) D' (c) U – {AՈC} (d) P({AՈC}).
2. Give an example with directed graph and matrix of a relation on a set which CO1 4 K2
is
(a) Reflexive but not symmetric
(b) Transitive and reflexive but not symmetric (Assume suitable data)
3. Define the following terms with example: CO2 4 K1
(a) Converse (b) Tautology
(c) Contradiction (d) Logical Connectives.
4. Verify ((p∨˥q) ∧ (˥p∨˥q)) ∨q is a tautology or not. CO2 4 K2
5. Explain the group homomorphism with the help of a suitable example. CO3 4 K2
6. Draw the Hasse diagram for D24 = {1, 2, 3, 4, 6, 8, 12, 24}, D36 = {1, 2, 3, 4, CO3 4 K3
6, 9, 12, 18, 36} considering the partial order divisibility relation.
7. Describe Pigeon hole principle with suitable example. CO4 4 K2
8. Define the basic constituents of a graph with the help of an example. CO4 4 K3
9. Define Binary Search Tree with a suitable example. CO5 4 K2
10. Define the following: CO5 4 K3
(a) Simple graph (b) Directed graph
(c) Adjacent nodes in a graph (d) Strongly connected in a graph.
1 Contd…..
SECTION-B

11. (a) Show that (G,*) is an abelian group, where G is the set of all non-zero real CO3 6 K4
numbers and the * operator is defined as a * b = (a multiplies b) divided
by 3.
---- OR ----
(b) What are the various inference rules of quantifiers? Explain any two of
them, with a suitable example.
12. (a) What are Recursive algorithms? State and explain a recursive algorithm CO4 6 K4
for finding the factorial of n.
---- OR ----
(b) Minimize the following Boolean function using laws of Boolean algebra:
F(a,b,c,d)=a`b`cd + a`bcd + ab`cd + abc`d`+ abc`d + abcd` + abcd
13. (a) Construct an expression tree for the expression CO5 6 K4
(a + b * c) + ((d * e + 1) * g).
Give the outputs when you apply preorder, inorder and postorde traversals.
---- OR ----
(b) Consider the following graph and represent using the adjacency matrix.
Comment about the complexity of checking whether an edge (i, j) exists in
the graph using an adjacency matrix.
SECTION-C

14. (a) Consider the third-order homogeneous recurrence relation: CO3 10 K4/K5
an = 6an−1 − 12an−2 + 8an−3
(i) Find the general solution.
(ii) Find the solution with initial conditions a0 = 3, a1 = 4, a2 = 12.
---- OR ----
(b) Convert each of the following Boolean expressions to SOP form:
(i) (AC+B)(A+B’C)+AC (ii) (A+ B)(B + C + D)
15. (a) Compare and explain the following lattice with suitable examples: CO4 10 K4/K5
(i) Bounded Lattice (ii) Complemented Lattice (iii) Distributive Lattice
(iv) Sub Lattice (v) Complete Lattice
---- OR ----
2 Contd…..
(b) Map the following SOP expressions on K-maps and write the minimized
Boolean expression. F(A, B, C, D) = ∑(0,1,4,5,6,7,9,11)
16. (a) Differentiate between planar and bipartite graphs. Draw K3, K5, and K3,3 CO5 10 K4/K5
graphs and state whether these are bipartite or planar or none of these.
---- OR ----
(b) Using mathematical induction Prove that the maximum number of edges in
a simple graph with n vertices is n(n-1)/2.
SECTION-D
Attempt the following Question: (1×12=12 Marks)

17. (a) With the help of K-map, minimize the following Boolean function also CO6 12 K5/K6
design a logic circuit for the same:
F(A,B,C,D) = ∑ 𝑚(0, 1,2,5,7,8,9,10,13,15).
---- OR ----
(b) The product of sum(POS) of a Boolean function F(A,B,C) of three variable
is given by F(A,B,C) = (A+B+C’).(A’+B’+C’).(A+B’+C’).(A’+B+C)
Find the canonical sum of product (POS) expression for the above-given
function.
Since the given boolean expression has 4 variables, so we draw a 4 x 4 K
Map. We fill the cells of K Map in accordance with the given boolean
function. Then, we form the groups in accordance with the above rules
*******
3 Contd…..

Discrete Structures (Cse245) 2022-23 (2)

Uploaded by

Copyright:

Available Formats

Discrete Structures (Cse245) 2022-23 (2)

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Discrete Structures (Cse245) 2022-23 (2)

Uploaded by

Copyright:

Available Formats

PRINTED PAGES : 3

Paper ID: 16250 Roll No..............................

END-SEMESTER EXAMINATION, 2022-23

CO-1. Apply the basic principles of sets and operations in sets.

COS Marks BTL

All Questions are Compulsory: (10×4=40 Marks)

All Questions are Compulsory: (3×6=18 Marks)

All Questions are Compulsory: (3×10=30 Marks)

Attempt the following Question: (1×12=12 Marks)

You might also like

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