Menu

Question Discussion & Solution

MCQ

Q.

Two directed graphs(G and H) are isomorphic if and only if A=PBP-1, where P and A are adjacency matrices of G and H respectively.

A

1

C

May be

D

Can't say

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.

Incidence matrix and Adjacency matrix of a graph will always have same dimensions?

A

1

C

May be

D

Can't say

Discussion

MCQ

2.

Time Complexity of DFS is? (V

A

O(V + E)

B

O(V)

C

O(E)

D

None of the mentioned

Discussion

MCQ

3.

To create an adjacency list C++

A

1

C

May be

D

Can't say

Discussion

MCQ

4.

The number of elements in the adjacency matrix of a graph having 7 vertices is __________

A

7

B

14

C

36

D

49

Discussion

MCQ

5.

Which of the following logical operation can be implemented by polynomial time graph manipulation algorithms using Binary Decision Diagrams?

A

Conjunction

B

Disjunction

C

Negation

D

All of the mentioned

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