0% found this document useful (0 votes)
43 views3 pages

Discrete Structures (Cse245) 2022-23

Y

Uploaded by

Yash Manral
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
0% found this document useful (0 votes)
43 views3 pages

Discrete Structures (Cse245) 2022-23

Y

Uploaded by

Yash Manral
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/ 3

PRINTED PAGES : 3

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

END-SEMESTER EXAMINATION, 2022-23


(TERM : 2202)
CSE 245 : DISCRETE STRUCTURES
Time : 03 Hrs. Max. Marks : 100
Note: 1. All questions are compulsory.
2. Assume missing data suitably, if any.

CO1: Apply the basic principles of sets and operations in sets.


CO2: Classify logical notation and determine if the argument is or is not valid.
CO3: Construct and prove models by using algebraic structures
CO4: Analyze basic principles of Boolean algebra with mathematical description.
CO5: Construct Permutations and combinations in counting techniques and applications of Graph
Theory.
CO6: Compose computer programs in a formal mathematical manner
COS Marks BTL
SECTION-A

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


1. Find the cardinal number of the following sets: CO1 4 K1
(a) A= { x: x=5n, n∈N and n<5}
(b) B= { x: x is a consonant in English Alphabet }
(c) X= {x: x is an prime number }
(d) Q={x: −3≤x≤5, x∈Z}
2. U = {1, 2, 3, 4, 5, 6, 7, 8}; P = {3, 6}; Q = {1, 3, 4, 5, 6, 8}; R = {3, 4, 8} CO1 4 K2
(a) Draw a Venn diagram, showing these sets with all the elements entered
into the appropriate regions. If necessary, redraw the diagram to eliminate
any empty regions.
(b) Which of sets P, Q, and R are proper subsets of others? Write your
answer(s) using the ⊂ symbol.
3. Let R be the binary relation defined as R = {(X, Y) Є N x N: X - Y≤3}. CO2 4 K1
Determine whether R is reflexive, symmetric, antisymmetric, or transitive.
4. Use Mathematical Induction to Prove that sum of n even positive integers is CO2 4 K2
n(n+1). i.e. 2 + 4 + 6 + ……………..+ 2n = n (n+1)
5. Let S = {1, -1, i, -i} with binary operation multiplication be an algebraic CO3 4 K2
structure. Determine whether it is an abelian group or not.
6. What do you mean by semigroup homomorphism? Explain with an example. CO3 4 K3
7. Define Lattice with its property. CO4 4 K2
8. Explain Boolean algebra. Describe any four basic rules of Boolean algebra. CO4 4 K3
9. Illustrate the following with respect to graph: CO5 4 K2
(a) in-degree (b) out-degree
(c) path (d) adjacency matrix

1 Contd…..
10. Consider the following graph and represent using the adjacency matrix. CO5 4 K3

SECTION-B

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


11. (a) Let A = {1, 2, 3, 4, 6, 8, 9, 12, 18, 24} be ordered by the relation “x divides CO3 6 K4
y.” Draw the Hasse diagram, and find the Minimal element, Maximal
element, Least element, and Greatest element.
---- OR ----
(b) Consider the set G = {1, ω, ω } and a binary operator multiplication. Prove
2

that set G is a group under the above operation. Where ω is the cube root of
unity.
12. (a) Explain the application of recurrence relation? State and explain a recursive CO4 6 K4
algorithm for finding the factorial of n.
---- OR ----
(b) Minimize the following Boolean function using laws of Boolean algebra
F(w,x,y,z)=w`x`yz + w`xyz + wx`yz + wxy`z`+ wxy`z + wxyz` + wxyz
13. (a) Explain Binary tree traversal. Construct a Binary search tree for 76, 5, CO5 6 K4
29, 12, 34, 8, and 200.
---- OR ----
(b) Define planar graph. Explain the steps involved in testing for the planarity
of a graph.

SECTION-C

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


14. (a) Determine whether the posets represented by the following Hasse diagrams CO3 10 K4/K5
are Bounded lattices, and/or Distributive lattices:

---- OR ----

2 Contd…..
(b) Consider the group G = {1, 2, 3, 4, 5, 6} under multiplication modulo 7.
(i) Find the multiplication table of G.
(ii) Find 2−1, 3−1, 6−1.
(iii) Find the orders and subgroups generated by 2 and 3.
(iv) Is G cyclic?
15. (a) Show that the maximum number of edges in a simple graph with n vertices CO4 10 K4/K5
is n(n-1)/2.
---- OR ----
(b) Find the generating function for each of the following sequences by relating
them back to a sequence with a known generating function.
(i) 4,4,4,4,4,…. (ii) 2,4,6,8,10,….
16. (a) Consider a BST whose preorder traversal is 19, 15, 10, 9, 12, 17, 16, 18, CO5 10 K4/K5
25, 21, 27. Find the post-order traversal of the BST.
---- OR ----
(b) Graph 𝐺 is represented by the following adjacency matrix:
01110
10101
A= ⌊ ⌋
11001
01110
(i) Draw the graph G.
(ii) Determine whether G is a tree.
(iii) Determine whether 𝐺 is an Eulerian graph. Justify your answer.

SECTION-D

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


17. (a) Minimize the following Boolean function using algebraic manipulation. CO6 12 K5/K6
F=ABC’D’ + ABC’D + AB’C’D+ ABCD + AB’CD + ABCD’+AB’CD’
---- OR ----
(b) Simplify the following Boolean expression by applying D-Morgan’s
theorem

*******

3 Contd…..

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