Multiple choice question for engineering Set 1 1. Wagner–Fischer is a ____________ algorithm. a) Brute force b) Greedy c) Dynamic programming d) Recursive 2. Wagner–Fischer algorithm is used to find ____________ a) Longest common subsequence b) Longest increasing subsequence c) Edit distance between two strings d) All of the mentioned 3. What is the edit…

This content is for Premium 1 Month, Complete Homework, and Premium 1 Day Pass members only.
Log In Visit Now