Menu

Question Discussion & Solution

MCQ

Q.

Which of the given statement is true?

A

All the Cyclic Directed Graphs have topological sortings

B

All the Acyclic Directed Graphs have topological sortings

C

All Directed Graphs have topological sortings

D

None of the given statements is true

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Login to Discuss

Similar Questions

MCQ

1.

In the case of Fibnocci heap the running time of Prim

A

O(E log V)

B

O(V log E)

C

O( log V)

D

O(E log E)

Discussion

MCQ

2.

Given Adjacency matrices determine which of them are PseudoGraphs?
i) {{1,0} {0,1}}

ii) {{0,1}{1,0}}

iii) {{0,0,1}{0,1,0}{1,0,0}}

A

only i)

B

ii) and iii)

C

i) and iii)

D

i) ii) and iii)

Discussion

MCQ

3.

Time Complexity of Breadth First Search is? (V – number of vertices, E – number of edges)

A

O(V + E)

B

O(V)

C

O(E)

D

None of the mentioned

Discussion

MCQ

4.

For an undirected graph G with n vertices and e edges, the sum of the degrees of each vertex is

A

ne

B

2n

C

2e

D

e^n

Discussion

MCQ

5.

What is the number of vertices of degree 2 in a path graph having n vertices,here n>2.

A

n-2

B

n

C

2

Discussion

More Data Structure Topics

Data Structure Basics

128 MCQs

Abstract data types

37 MCQs

Arrays

134 MCQs

Lists

166 MCQs

Stacks

165 MCQs

Queues

61 MCQs

Trees

133 MCQs

Binary Trees

120 MCQs

B Trees

8 MCQs

Heaps

36 MCQs

Hash based structures

7 MCQs

Graphs

157 MCQs

Mixed

10 MCQs