Question Discussion & Solution

MCQ

Floyd Warshall Algorithm used to solve the shortest path problem has a time complexity of __________

O(V*V)

O(V*V*V)

O(E*V)

O(E*E)

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

Regarding implementation of Breadth First Search using queues, what is the maximum distance between two nodes present in the queue? (considering each edge length 1)

Can be anything

At most 1

Insufficient Information

Discussion

MCQ

Minimum number of spanning tree in a connected graph is

n(n - 1)

Discussion

MCQ

Time Complexity of Breadth First Search is? (V – number of vertices, E – number of edges)

O(V + E)

O(V)

O(E)

None of the mentioned

Discussion

MCQ

A connected graph T without any cycles is called

a tree graph

free tree

a tree

All of above

Discussion

MCQ

How many nodes are required to create a Binary Decision Tree having 4 variables?

2^4

2^(4-1)

2^5

2^(5-1)

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