Miscellaneous On Data Structures - Study Mode

Show All Answers

[#761] To which class does the Euler's circuit problem belong?

(A) P class

(B) NP class

(C) Partition class

(D) Complete class

Correct Answer

(A) P class

[#762] What is the minimum number of cuts that a graph with 'n' vertices can have?

(A) n+1

(B) n(n-1)

(C) n(n+1)/2

(D) n(n-1)/2

Correct Answer

(C) n(n+1)/2

[#763] How many edges will a tree consisting of N nodes have?

(A) Log(N)

(B) N

(C) N - 1

(D) N + 1

Correct Answer

(C) N - 1

[#764] The chromatic number of star graph with 3 vertices is greater than that of a complete graph with 3 vertices.

(A) True

(B) False

Correct Answer

(B) False

[#765] Which term defines all the complete bipartite graph that are trees?

(A) Symmetric

(B) Anti - Symmetric

(C) Circular

(D) Stars

Correct Answer

(D) Stars