Menu

Question Discussion & Solution

MCQ

Q.

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)

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.

. 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

MCQ

2.

The number of edges in a simple, n-vertex, complete graph is

A

n*(n-2)

B

n*(n-1)

C

n*(n-1)/2

D

n*(n-1)*(n-2)

Discussion

MCQ

3.

If A[x+3][y+5] represents an adjacency matrix, which of these could be the value of x and y.

A

x=5, y=3

B

x=3, y=5

C

x=3, y=3

D

x=5, y=5

Discussion

MCQ

4.

All paths and cyclic graphs are bipartite graphs.

A

1

C

May be

D

Can't say

Discussion

MCQ

5.

The maximum degree of any vertex in a simple graph with n vertices is

A

n

B

n+1

C

2n

D

n

Discussion

More Design and Analysis of Algorithms Topics

Design and Analysis of Algorithms Basics

76 MCQs

Asymptotic Notation

38 MCQs

Divide and Conquer Strategy

18 MCQs

Sorting

14 MCQs

Linear Time Sorting

8 MCQs

Dynamic Programming

18 MCQs

Greedy Algorithms

10 MCQs

Backtracking Algorithms

13 MCQs

Graphs

18 MCQs

Complexity Theory

11 MCQs