Discrete Structures (Cse245) 2022-23
Discrete Structures (Cse245) 2022-23
1 Contd…..
10. Consider the following graph and represent using the adjacency matrix. CO5 4 K3
SECTION-B
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
---- 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
*******
3 Contd…..