B.N.M.

Institute of Technology
Department: Computer Science & Engineering

Question Bank – Module 5

Course Name: Discrete Mathematical Structures Course Code: 18CS36

Year of Study: ODD SEM 2019-20 SEM: III ‘A’, ‘B’
Faculty Name: Jebah Jaykumar, Namitha J
----------------------------------------------------------------------------------------------------------------
1. Define the following with example
a. Simple graph
b. Regular Graph
c. Subgraph
d. Maximal subgraph
e. Induced subgraph
2. Define the following with example
a. Walk
b. Trail and Circuit
c. Path and cycle
3. Define the following with example
a. Spanning subgraph
b. Induced subgraph
c. Complete graph
d. Complement of a graph
4. Show that there exists no simple graphs corresponding to the following degree
sequences
a. 0,2,2,3,4
b. 1,1,2,3
c. 2,3,3,4,5,6
d. 2,2,4,6
5. Define the following:
a. Bipartite graph
b. Complete bipartite graph
c. Regular graph
d. Connected graph with an example

6. Determine the order |V| of the graph G=(V,E) in the following cases
a. G is cubic graph with 9 edges
b. G is regular graph with 15 edges
c. G has 10 edges with 2 vertices of degree 4 and all other of degree 3.

7. Prove that in the given graph

a. The sum of degrees of all the vertices is an even number and is equal to twice
the number of edges in the graph
b. The number of vertices of odd degree is even.
8. How many edges are there in a graph with 10 vertices each of degree 6.
9.

10. Let T=(V,E) be a complete m-ary tree with |V|=n. If T has L leaves and I internal
vertices, then prove the following:
a. n=m.i+1
b. l=(m-1)i+1
c. i=(l-1)/(m-1) = (n-1)/m
11. Show that a tree with n vertices has n-1 edges.
12. Determine the BFS and DFS traversals on the following Graph:

13. Determine the order of vertices when they are visited in Inorder, Preorder and
Postorder traversal for the following:
 14. Apply Merge sort on the following sequence of numbers: 2,3,5,7,9,12,16,19,24,27
15. Evaluate the following expression: +4/*23+1-9^23
16. Suppose that a tree T has two vertices of degree 2, four vertices of degree 3 and three
vertices of degree 4. Find the number of pendant vertices in T.
17. Construct an optimal prefix code for the symbols a,o,q,u,y,z with frequencies
20,28,4,17,12,7 respectively
18. Construct an optimal prefix code for “Road is good”
19. For the prefix code given below, decode the sequences
a)1001111101
b)10111100110001101

20. If F2=(V2,E2) is a forest with |V2|=62 and |E2=51|, how many trees determine F2?