Industry-relevant training in Business, Technology, and Design to help professionals and graduates upskill for real-world careers.
Fun, engaging games to boost memory, math fluency, typing speed, and English skills—perfect for learners of all ages.
Enroll to start learning
You’ve not yet enrolled in this course. Please enroll for free to listen to audio lessons, classroom podcasts and take practice test.
Test your understanding with targeted questions related to the topic.
Question 1
Easy
What is a bad string?
💡 Hint: Think about what sequences you would want to exclude.
Question 2
Easy
How many valid strings of length 2 exist?
💡 Hint: List all the possible strings of length 2.
Practice 4 more questions and get performance evaluation
Engage in quick quizzes to reinforce what you've learned and check your comprehension.
Question 1
What is the characteristic of a bad string?
💡 Hint: Remember the definition from class.
Question 2
True or False: All strings of length 3 contain a valid configuration based on our recurrence relation.
💡 Hint: Think about examples of string patterns.
Solve and get performance evaluation
Push your limits with challenges.
Question 1
Calculate and prove \( S(6) \) using previous calculated values.
💡 Hint: Refer back to your established pattern and apply modified counts.
Question 2
Find a pattern by plotting values of \( S(n) \) against \( n \), and deduce future terms.
💡 Hint: What do the numbers suggest?
Challenge and get performance evaluation