Create Quiz

# 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

nodes
vertices
objects

most expensive
least expensive
unknown

Otakar Borůvka
Leman Borůvka
Steve Newman

in 1970
in 1960
in 1926

Lutia
Dimana
Moravia

stages
tables
rulse

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

over lapped
weighted undirected
limited

in 1970
in 1926
in 1960

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

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

the Limitation
the Arborescence
the Irrelavant

M onjects
L nodes
k vertices