Practice Inductive Structure Of Edit Distance (5.6) - Edit Distance - Design & Analysis of Algorithms

Practise this section

8 questions

Flashcard drill
2 cards from this section. Quick, good the night before a test.
Exercise
6 questions · about 4 min · pass mark 70%. Hints available.
Sign up to start the exercise
Quiz
2 questions · about 1 min · pass mark 70%. Hints available.
Sign up to start the quiz

6 sample questions

Question 1.
Calculate the Edit Distance for 'bat' and 'cat'.
Show hintHide hint
Consider only character replacements.
Question 2.
What operation is used to convert 'good' to 'goood'?
Show hintHide hint
Think about how we add characters.
3Question 3.
What does Edit Distance measure?
- Number of characters in a string
- How alike two strings are
- Time complexity of an algorithm
Show hintHide hint
Think of the purpose of measuring similarity.
4Question 4.
True or False: Edit Distance can only be calculated for words with the same length.
- True
- False
Show hintHide hint
Consider the flexibility of character operations.
Question 5.
How would you convert 'algorithm' to 'alliteration'? Calculate the required Edit Distance.
Show hintHide hint
Start by identifying shared and differing characters between the two words.
Question 6.
Given two strings of different lengths, 'happy' and 'unhappiness', calculate the Edit Distance.
Show hintHide hint
Consider how you can minimize the longer string to match the shorter one.

4 more questions in this section. Enroll free to practise them all.