Multiple choice question for engineering Set 1 1. Wagner–Fischer is a ____________ algorithm. a) Brute force b) Greedy c) Dynamic programming d) Recursive AnswerAnswer: c [Reason:] Wagner–Fischer belongs to the dynamic programming type of algorithms. 2. Wagner–Fischer algorithm is used to find ____________ a) Longest common subsequence b) Longest increasing subsequence c) Edit distance between…
This content is for paid premium members only.
You can view complete answer after activation your membership.
Need only one answers. Simply buy single day pass and email. We will send answers for this question.
Login Buy membership