DISCRETE MATHEMATICS MID-2 ASSIGNMENT

1. Prove that is an abelian group under multiplication.

2. Define Spanning tree. Find the minimal spanning tree of the following
graph by using Krushkal’s Algorithm and Prim’s Algorithm.

3. Enumerate the number of non-negative integer (integral) solutions

of .
4. A certain question paper contains two parts A and B each containing
4 questions. How many different ways a student can answer 5
questions by selecting at least 2 questions from each part?
5. Prove that and Petersen graph is non-planar.
6. For any then prove that (i). (B is a
Boolean algebra.)
7. Prove that the set of all integers Z with binary operation defined
by is a group.
8. Show that the following graphs are isomorphic.

9. Define binomial theorem. Find the coefficient of in the

expansion of .
10. Draw the following graphs and find its chromatic number. That
graphs are .
11. Define a Boolean algebra and discuss its properties.
12. Define tree. What are different tree traversal methods? Explain with
suitable example.
13. A computer password consists of a letter of the alphabet followed by
3 or 4 digits. Find (i) The total number of passwords can be created
(ii).The number of passwords in which no digit appears.
14. In a distributive lattice if an element has a complement then this
element is unique.
15. Define Eulerian circuit, Hamiltonian cycle. Give an example of a
graph which is Eulerian but not Hamiltonian graph and Give an
example of a graph which is Hamiltonian graph but not Eulerian
16. Simplify the following Boolean expressions (i).
(ii).
17. Find the number of arrangements of the letters in “TALLAHASSEE”,
which have no adjacent A’s?
18. Find the number of permutations of the letters of the word
“MISSISSIPPI”. How many of these begin with an “I”? How many of
these all I’s come together? How many of these begin and end with on
“S”?
 DISCRETE MATHEMATICS OBJECTIVE BITS
(UNITS: 3, 4, 5)
1. Which Algorithm can be used to find Minimal spanning tree
(a) DFS (b) BFS (c) TSP (d) Kruskal’s Algorithm
2. The minimum number of vertices required to form a cycle graph is
(a) 3 (b) 2 (c) 4 (d) n
3. Which of the following is a binary operation for the set is
(a) (b) (c) (d)
4. If the height of the full binary tree is 5 then the number of vertices are
(a) 64 (b) 63 (c) 62 (d) 60
5. The number of ways can we distribute 10 identical marbles among 6 distinct containers
(a) (b) (c) (d)
6. A graph without loops and parallel edges is called a
(a) Complete graph (b) simple graph (c) planar graph (d) Wheel graph
7. Chromatic number of any planar graph is
(a) b) (c) 4 (d)
8. The number of permutations of the letters of the word “SUCCESS”
(a) 220 (b) 520 (c) 420 (d) 120
9. The Chromatic number of is
(a) 3 (b) 2 (c) 1 (d) 6
10. Which of the following is a Semi Group?
(a) (b) (c) (d)
11. Which Algorithm can be used to find Spanning tree?
(a) DFS (b) Prim’s Algorithm (c) TSP (d) Kruskal’s Algorithm
12. A graph with all vertices having equal degree is known as
(a) Planar graph (b) Non-Planar graph (c) Simple graph (d) Regular graph
13. A connected graph G with n vertices is tree if and only if it has ____ edges
(a) n (b) n+1 (c) n-1 (d) 2n
14. The number of 2-digit odd numbers are
(a) 40 (b) 35 (c) 45 (d) 25
15. The number of permutations of the letters of the word “BASIC” is
(a) 140 (b) 150 (c) 320 (d) 120
16. Which of the following is a group?
(a) (b) (c) (d)
17. The number of triangles in graph
(a) 1 (b) 2 (c) 0 (d) 4
18. A walk that begins and ends at the same vertices is called a
(a) Open walk (b) Closed walk (c) Trial (d) Path
19. The number of positive integers between 1 and 300 divisible by 5 and 6 is
(a) 20 (b) 30 (c) 5 (d) 10
20. The minimum number of children of each internal vertex in a Binary tree is
(a) 2 (b) 3 (c) 1 (d) 4
21. In a graph G, a vertex whose degree is one is called a Pendent vertex.
22. .
23. Euler’s formula is .
24. In Boolean algebra 1
25. The number of vertices, edges of Complete graph = 5, 10.
26. The number of nonnegative integer solutions of the equation
is .
27. In a Cycle graph degree of each vertex is 2.
28. The set of all odd integers under usual multiplication is not a group.
29. In , identity element is 1.
30. In Boolean algebra Boundedness laws are .
31. In a Tree a vertex whose out degree is zero is called a Leaf.
32. If then n = 10.
33. If each person shakes hands with all the others in the party of 30 persons then the number
of Handshakes = .
34. In , Identity element is does not exists.
35. If repetitions are not allowed then the number of 3-digit numbers can be formed using the
digits 1,3,5,7 are = .
36. The Principle of Inclusion for two sets A, B is .
37.The minimum number of vertices in Cycle graph is 3.
38.An open walk no edge appears more than once is called a Trial.
39. is a sub group of .
40. .