# Discrete Mathematics - Questions & Answers for Competitive Exams | GkSeries

Questions
49. Hamilton cycle is a cycle that contains every ________ of G.
• [A] path
• [B] cycle
• [C] vertex
• [D] edge

50. A set containing no element is called ____________.
• [A] null set
• [B] finite set
• [C] infinite set
• [D] equal set

51. The number of Indians in the world is _________.
• [A] finite set
• [B] universal set
• [C] infinite set
• [D] equal set

52. There are only five distinct Hasse diagrams for partially ordered sets that contain ________
• [A] 2
• [B] 3
• [C] 4
• [D] 6

53. The production S tends to aB is of the type ________ grammar.
• [A] 0
• [B] 1
• [C] 2
• [D] all the above

54. A regular grammar contain rules of the form is ________.
• [A] A tends to AB
• [B] AB tends to a
• [C] A tends to aB
• [D] AB tends to CD

55. Edges intersect only at their ends are called ________.
• [A] planar
• [B] loop
• [D] non plannar

56. An edge with identical ends is called _________.
• [A] complete graph
• [B] bipartite graph
• [C] loops

57. An edge with same ends is called ___________.
• [A] complete graph
• [B] bipartite graph
• [C] loops

58. If two edges have same vertices as its terminal vertices those edges are called ____.
• [A] parallel
• [C] incident
• [D] distinct

59. The graph defined by the vertices and edges of a __________ is bipartite.
• [A] square
• [B] cube
• [C] single
• [D] both square and cube

60. If the edges of a walk W are distinct then W is called _________.
• [A] path
• [B] trial
• [C] walk
• [D] tour