Menu

Question Discussion & Solution

MCQ

Q.

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)

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.

kruskal algorithm is based on ___________method

A

Divide and conquer method

B

Greedy method

C

Dynamic programming

D

Branch and bound

Discussion

MCQ

2.

Maximum degree of any vertex in a simple graph of vertices n is

A

2n - 1

B

n

C

n + 1

D

n - 1

Discussion

MCQ

3.

For which of the following combinations of the degrees of vertices would the connected graph be eulerian?

A

1,2,3

B

2,3,4

C

2,4,5

D

1,3,5

Discussion

MCQ

4.

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

A

1

C

May be

D

Can't say

Discussion

MCQ

5.

All paths and cyclic graphs are bipartite graphs.

A

1

C

May be

D

Can't say

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