DM Objective Questions (with Answers)

The problem of finding a path in a graph that visits every vertex exactly once is called Hamiltonian Path?

If G is simple connected Planar graph with 6 vertices & 8 edges, then the number of regions is 4 _______.

The chromatic number for cycle graph C4 is 2 _______.

The number of infinite regions in a connected planar is 0 ____________.

A complete bipartite graph is denoted by K(m,n) _________.

Can we draw a graph of degree sequence, 1,1,2,3,4 No.________.

Eulers formula for simple Planar connected graph is V - E + R = 2 ______________.

The degree of vertex is equal to no. of edges incident from that vertex _________ incident from that vertex.

10. The graph is a collection of vertices & edges _________ & ________.

11. The total number of words which can be formed out of the letters

a,b,c,d,e,f taken 3 together, such that each word contains at least

one vowel is ____.

12. In how many ways can 10 boys be seated in a row having 28

seats such that no two friends occupy adjacent seats?

13. A__________ is a partially ordered set Lattice (L, ) in which every

subset {a, b} consisting of two elements has a least upper bound

and a greatest lower bound.

14. Let (S,*) be a semigroup and let T be a subset of S. If T is closed

under the operation *, Then (T,*) is called a subsemigroup ...... of (S,*) .

15 A relation R on a set A is said to be symmetric if (a,b) R (b,a) R

16 The minimum number of colors required to color each vertex of a

graph is known as _________.

17 __________is a theorem that is used to find the expansion of

algebraic identity (ax + by)n.

18 The number of ways of selecting 10 balls from 10 red balls, 10 blue

balls and 10 white balls is _________.

Page 1
 DM Objective Questions (with Answers)

19 The total number of different permutations can be made from the

letters of the word MISSISSIPPI 34650 is ________.

20 An arrangement of objects where the order in which the objects are selected does not matter is known as

Combination _______.

21. Define Tree A connected acyclic graph:_______________.

22.Which of the following graphs must have a Hamiltonian path a) A complete graph with any number of vertices?

a) A complete graph with any number of vertices

b) A bipartite graph with an even number of vertices

c) A graph that is disconnected

d) A tree with more than 2 vertices

22 How many ways are there to choose a committee of 3 people from a group of 10 120?

23. Every Isomorphic graph must have Same degree sequence representation.

24. Let a set S = {2, 4, 8, 16, 32} and <= be the partial order defined by S<= R if a divides b. Number of edges in the

Hasse diagram 4 of

25. In a graph coloring problem, the chromatic number of a graph is the minimum number of colors needed:

26. How many 4-letter words can be formed using the letters A,B,C,D with repetition 256 allowed?

27. If Every two elements of a poset are comparable then the poset is called Totally Ordered Set

28. In a__________the vertex set and the edge set are finite sets Finite Graph.

29. A Poset in which every pair of elements has both a least upper bound and a greatest lower bound is termed as

Lattice

30.In how many ways can the letters of the word SANFOUNDRY 72576 be rearranged such that the vowels always

appear together?

31. Prims algorithm can be implemented using Priority Queue

32. The graph shown in fig are planar or Non planar _________

33.The number of ways to arrange n distinct items is given by n!___________

Page 2
 DM Objective Questions (with Answers)

34. A group in which every element is its own inverse is called an Abelian group___________ group.

35.Multinomial coefficient is _____________________

36. The________________of a graph is the minimal number of colours needed to colour the vertices in such a way

that no two adjacent vertices have the same colour.

37.The formula for calculating P(n,r) n! / (n-r)!_______and C(n,r) n! / (r!(n-r)!)_________

38. A with partitions of equal vertices may or may not contain a Hamiltonian Path, depending on how the vertices are

connected

39. ___________is an Euler's formula V - E + R = 2

40. __________is a theorem that is used to find the expansion of algebraic identity Binomial Theorem (ax + by)n.

41. The problem of finding a path in a graph that visits every vertex exactly once is called?

42. In how many ways can 10 boys be seated in a row having 28 seats such that no two friends occupy adjacent

seats?

43. In how many ways can the letters of the word SANFOUNDRY 72576 be rearranged such that the vowels always

appear together?

44. Which of the following statements is true about a Hamiltonian path a) A complete graph with any number of vertices

in a graph?

a) A Hamiltonian path a) A complete graph with any number of vertices visits every vertex exactly once

b) A Hamiltonian path a) A complete graph with any number of vertices visits every edge exactly once

c) A Hamiltonian path a) A complete graph with any number of vertices always starts and ends at the same vertex

d) A Hamiltonian path a) A complete graph with any number of vertices cannot exist in undirected graphs

45. Which of the following statements is true about a spanning tree of a connected undirected graph c) It is a subgraph

that includes all vertices and is acyclic?

a) It contains all the edges of the original graph

b) It contains cycles

c) It is a subgraph that includes all vertices and is acyclic

Page 3
 DM Objective Questions (with Answers)

d) It has more than one connected component

46. In a ______ the vertex set and the edge set are finite sets Finite Graph.

47. A Poset in which every pair of elements has both a least upper bound and a greatest lower bound is termed as

48. If Every two elements of a poset are comparable then the poset is called Totally Ordered Set

49. Let a set S = {2, 4, 8, 16, 32} and <= be the partial order defined by S<= R if a ivides b. Number of edges in the

Hasse diagram 4 of is

50. Every Isomorphic graph must have Same degree sequence ___________representation.

51.There is a unique node in a binary tree Root called its

52. The formula for calculating P(n,r) n! / (n-r)! and C(n,r) n! / (r!(n-r)!)

53. The principle of inclusion and exclusion for two sets A and B |A B| = |A| + |B| - |A B| gives the number of elements

in their AB as ____________________________

54 ________is a theorem that is used to find the expansion of algebraic identity Binomial Theorem (ax + by)n.

55.Multinomial coefficient is ________________________________

56.The graph shown in fig are planar or Non planar

57.A is__________ a graphical representation of the relation of elements Hasse Diagram of a (poset) with an

implied upward orientation.

58. Prims algorithm can be implemented using Priority Queue

59. The __________of a graph is the minimal number of colours needed to colour the vertices Chromatic Number in

such a way that no two adjacent vertices have the same colour.20. 60 ___________is an Euler's formula V - E + R = 2.

Page 4