Substring: Complete the following code to check if str2 with length strlen2 is a substrir str1 with length strlen1. Examples: str1=flower, str2=low (low is a substring of flower) str1=flower, str2=law (law is not a substring of flower) Algorithm: 1. Find the first character of str2 in str1. 2. If not found, str2 is not a substring of str1, else compare the remaining characters. 3. If all remaining characters matched, str2 is a substring of str1. Else, str2 is not a substring of strl. cld mov rcx, qword [strlen1]
Substring: Complete the following code to check if str2 with length strlen2 is a substrir str1 with length strlen1. Examples: str1=flower, str2=low (low is a substring of flower) str1=flower, str2=law (law is not a substring of flower) Algorithm: 1. Find the first character of str2 in str1. 2. If not found, str2 is not a substring of str1, else compare the remaining characters. 3. If all remaining characters matched, str2 is a substring of str1. Else, str2 is not a substring of strl. cld mov rcx, qword [strlen1]
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Concept explainers
Max Function
Statistical function is of many categories. One of them is a MAX function. The MAX function returns the largest value from the list of arguments passed to it. MAX function always ignores the empty cells when performing the calculation.
Power Function
A power function is a type of single-term function. Its definition states that it is a variable containing a base value raised to a constant value acting as an exponent. This variable may also have a coefficient. For instance, the area of a circle can be given as:
Question
100%
![9-13. Substring: Complete the following code to check if str2 with length strlen2 is a substring of
str1 with length strlen1.
Examples:
str1=flower, str2=low (low is a substring of flower)
str1=flower, str2=law (law is not a substring of flower)
Algorithm:
1. Find the first character of str2 in str1.
2. If not found, str2 is not a substring of str1, else compare the remaining characters.
3. If all remaining characters matched, str2 is a substring of str1. Else, str2 is not a
substring of strl.
cld
mov rcx, qword [strlenl]
9.
10.
11.
cmp rcx, 0
je not Substring
mov rcx, qword [strlen2]
dec rcx
12.
inc rsi
13.
cmp rcx, 0
je substring
jmp notSubstring](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fe9772219-ddf3-4048-9997-05a8d39b1f65%2F4aca7185-ac3f-451d-98ff-c4f6d8fb462b%2F2b5yvc_processed.png&w=3840&q=75)
Transcribed Image Text:9-13. Substring: Complete the following code to check if str2 with length strlen2 is a substring of
str1 with length strlen1.
Examples:
str1=flower, str2=low (low is a substring of flower)
str1=flower, str2=law (law is not a substring of flower)
Algorithm:
1. Find the first character of str2 in str1.
2. If not found, str2 is not a substring of str1, else compare the remaining characters.
3. If all remaining characters matched, str2 is a substring of str1. Else, str2 is not a
substring of strl.
cld
mov rcx, qword [strlenl]
9.
10.
11.
cmp rcx, 0
je not Substring
mov rcx, qword [strlen2]
dec rcx
12.
inc rsi
13.
cmp rcx, 0
je substring
jmp notSubstring
Expert Solution

This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps

Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you

Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education

Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON

Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON

Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education

Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON

Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON

C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON

Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning

Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education