Question Discussion & Solution

MCQ

Which of the following algorithms solves the all-pair shortest path problem?

Floyd's algorithm

Prim's algorithm

Dijkstra's algorithm

Warshall's algorithm

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

kruskal algorithm is based on ___________method

Divide and conquer method

Greedy method

Dynamic programming

Branch and bound

Discussion

MCQ

For some sparse graph an adjacency list is more space efficient against an adjacency matrix.

May be

Can't say

Discussion

MCQ

In the case of Fibnocci heap the running time of Prim

O(E log V)

O(V log E)

O( log V)

O(E log E)

Discussion

MCQ

The Depth First Search traversal of a graph will result into?

Linked List

Tree

Graph with back edges

None of the mentioned

Discussion

MCQ

In which of the following case does a Binary Decision Diagram is used for?

Representation of Boolean Functions

String Matching

Searching

Sorting of number

Discussion

Banking

Engineering

General

Medical

Question Discussion & Solution

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Data Structure Topics

Data Structure Basics

Abstract data types

Arrays

Lists

Stacks

Queues

Trees

Binary Trees

B Trees

Heaps

Hash based structures

Graphs

Mixed

Banking

Engineering

General

Medical

Question Discussion & Solution

report Report Error

forum Community Discussion

auto_awesome Similar Questions

report Report Error

report Report Error

report Report Error

report Report Error

report Report Error

category More Data Structure Topics

Data Structure Basics

Abstract data types

Arrays

Lists

Stacks

Queues

Trees

Binary Trees

B Trees

Heaps

Hash based structures

Graphs

Mixed

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Data Structure Topics