CTECH-03.02.2024-AN

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

• 0
• 4
• 5
• 6

You have n dice each having f faces. What is the number of permutations that can be obtained when you roll the n dice together?

• n*n*n…f times
• f*f*f…n times
• n*n*n…n times
• f*f*f…f times

There are n dice with f faces. The faces are numbered from 1 to f. What is the minimum possible sum that can be obtained when the n dice are rolled together?

• 1
• f
• n
• n*f

Which of the following methods can be used to solve the edit distance problem?

• Greedy Algorithm
• Recursion
• Dynamic programming
• Both dynamic programming and recursion

You have 2 dice each of them having 6 faces numbered from 1 to 6. What is the number of ways in which a sum of 11 can be achieved?

• 0
• 1
• 2
• 3

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

• Approximate string matching
• Spelling correction
• Similarity of DNA
• Approximate string matching, Spelling Correction and Similarity of DNA

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

• 3
• 6
• 4
• 5

In the given strings length of longest common sub string is X = “abcdxyz”, y = “xyzabcd”

• 2
• 3
• 4
• 5

The number of common sub strings are s1=”qdef” s2=”defq”

• 4
• 5
• 6
• 7

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

• When one string is a substring of another
• When the lengths of the two strings are equal
• When the two strings are equal
• The edit distance can never be zero