Question 1

is any algorithm that follows the
problem-solving heuristic of making the locally optimal
choice at each stage with the intent of finding a global
optimum

Accepted Answer

greedy algorithm

Question 2

In general how many components greedy algorithm have?

Accepted Answer

5
1. A candidate set, from which a solution is created
2. A selection function, which chooses the best
candidate to be added to the solution
3. A feasibility function, that is used to determine if a
candidate can be used to contribute to a solution

Question 3

is a
greedy algorithm that finds a minimum spanning tree for a weighted
undirected graph

Accepted Answer

Prim's (also known as Jarník's) algorithm

Question 4

who formulated the shortest paths between nodes in a graph. Group of answer choices True False	True

Accepted Answer

It was Edsger W. Dijkstra

Question 5

It was the year 1959 that Edsger Dijkstra invented the Dijkstra algorithm Group of answer choices True False

Accepted Answer

True

Question 6

It was Edsger Dijkstra who invented the semaphore mechanism that allows concurrent programs to share a single resource Group of answer choices True False

Accepted Answer

True

Question 7

The Kruskal algorithm was first described in the year 1956 Group of answer choices True False

Accepted Answer

True

Question 8

It was in 1959 that Edsger Dijkstra invented the Dijkstra algorithm Group of answer choices True False

Accepted Answer

True

Question 9

Prims algorithm finds a minimum spanning tree for a weighted undirected graph Group of answer choices True False

Accepted Answer

True

Question 10

It was Edsger S. Dikstra who formulated the shortest paths between nodes in a graph. Group of answer choices True False

Accepted Answer

True

Question 11

1930 was the year that Vojtěch Jarník developed the Jarník Algorithm Group of answer choices True False

Accepted Answer

True

Question 12

The Object function of the greedy algorithm is used to assigns a value to a solution, or a partial solution Group of answer choices True False

Accepted Answer

True

Question 13

The feasibility function of the greedy algorithm is used to determine if a candidate can be used to contribute to a solution Group of answer choices True False

Accepted Answer

True

Question 14

It was 1957 that Robert Prims republished the work of Jarnik

Accepted Answer

True

Question 15

The Solution function of the greedy algorithm is used to indicate when we have discovered a complete solution Group of answer choices True False

Accepted Answer

True

Question 16

Greedy Algorithm is optimally solve combinatorial problems having the properties of matroids, and give constant-factor approximations to optimization problems with submodular structure. Group of answer choices True False

Accepted Answer

True

Question 17

It was Vojtěch Jarník who rediscover the works of Kruskal in 1956 Group of answer choices True False

Accepted Answer

false

Question 18

Prim's algorithm resembles Dijkstra's algorithm. Group of answer choices True False

Accepted Answer

True

Question 19

It was Edsger Dijkstra kick started the structured programming movement Group of answer choices True False

Accepted Answer

True

Question 20

Kruskal algorithm uses minimum-spanning-tree algorithm which finds an edge of the least possible weight that connects any two trees in the forest. Group of answer choices True False

Accepted Answer

True

Question	Answer
is any algorithm that follows the problem-solving heuristic of making the locally optimal choice at each stage with the intent of finding a global optimum	greedy algorithm
In general how many components greedy algorithm have?	5 1. A candidate set, from which a solution is created 2. A selection function, which chooses the best candidate to be added to the solution 3. A feasibility function, that is used to determine if a candidate can be used to contribute to a solution
is a greedy algorithm that finds a minimum spanning tree for a weighted undirected graph	Prim's (also known as Jarník's) algorithm
who formulated the shortest paths between nodes in a graph. Group of answer choices True False True	It was Edsger W. Dijkstra
It was the year 1959 that Edsger Dijkstra invented the Dijkstra algorithm Group of answer choices True False	True
It was Edsger Dijkstra who invented the semaphore mechanism that allows concurrent programs to share a single resource Group of answer choices True False	True
The Kruskal algorithm was first described in the year 1956 Group of answer choices True False	True
It was in 1959 that Edsger Dijkstra invented the Dijkstra algorithm Group of answer choices True False	True
Prims algorithm finds a minimum spanning tree for a weighted undirected graph Group of answer choices True False	True
It was Edsger S. Dikstra who formulated the shortest paths between nodes in a graph. Group of answer choices True False	True
1930 was the year that Vojtěch Jarník developed the Jarník Algorithm Group of answer choices True False	True
The Object function of the greedy algorithm is used to assigns a value to a solution, or a partial solution Group of answer choices True False	True
The feasibility function of the greedy algorithm is used to determine if a candidate can be used to contribute to a solution Group of answer choices True False	True
It was 1957 that Robert Prims republished the work of Jarnik	True
The Solution function of the greedy algorithm is used to indicate when we have discovered a complete solution Group of answer choices True False	True
Greedy Algorithm is optimally solve combinatorial problems having the properties of matroids, and give constant-factor approximations to optimization problems with submodular structure. Group of answer choices True False	True
It was Vojtěch Jarník who rediscover the works of Kruskal in 1956 Group of answer choices True False	false
Prim's algorithm resembles Dijkstra's algorithm. Group of answer choices True False	True
It was Edsger Dijkstra kick started the structured programming movement Group of answer choices True False	True
Kruskal algorithm uses minimum-spanning-tree algorithm which finds an edge of the least possible weight that connects any two trees in the forest. Group of answer choices True False	True

"Know" box contains:
Time elapsed:
Retries:

ALGO- M7