Menu

Question Discussion & Solution

MCQ

Q.

If the data collection is in sorted form and equally distributed then the run time complexity of interpolation search is ?

A

?(n)

B

?(1)

C

?(log n)

D

?(log (log n))

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.

An undirected graph G with n vertices and e edges is represented by adjacency list. What is the time required to generate all the connected components?

A

O (n)

B

O (e)

C

O (e+n)

D

O (e-n)

Discussion

MCQ

2.

The minimum number of edges in a connected cyclic graph on n vertices is

A

n

B

n+1

C

n-1

D

none of the above

Discussion

MCQ

3.

A

A

Network

B

Weighted graph

C

Both A and B

D

None of the above

Discussion

MCQ

4.

What is the maximum number of edges in a bipartite graph having 10 vertices?

A

24

B

21

C

25

D

16

Discussion

MCQ

5.

Time complexity to find if there is an edge between 2 particular vertices is _________

A

O(V)

B

O(E)

C

O(1)

D

O(V+E)

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