Lecture 10 Flashcards

1
Q

What is the key idea of a greedy algorithm? What is a disadvantage?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What are features that many greedy algorithms have?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

How does a greedy algorithm work regarding substructure?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What is the greedy-choice property?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

How to show correctness of a greedy choice problem?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

What are the steps to prove the correctness of a greedy algorithm?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

How can you in general prove the inductive step of a greedy algorithm?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

What kind of algorithm is a gradient descent?

A

A greedy algorithm

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

What is the greedy descent algorithm?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

On what does the correctness of the gradient descent algorithm depend?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly