Create Quiz

Quiz: Algorithms Mock tests on Graph Minimum Spanning Tree.

Quiz: Algorithms Mock tests on Graph Minimum Spanning Tree.

The quiz contains information about Graph Minimum Spanning Tree.

You can mute/unmute sounds from here

You May Get Result Of Quiz: Algorithms Mock tests on Graph Minimum Spanning Tree.

POST YOUR ANSWER (READ ANSWERS)

Quiz Questions And Answers

A minimum spanning tree is a subset of the edges of a connected, edge-weighted undirected graph that connects all the ................ together.

nodes
vertices
objects

A minimum spanning tree would be one with the lowest total cost, representing the .................. path for laying the cable.

most expensive
least expensive
unknown

Who developed the first algorithm for finding a minimum spanning tree?

Otakar Borůvka
Leman Borůvka
Steve Newman

When the first algorithm was developed for finding a minimum spanning tree?

in 1970
in 1960
in 1926

The first algorithm for finding a minimum spanning trees purpose was an efficient electrical coverage of-

Lutia
Dimana
Moravia

The minimum spanning trees algorithm proceeds in a sequence of-

stages
tables
rulse

In computer science, Prim's algorithm finds a minimum spanning tree for a ..................... graph.

over lapped
weighted undirected
limited

When Prim's algorithm was invented?

in 1970
in 1926
in 1960

Who invented Prim's algorithm?

Ervin Arník
Vojtěch Jarník
William Jarník

Kruskal's algorithm is a minimum-spanning-tree algorithm which takes ..................... time.

O (n)t
O(t log 2)
O(m log n)

The ................. is an algorithm in graph theory used to obtain a minimum spanning tree from a given connected, edge-weighted graph.

repeat node algorithm
rewind algorithm
reverse-delete algorithm

The most common Graph minimum-spanning-tree algorithms are-

slow algorithm
greedy algorithm
long-pause algorithm

Graph Minimum spanning trees have direct applications in the design of-

transportation networks
computer networks
Both of them

For directed graphs, the minimum spanning tree problem is called ................. problem.

the Limitation
the Arborescence
the Irrelavant

A related problem is the k-minimum spanning tree (k-MST), is the tree that spans some subset of .................. in the graph with minimum weight.

M onjects
L nodes
k vertices
ANSWERS

Currently, we have no comments. Be first to comment on this quiz.

Quiz: Algorithms Mock tests on Graph Minimum Spanning Tree. : Test Trivia

Ultimate impossible accurate personality honest Quiz Game

How do you rate this quiz?

Average rating 4.8 / 5. Vote: 5
Embed This Quiz
Copy the code below to embed this quiz