Lesson plan
Substring
In formal language theory and computer science, a substring is a contiguous sequence of characters within a string. For instance, "the best of" is a substring of "It was the best of times". In contrast, "Itwastimes" is a subsequence of "It was the best of times", but not a substring. Prefixes and suffixes are special cases of substrings. A prefix of a string S is a substring of S that occurs at the beginning of S ; likewise, a suffix of a string S is a substring that occurs at the end of S . The substrings of the string " " would be: " ", " ", " ", " ", " ", " ", " ", " ", " ", " ", " ", " ", " " " ", "" (note the empty string at the end).
Article summary
In formal language theory and computer science, a substring is a contiguous sequence of characters within a string. For instance, "the best of" is a substring of "It was the best of times". In contrast, "Itwastimes" is a subsequence of "It was the best of times", but not a substring. Prefixes and suffixes are special cases of substrings. A prefix of a string S is a substring of S that occurs at the beginning of S ; likewise, a suffix of a string S is a substring that occurs at the end of S . The substrings of the string " " would be: " ", " ", " ", " ", " ", " ", " ", " ", " ", " ", " ", " ", " " " ", "" (note the empty string at the end).
Key claims
No claims recorded.
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
No sources recorded.
Key claims and bibliography are generated from the same tracked claims and sources as the article page.