Q. The edit distance satisfies the axioms of a metric when the costs are non-negative.

View solution

Q. Which of the following is an application of the edit distance problem?

View solution

Q. In which of the following cases will the edit distance between two strings be zero?

View solution

Q. Suppose each edit (insert, delete, replace) has a cost of one. Then, the maximum edit distance cost between the two strings is equal to the length of the larger string.

View solution

Q. Consider the strings “monday” and “tuesday”. What is the edit distance between the two strings?

View solution

Q. Consider the two strings “”(empty string) and “abcd”. What is the edit distance between the two strings?

View solution

Q. Wagner–Fischer is a ____________ algorithm.

View solution

Q. Wagner–Fischer algorithm is used to find ____________

View solution

Q. What is the edit distance between the strings “abcd” and “acbd” when the allowed operations are insertion, deletion and substitution?

View solution

Q. For which of the following pairs of strings is the edit distance maximum?

View solution

Q. What is the time complexity of the Wagner–Fischer algorithm where “m” and “n” are the lengths of the two strings?

View solution

Q. Which of the following is NOT a Catalan number?

View solution

Q. Which of the following numbers is the 6th Catalan number?

View solution

Q. Which of the following is/are applications of Catalan numbers?

View solution

Q. Which of the following methods can be used to find the nth Catalan number?

View solution

Q. Which of the following implementations of Catalan numbers has the smallest time complexity?

View solution

Q. Which of the following implementations of Catalan numbers has the largest space complexity(Don’t consider the stack space)?

View solution

Q. Which of the following methods can be used to solve the assembly line scheduling problem?

View solution

Q. What is the time complexity of the brute force algorithm used to solve the assembly line scheduling problem?

View solution

Q. In the dynamic programming implementation of the assembly line scheduling problem, how many lookup tables are required?

View solution