Menu

Question Discussion & Solution

MCQ

Q.

Dijkstra

A

Has greedy approach to find all shortest paths

B

Has both greedy and Dynamic approach to find all shortest paths

C

Has greedy approach to compute single source shortest paths to all other vertices

D

Has both greedy and dynamic approach to compute single source shortest paths to all other vertices.

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 general criteria of algorithm; zero or more quantities are externally supplied is ______

A

Output

B

Finiteness

C

Effectiveness

D

Input

Discussion

MCQ

2.

Which is not in general criteria of algorithm

A

Input

B

Output

C

Time complexity

D

Effectiveness

Discussion

MCQ

3.

A ____ is a linear list in which insertions and deletions are made to from either end of the structure.

A

circular queue

B

random of queue

C

priority

D

dequeue

Discussion

MCQ

4.

What algorithm technique is used in the implementation of Kruskal

A

Greedy Technique

B

Divide-and-ConquerTechnique

C

Dynamic Programming Technique

D

The algorithm combines more than one of the above techniques

Discussion

MCQ

5.

In pseudo-code conventions input express as __________

A

input

B

Read

C

Write

D

Return

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