can you please show me with the screen shot of the output, Thank you. Write a procedure named Str_find that searches for the first matching occurrence of a source string inside a target string and returns the matching position.The input parameters should be a pointer to the source string and a pointer to the target string. If a match is found, the procedure sets the Zero flag and EAXpoints to the matching position in the target string. Otherwise, the Zero flag is clear and EAX is undefined. The following code, for example, searches for"5ABC9" and returns with EAX pointing to the "5" in the target string:INCLUDE Irvine32.incStr_find PROTO, pTarget:PTR BYTE, pSource:PTR BYTE.datatarget BYTE "01ABAAAAAABABCC45ABC9012",0source BYTE "5ABC9",0str1 BYTE "Source string found at position ",0str2 BYTE" in Target string (counting from zero).",0Ah,0Ah,0Dh,0str3 BYTE "Unable to find Source string in Target string.",0Ah,0Ah,0Dh,0stop DWORD?lenTarget DWORD?lenSource DWORD?position DWORD?.codemain PROCINVOKE Str find,ADDR target, ADDR sourcemov position, eaxjz wasfound ; ZF=1 indicates string foundmov edx,OFFSET str3; string not foundcall WriteStringjmp quitwasfound:; display messagemov edx,OFFSET str1call WriteStringmov eax,position; write position valuecall WriteDecmov edx,OFFSET str2call WriteStringquit:exitmain ENDPStr find PROC. [....][your code]Į!ĮStr_find ENDPEND main

Here our task is to write a assembly language procedure for searching the first matching occurrence…

The input parameters should be a pointer to the source string and a pointer to the target string. If a match is found, the procedure sets the Zero flag and EAX points to the matching position in the target string. Otherwise, the Zero flag is clear and EAX is undefined. The following code, for example, searches for "SABC9" and returns with EAX pointing to the "5" in the target string: NCLUDE Irvine32.inc Str_find PROTO, pTarget:PTR BYTE, pSource:PTR BYTE data arget BYTE "01ABAAAAAABABCC45ABC9012",0 Source BYTE "SABC9",0 str1 BYTE "Source string found at position ",0 str2 BYTE" in Target string (counting from zero).",0Ah,0Ah,0Dh,0 str3 BYTE "Unable to find Source string in Target string.",0Ah,0Ah,0Dh,0 stop DWORD? enTarget DWORD? enSource DWORD? Dosition DWORD? code main PROC INVOKE Str_find ADDR target, ADDR source mov position.cax jz wasfound; ZF-1 indicates string found mov edx,OFFSET str3; string not found call WriteString jmp quit was found:; display message mov edx,OFFSET str1 call WriteString moveax position; write position value call WriteDec mov edx,OFFSET str2 call WriteString quit: exit nan ENDP Str_find PROC. [....] your code] Str_find ENDP

The input parameters should be a pointer to the source string and a pointer to the target string. If a match is found, the procedure sets the Zero flag and EAX points to the matching position in the target string. Otherwise, the Zero flag is clear and EAX is undefined. The following code, for example, searches for "SABC9" and returns with EAX pointing to the "5" in the target string: NCLUDE Irvine32.inc Str_find PROTO, pTarget:PTR BYTE, pSource:PTR BYTE data arget BYTE "01ABAAAAAABABCC45ABC9012",0 Source BYTE "SABC9",0 str1 BYTE "Source string found at position ",0 str2 BYTE" in Target string (counting from zero).",0Ah,0Ah,0Dh,0 str3 BYTE "Unable to find Source string in Target string.",0Ah,0Ah,0Dh,0 stop DWORD? enTarget DWORD? enSource DWORD? Dosition DWORD? code main PROC INVOKE Str_find ADDR target, ADDR source mov position.cax jz wasfound; ZF-1 indicates string found mov edx,OFFSET str3; string not found call WriteString jmp quit was found:; display message mov edx,OFFSET str1 call WriteString moveax position; write position value call WriteDec mov edx,OFFSET str2 call WriteString quit: exit nan ENDP Str_find PROC. [....] your code] Str_find ENDP

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter7: User-defined Simple Data Types, Namespaces, And The String Type

Section: Chapter Questions

Problem 8PE: Write a program that reads in a line consisting of a students name, Social Security number, user ID,...

See similar textbooks

Similar questions

Write a program that reads in a line consisting of a student’s name, Social Security number, user ID, and password. The program outputs the string in which all the digits of the Social Security number and all the characters in the password are replaced by x. (The Social Security number is in the form 000-00-0000, and the user ID and the password do not contain any spaces.) Your program should not use the operator [] to access a string element. Use the appropriate functions described in Table 7-1 below. Expression Effect strVar.at(index) Returns the element at the position specified by index strVar[index] Returns the element at the position specified by index strVar.append(n, ch) Appends n copies of ch to strVar, where ch is a char variable or a char constant strVar.append(str) Appends str to strVar strVar.clear() Deletes all the characters in strVar strVar.compare(str) Returns 1 if strVar > str returns 0 if strVar == str; returns −1 if strVar < str…
Task 2 Get Binary 1: Implement the get_bin_1 function as directed in the comment above the function. If the directions are unclear, run the code, and look at the expected answer for a few inputs. In order to be able to compare your solution to the answer, you cannot simply print out the binary directly to the console. Instead, you have been provided with a very rudimentary stringbuilder implementation that allows you to build a string one character at a time, without the ability to erase. There are comments at the top of the code explaining how to use the stringbuilder, however you could also see how it is being used in task_2_check. Note: if you create a stringbuilder and append ‘a’, ‘b’, then ‘c’, the resulting string will be “abc” when printed. You are free to read through the stringbuilder implementation, but it is quite complicated in order to make it easy to use. As specified in the comment, you may not use division (/) or mod (%) to implement this function (as the check…
Write a program that reads in a line consisting of a student’s name, Social Security number, user ID, and password. The program outputs the string in which all the digits of the Social Security number, and all the characters in the password are replaced by x. (The Social Security number is in the form 000- 00-0000, and the user ID and the password do not contain any spaces.) Your program should not use the operator [] to access a string element.
When the Split method of a string object is called with null as one of its arguments, what kind of characters are used as the delimiters?
Given string stringVal on one line, integer idxStart on a second line, and integer choiceLen on a third line, replace choiceLen characters with "1234", starting at index idxStart. Ex: If the input is: Fuzzy bear 3 4 then the output is: Fuz1234ear Note: Using a pre-defined string function, the solution can be just one line of code. #include <iostream>#include <string>using namespace std; int main() { string stringVal; int idxStart; int choiceLen; getline(cin, stringVal); cin >> idxStart; cin >> choiceLen; /* Your code goes here */ cout << stringVal << endl; return 0;}
Which of these methods of class String is used to check whether a substring exists at the beginning of the particular string? a) StartsWith() b) EndsWith() c) Starts() d) ends()
City and State. Extract the city name and state from strings like “Utica, NY” and “Los Angeles, CA”. Assume the state is always the last two characters in the string, the city name has at least one character, there is a comma following the city name, and a single space after the comma. Use the split method to separate the city name from the state (Notice the city name will still have a comma at the end). The following attachement is a sample execution:
public static String pancakeScramble(String text) This nifty little problem is taken from the excellent Wolfram Challenges problem site where you can also see examples of what the result should be for various arguments. Given a text string, construct a new string by reversing its first two characters, then reversing the first three characters of that, and so on, until the last round where you reverse your entire current string
DescriptionA researcher is analyzing DNA. A DNA can be represented as a string composed of the characters A, G, C, or T.One day, researchers found a strange DNA, which is Smooth Repeated DNA. The DNA is represented by a string that has infinite length. The string has a repeating pattern, i.e. the DNA string 0 is repeated an infinite number of times. For example, if0 = "????", then = "???????????? . . . ".According to researchers, a DNA is said to be special if it contains substrings . Determine whetheris a substring of . Squad FormatA line containing the two strings 0 and . Output FormatA line that determines whether it is a substring of . Issue “YES” ifis a substring of . Output “NO” otherwise. Example Input and Output Input Example Example Output AGCT GC YES AGCT TA YES AGCT GT No AGCT TAGCTAGCT YES AGGACCTA CTAA YES Explanation ExampleIn the first to fourth test case examples, is worth "???????????? . . . ". The part in bold is one of the…
True/False 7. The split method breaks a string into a list of substrings, and j oin does the opposite.
Edef reverse_sentence (s: str) -> str: Given a sentence , we define a word within to be a continuous sequence of characters in that starts with a capital letter and ends before the next capital letter in the string or at the end of the string, whichever comes first. A word can include a mixture of punctuation and spaces. This means that in the string 'ATest string!', there are in fact only two words: 'A' and 'Test string!'. Again, keep in mind that words start with a capital letter and continue until the next capital letter or the end of the string, which is why we consider 'Test string!' as one word. This function will reverse each word found in the string, and return a new string with the reversed words, as illustrated in the doctest below. >>> reverse_sentence('ATest string!') 'A!gnirts tseT' return
Read the string variables visitedListName, place1, place2, and place3 from input, assuming that the list's name contains multiple words and each place visited is a single word. The first input line contains the list's name and the second input line contains the places visited. Ex: If the input is: Countries I've visited Qatar Zambia Malta then the output is: Countries I've visited: Qatar Zambia Malta #include <iostream> #include <string> using namespace std; int main() { string visitedListName; string place1; string place2; string place3; /* Your code goes here */ cout << visitedListName << ":" << endl; cout << place1 << endl; cout << place2 << endl; cout << place3 << endl; return 0; }