Intro - Dynamic Programming

Question 1

What is tabulation?

What type of approach is it?

Answer 1

Question 2

What is the code for fibonacci using tabulation?

Answer 2

Question 3

What is the run time of fibTabulation?

Answer 3

Question 4

What is memoization? what type of approach is it?

Answer 4

Question 5

What is the example fibonacci code for memoization approach?

Answer 5

Question 6

what is the run time for the top down fib approach

Answer 6

Question 7

Compare and contrast Tabulation vs Memoization.

Why use one over the other?

Answer 7

Question 8

How do we know when to use:

Dynamic Programming

Greedy

Divide-and-Conquer

What must hold to use any of the above approaches?

Answer 8

Question 9

What is a palindrome and what is the definition?

Answer 9

Question 10

What is a subsequence?

Answer 10

Question 11

What is the input of the longest palindromic subsequence problem?

Answer 11

Question 12

What is the definition & required output of the longest palindromic subsequence problem?

Answer 12

Question 13

What are the feasible solutions and correct output if there are no repeating characters in a palindrome sequence?

Answer 13

Question 14

What is a solution in the following sequence?

Answer 14

Question 15

What is the cost to brute force the longest palindromic subsequence problem?

Answer 15

Question 16

What is the general recursive algorithm for the Longest palindromic subsequence

Answer 16

Question 17

What is the running time of our first palendrome sequnce.

Answer 17

Which is Omega (2ⁿ)

Question 18

Using the iteration method, what is the closed form of the following?

Answer 18

Question 19

For the bottom-up version of the longest palendromic sequence, how is the table setup?

Answer 19

Question 20

For the bottom up approach for the bottom-up version of longest palen, how do you setup the base cases?

Answer 20

Question 21

Assume we have a table of n = 8

What is the order in which the table is filled out with the bottom-up approach for longest palen

Answer 21

Question 22

Analyse the run time of this algorithm

Answer 22

Question 23

What is the order in which this table is filled out?

Answer 23

Question 24

What is the run time of this algo

Answer 24

Question 25

What is the general optimal substructure format for longest palendrom (NOT the proof)

Answer 25

Question 26

What is the optimal substructure proof for longest palendrome?

Answer 26

Question 27

How does the overlapping subproblems work for longest palendrome/dynamic programming?

Answer 27