Masters > Greedy Methods > Flashcards

Greedy Methods Flashcards

(10 cards)

Study These Flashcards
1
Q

what is control abstraction

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

explain fractional knapsack problem

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

Explain task scheduling problem

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

Explain optimal merge patterns

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

Explain minimum spanning tree - kruskal’s and prims algo

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

Explain shortest path algo - dijkstra’s algorithm

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

L1. assign cookies, greedy algo playlist

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

L2. lemonade change, greedy algo playlist

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

L3. shortest job first, greedy algo playlist

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q
A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
Masters
flashcards
Decks in class (20)
# Cards
Brainscape helps you reach your goals faster, through stronger study habits.
© 2026 Bold Learning Solutions. Terms and Conditions