Menu

Question Discussion & Solution

MCQ

Q.

The column sum in an incidence matrix for a simple graph is __________

A

depends on number of edges

B

always greater than 2

C

equal to 2

D

equal to the number of edges

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.

The column sum in an incidence matrix for a directed graph having no self loop is __________

B

1

C

2

D

equal to the number of edges

Discussion

MCQ

2.

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

Discussion

MCQ

3.

Time complexity to check if an edge exists between two vertices would be ___________

A

O(V*V)

B

O(V+E)

C

O(1)

D

O(E)

Discussion

MCQ

4.

Every Directed Acyclic Graph has at least one sink vertex.

A

1

C

May be

D

Can't say

Discussion

MCQ

5.

If every node u in G is adjacent to every other node v in G, A graph is said to be

A

isolated

B

complete

C

finite

D

strongly connected

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