String matching basics in Data Structures Theory - Mini Project: Build & Apply

String Matching Basics

📖 Scenario: You are working on a simple text search tool that helps users find if a small word or phrase appears inside a larger text. This is useful in many real-life situations like searching for a name in a list, finding a keyword in a document, or checking if a password contains a certain pattern.

🎯 Goal: Build a step-by-step understanding of how to check if one string appears inside another string using basic string matching techniques.

📋 What You'll Learn

Create a main text string variable with a specific sentence.

Create a search word variable to look for inside the main text.

Use a method to check if the search word is found inside the main text.

Add a final step to confirm the presence or absence of the search word.

💡 Why This Matters

🌍 Real World

Searching for keywords in documents, filtering messages, or validating user input often requires checking if a smaller string exists inside a larger string.

💼 Career

Understanding string matching is essential for roles in software development, data analysis, and any job involving text processing or search functionality.

1

Create the main text string

Create a variable called main_text and set it to the string "The quick brown fox jumps over the lazy dog".

Data Structures Theory

# Create the main text string
# Your code here

Hint

Use quotes to create a string and assign it to main_text.

2

Create the search word string

Create a variable called search_word and set it to the string "fox".

Data Structures Theory

main_text = "The quick brown fox jumps over the lazy dog"
# Create the search word string
# Your code here

Hint

Assign the word you want to find to search_word.

3

Check if the search word is in the main text

Create a variable called found and set it to the result of checking if search_word is inside main_text using the in keyword.

Data Structures Theory

main_text = "The quick brown fox jumps over the lazy dog"
search_word = "fox"
# Check if search_word is in main_text
# Your code here

Hint

Use the in keyword to check if one string is inside another.

4

Confirm the presence of the search word

Create a variable called result_message and set it to "Found" if found is True, otherwise set it to "Not Found" using a simple if-else statement.

Data Structures Theory

main_text = "The quick brown fox jumps over the lazy dog"
search_word = "fox"
found = search_word in main_text
# Set result_message based on found
# Your code here

Hint

Use an if-else block to assign the correct message based on the boolean found.

Practice

1. What is the main goal of string matching in computer science?

easy

A. To sort a list of strings alphabetically

B. To find if a smaller text appears inside a bigger text

C. To count the number of characters in a string

D. To convert a string to uppercase

Solution

1. Step 1: Understand the definition of string matching

   String matching is about checking if a smaller text (pattern) exists inside a larger text (text).

2. Step 2: Compare options with the definition

   Only To find if a smaller text appears inside a bigger text describes this goal correctly; others describe different string operations.

3. Final Answer:

   To find if a smaller text appears inside a bigger text -> Option B

4. Quick Check:

   String matching = find smaller text inside bigger text [OK]

Hint: Remember: string matching means searching for a pattern inside text [OK]

Common Mistakes:

• Confusing string matching with sorting strings
• Thinking string matching counts characters
• Mixing string matching with case conversion

2. Which of the following is the correct way to check if the string pattern exists in text using Python?

easy

A. if pattern in text:

B. if text contains pattern:

C. if text has pattern:

D. if pattern inside text:

Solution

1. Step 1: Recall Python syntax for substring check

   In Python, the correct syntax to check if one string is inside another is using the in keyword.

2. Step 2: Evaluate each option

   Only if pattern in text: uses the correct Python syntax. Options A, B, and D are not valid Python statements.

3. Final Answer:

   if pattern in text: -> Option A

4. Quick Check:

   Python substring check uses 'in' keyword [OK]

Hint: Use 'in' keyword to check substring in Python [OK]

Common Mistakes:

• Using incorrect keywords like 'contains' or 'has'
• Writing invalid syntax like 'inside'
• Confusing method calls with keywords

3. What will be the output of the following code?

text = "hello world"
pattern = "world"
print(pattern in text)

medium

A. False

B. world

C. True

D. Error

Solution

1. Step 1: Understand the 'in' operator in Python

   The expression pattern in text checks if the string 'world' is inside 'hello world'.

2. Step 2: Check if 'world' is a substring of 'hello world'

   Since 'world' appears at the end of 'hello world', the expression returns True.

3. Final Answer:

   True -> Option C

4. Quick Check:

   'world' in 'hello world' = True [OK]

Hint: Check if substring is exactly inside the main string [OK]

Common Mistakes:

• Assuming output is the substring itself
• Confusing True/False output
• Expecting an error due to syntax

4. Identify the error in the following code snippet for string matching:

text = "data structures"
pattern = "structure"
if pattern in text:
print("Found")

medium

A. Indentation error in the print statement

B. Wrong variable names used

C. Incorrect string matching operator

D. Missing quotation marks around pattern

Solution

1. Step 1: Check Python syntax for if statement

   Python requires the code inside an if block to be indented properly.

2. Step 2: Inspect the print statement indentation

   The print statement is not indented, causing an indentation error.

3. Final Answer:

   Indentation error in the print statement -> Option A

4. Quick Check:

   Python blocks need indentation [OK]

Hint: Indent code inside if statements properly [OK]

Common Mistakes:

• Ignoring indentation rules in Python
• Assuming 'in' operator is wrong
• Changing variable names unnecessarily

5. You want to find all starting positions where the pattern "ana" appears in the text "banana". Which of the following lists shows the correct starting indices (0-based)?

hard

A. [1, 2, 3]

B. [0, 2, 4]

C. [2, 4]

D. [1, 3]

Solution

1. Step 1: Identify occurrences of 'ana' in 'banana'

   Check each substring of length 3 in 'banana': 'ban'(0), 'ana'(1), 'nan'(2), 'ana'(3), 'na'(4 incomplete).

2. Step 2: List starting indices where substring matches 'ana'

   'ana' appears starting at index 1 and index 3.

3. Final Answer:

   [1, 3] -> Option D

4. Quick Check:

   Positions of 'ana' in 'banana' = [1, 3] [OK]

Hint: Slide window over text to find all pattern starts [OK]

Common Mistakes:

• Counting overlapping matches incorrectly
• Using 1-based instead of 0-based indices
• Missing one of the occurrences