Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

Blind 50 Study (Python) > Dynamic Programming > Flashcards

Dynamic Programming Flashcards

1
Q

Knapsack Problem

* greedy algorithm

optimization problem, maximize profits

A

start w/ the smallest weight, do we have to use the entire amount?, can objects be divided?, can we use the fraction of an object?, objects, profits, and weights

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

Floyd’s Algorithm

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

Huffman Code

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

Prim’s Algorithm

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

Krunskal’s Algorithm

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

Multi Stage Graph

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

(LCS) Least Common Subsequence

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

Blind 50 Study (Python) (6 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2024 Bold Learning Solutions. Terms and Conditions