Practice Dynamic Programming Approach (3.4) - Common Subwords and Subsequences

Practice: Dynamic Programming Approach

Lesson 3.4Common Subwords and Subsequences

Practise this section

10 questions

Flashcard drill
4 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.
What is a subword?
Show hintHide hint
Think about how you can take parts of a word
Question 2.
What is the time complexity of the brute-force algorithm for finding longest common subwords?
Show hintHide hint
Consider how many comparisons you are making.
3Question 3.
What is the focus of the longest common subword problem?
- Finding the subword itself
- Determining the length of the longest subword
- Identifying mismatched characters
Show hintHide hint
Remember that we start by calculating length before deriving the subword.
4Question 4.
True or False: The brute-force algorithm is the most efficient method for finding the longest common subword.
- True
- False
Show hintHide hint
Consider the time complexity of brute-force versus dynamic programming.
Question 5.
Given the strings 'abcdef' and 'zabcyfd', what is the length of the longest common subword?
Show hintHide hint
Consider breaking down each string and checking for the longest matching segment.
Question 6.
Implement a table to compute the longest common subword length between 'hello' and 'world'. Analyze and explain your results.
Show hintHide hint
Map the characters in a grid to visualize matches.

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