Elance Exams Answers PDF file

-- PDF FILE --
Download PDF file of elance Zoho Creator Exam Answers

What algorithm uses polynomial time to find the largest common subsequence of two sequences?

Brute force search.
Divide and conquer.
Creating a trie and searching both sequences.
Dynamic programming with memoization.
Greedily search for the optimal subsequence starting from the beginning of each sequence.
  • Follows us our servcies
  • Facebook icon
  • Linkedin icon
  • twitter icon
  • rss icon
  • social icon