Cse 245 Discrete Structures 2023-24 (Even Term)

PRINTED PAGES : 3
Paper ID: 16250 Roll No..............................
END-SEMESTER EXAMINATION, 2023-24

(TERM : 2302)
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. If A = {3, 5, 7, 9, 11}, B = {7, 9, 11, 13}, C={11, 13, 15}. Find A∩(B∪C), CO1 4 K1
(A∩B)∪C.
2. Give an example with directed graph and matrix of a relation on a set which is CO1 4 K2
(i) Reflexive but not symmetric (ii) Transitive and reflexive but not symmetric.
3. Show using mathematical induction that for all n≥1, n3 + 2n is a multiple of 3 CO2 4 K1
4. Using the logical equivalences, show that ~(P (P q)) is a CO2 4 K2
contradiction.
5. Show that G = {1, –1, i, –i } is an abelian group under multiplication. CO3 4 K2
6. Apply the properties of algebric structures toi Prove that G ={0,1,2,3,4} is an CO3 4 K3
abelian group of order 5 with respect to addition modulo 5.
7. Describe Pigeon hole principle with suitable example. CO4 4 K2
8. Solve the following Boolean expression to a minimum number of literals. CO4 4 K3
(a) (X+Y) (X+Y’) (b) XY+X’Z+YZ
9. Contrast the differences between Combinational and sequential Circuits. CO5 4 K2
10. Construct and define the following with one example: CO5 4 K3
(a) Bipartite graph (b) Planar Graph
SECTION-B
11. (a) Examine hasse diagram with the help of example. CO3 6 K4
--- OR ---
(b) Assume (R, +, *) is a ring defined by a * a = a. Determine whether the
ring is commutative or not.
12. (a) Analyse F(A,B,C,D) = M(6,7,8,9) + d(10,11,12,13,14,15). Find minimal CO4 6 K4
form using K-Maps.
--- OR ---
1 13
(b) Distinguish between combinational logic and sequential logic with a
suitable diagram.
13. (a) What are Kuratowski’s graphs? Examine their properties as non-planar CO5 6 K4
graphs.
--- OR ---
(b) Prove that a simple graph with at least two vertices has at least two
vertices of same degree.
SECTION-C

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) Consider the poset ({2, 4, 5, 10, 12, 20, 25}, |). Represent the poset
using Hasse diagram. Discover maximal, minimal, least upper bound
and greatest lower bound.
15. (a) Assume A= {1, 2, 3, 5, 6, 10, 15, 30} be a set and R be a relation R of CO4 10 K4/K5
divisibility on A. Show that R is a partial order on A & draw its hasse
diagram of R. Is R a Linear order relation? What about if A= {2, 4, 8,
16, 32}?
--- OR ---
(b) Decide whether the posets represented by each of the following Hasse
diagrams are lattices.
2 23
16. (a) Evaluate, A computer password consists of a letter of the English CO5 10 K4/K5
alphabet followed by 2 or 3 digits. Find the following: (i) The total
number of passwords that can be formed (ii) The number of passwords
that no digit repeats.
--- OR ---
(b) List the properties of the Eulerian and Hamiltonian graphs. Also, give an
example of a graph that is Eulerian but not Hamiltonian.
SECTION-D
Attempt the following Question: (1×12=12 Marks)

17. (a) Create a graph and explain graph coloring and chromatic number, Euler, CO6 12 K5/K6
and Hamiltonian path in detail with example.
--- OR ---
(b) What do you mean by a binary tree? What are the different ways to
traverse a tree? Consider a BST whose preorder traversal is 19, 15, 10, 9,
12, 17, 16, 18, 25, 21, 27. Find the post-order traversal of the BST.
*******
3 33

Cse 245 Discrete Structures 2023-24 (Even Term)

Uploaded by

Copyright:

Available Formats

Cse 245 Discrete Structures 2023-24 (Even Term)

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

Cse 245 Discrete Structures 2023-24 (Even Term)

Uploaded by

Copyright:

Available Formats

PRINTED PAGES : 3

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

END-SEMESTER EXAMINATION, 2023-24

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.