Home / Engineering / Design and Analysis of Algorithms / Question

M

Mr. Dubey • 51.43K Points
Coach 

Q.) Is every complete bipartite graph a Moore Graph.

(A) true
(B) false
(C) ---
(D) ---
Correct answer : Option (A) - true

Explanation: 
 in graph theory, moore graph is defined as a regular graph that has a degree d and diameter k. therefore, every complete bipartite graph is a moore graph.

Share

Previous

Next

Discusssion

Login to discuss.

Related MCQs on Design and Analysis of Algorithms

Q. 74L5138 chip functions as

Q. The relationship between a derived class (or subclass) and base class is referred to as

Q. Inspections can find all the following except

Q. What is the network ID for a computer whose IP address is 190.148.64.23?

Q. + '3'

Q. Reverse engineering techniques for internal program data focus on the definition of classes of objects.

Q. If in a software system, the operation is incorrect if results are not produced accor- ding to the specified timing requirements then the software system is referred as

Q. What happens when a class with parameterized constructors and having no default constructor is used in a program and we create an object that needs a zero-argument constructor?

Q. Identify the correct statement

Q. Which of the following approach is adapted by C++?