Practice Longest Common Subword Problem (3.1) - Common Subwords and Subsequences

Practise this section

10 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
4 questions · about 3 min · pass mark 70%. Hints available.
Sign up to start the quiz

6 sample questions

Question 1.
Define what a common subword is in your own words.
Show hintHide hint
Think about parts of words you see in other words.
Question 2.
What does the brute force method do?
Show hintHide hint
Consider how we could manually find matches.
3Question 3.
What is a common subword?
Show hintHide hint
Think of segments of strings.
4Question 4.
True or False: The brute force method has a time complexity of O(m * n).
Show hintHide hint
Consider the multiple comparisons involved.
Question 5.
Given the words 'intention' and 'attention', find their longest common subword using dynamic programming.
Show hintHide hint
Display a matrix to find each character match.
Question 6.
Write an efficient algorithm in pseudo-code that uses dynamic programming to find the length of the longest common subword between two given strings.
Show hintHide hint
Ensure to handle base cases properly when initializing the table.

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