Palindromes Flashcards
1
Q
What is the definition of a palindrome?
A
2
Q
What is the definition of a subsequence?
A
3
Q
What is the definition of the longest palindromic subsequence problem?
A
4
Q
If the input size of palendromic problem is size n, what is the number of subsequences?
A
2n
If we were to brute force, that would mean Omega(n2n)
5
Q
What is the general recursive algorithm for palindromic problem.
A
6
Q
What is the running time of the general recursive algorithm?
A
So recursive takes Omega(2n)
7
Q
using dynamic programming in the longest palindromic program, how is the table set up.
Where is the answer found?
Where is the subproblem answer found?
A
8
Q
Using bottom-up approach for longest palindrome, how is the table filled out?
A
