With Demonstration Usage of callingmulti_find(some_string, sub_string, [ start] [,end]) with function definition likedef multi_find(some_string, sub_string, start = 0, end = -1): show the following result:# (b) Demonstrate usage3 = 'Mississippi'print (multi_find (s,'i'))print (multi_find (s, 'ss'))print (multi_find (s, 'pp'))print (multi_find (s, 'pp',3,8))print (multi_find (s, 'ss',3,8))if multi_find (s, 'i'):print ("Found 'i' in 'Mississippi'")else:print ("Didn't find 'i' in 'Mississippi'")if multi_find (s, 'zz'):print ("Found 'zz' in 'Mississippi' ")else:print ("Didn't find 'zz' in 'Mississippi'")With the result of:>>>[1, 4, 7, 10][2, 5][8][5]Found 'i' in 'Mississippi'Didn't find 'zz' in 'Mississippi' Prompt:Write a string function multi_find (some_string, sub_string, [,start] [,end])where start and end are optional arguements with default values for the start andend of some_string. The start and end are interpreted as they are in slicing, thatis:0 = start < index < end = len(some_string)a.) The program should return a list of indices of occurence of sub_string insome_string. If the substring is not found, return an empty list.b.) Demonstrate that your string function works and that you can use it in a Booleanexpression.End Prompt

Python used to answer this question

Answered: Write a string function multi_find…

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Similar questions

7. Given two lists A and B, write a function to compute the difference A – B, where A – B is the list of elements that are in A but not in B. For example, if A is '(6 7 8 9) and B is (7 9) then A – B is '(6 8).
Introduction In this lab, you are writing a function slashes_to_written(date_list) that gets the list in the [MM, DD, YYYY] format and displays it in a written format. Note: we are using the US format for strings: <MM>/<DD>/<YEAR>. For example, 01/02/2022 can be represented as ['01', '02', '2022'] represents January 2nd, 2022. Written Format slashes_to_written(["01", "01", "1970"]) must return "January 1, 1970" slashes_to_written(["02", "03", "2000"]) must return "February 3, 2000" slashes_to_written(["10", "15", "2022"]) must return "October 15, 2022" slashes_to_written(["12", "31", "2021"]) must return "December 31, 2021" Instructions Finish the slashes_to_written() function Use the dictionary month_names that maps months to their English names. month_names = { 1: "January", 2: "February", 3: "March" ... } Note: the month key in the dictionary is stored as an integer, however, in the list it is stored as a string in the MM format, e.g., "01". Also, pay attention…
struct insert_at_back_of_sll { // Function takes a constant Book as a parameter, inserts that book at the // back of a singly linked list, and returns nothing. void operator()(const Book& book) { /// TO-DO (3) /// // Write the lines of code to insert "book" at the back of "my_sll". Since // the SLL has no size() function and no tail pointer, you must walk the // list looking for the last node. // // HINT: Do not attempt to insert after "my_sll.end()". // ///// END-T0-DO (3) ||||// } std::forward_list& my_sll; };
Write a function sum_alt that takes a list of numbers zand calculates their alternating sum, defined as n-1 Σ(-1)+1 zk. k=0 Here Zo, Z1, Zn-1 denote the individual elements of the list.
Modify the swap_string function in this task6.c to swap two strings. task6.c Swapping string Only modify swap_string() function and swap_string() call in the main, nothing else should be changed. */ #include <stdio.h> #include <string.h> void swap_string(char *s1, char *s2){ char *tmp = s1; s1=s2; s2=tmp; return; } int main() { char *string1 = "UNIX rules!"; char *string2 = "Windows drools!"; swap_string(string1, string2); printf("String 1: %s\n", string1); printf("String 2: %s\n", string2); return0; }
Write a function called words_with_char() that takes two input parameters; a 2D-list of strings of any length (e.g., [['789', 'del'], ['a', 'do', ‘abc’], ['bb'], ['dcc']]) and a character c. This function returns a 1D-list that contains all the words in 2D-list that start with the character c. Sample run, >>> print( words_with_char( [['789', 'del'], ['a', 'd'], ['bb', 'do'], ['dcc'], ['dddd', 'duck'], ['efghi', 'd#$%^'], ['zzzzzzzzz']], ‘d’ )) ['del', 'd', 'do', 'dcc', 'dddd', 'duck', 'd#$%^']
The function list_combination takes two lists as arguments, list_one and list_two. Return from the function the combination of both lists - that is, a single list such that it alternately takes elements from both lists starting from list_one. You can assume that both list_one and list_two will be of equal lengths. As an example if list_one = [1,3,5] and if list_two = [2,4,6]. The function must return [1,2,3,4,5,6].
C++ code please: Create a generic functionprint_if(start, stop, condition, out)that prints to output stream out all the elements in the range[start,stop) that satisfy the unary predicate condition. The elements are printed on separate lines. The arguments start and stopare bidirectional iterators. Test your function by printing all the stringsmore than 3 characters long in some vector of strings
Write a function little_sum (number_list, limit) that returns the sum of only the numbers in number_list that are less than or equal to the given limit. In this question you must use a for loop and you are not allowed to use the sum function. For example: Test Result numbers = [1, 2, 3, 4, 5, 6] total = little_sum(numbers, 3) print(total) values = [6, 3, 4, 1, 5, 2] 10 total = little_sum(values, 4) print(total)
In c++ Please Write the InOrder() function, which receives a vector of integers as a parameter, and returns true if the numbers are sorted (in order from low to high) or false otherwise. The program outputs "In order" if the vector is sorted, or "Not in order" if the vector is not sorted. Ex: If the vector passed to the InOrder() function is [5, 6, 7, 8, 3], then the function returns false and the program outputs: Not in order Ex: If the vector passed to the InOrder() function is [5, 6, #include <iostream>#include <vector>using namespace std; bool InOrder(vector<int> nums) { /* Type your code here */} int main() { vector<int> nums1(5); nums1.at(0) = 5; nums1.at(1) = 6; nums1.at(2) = 7; nums1.at(3) = 8; nums1.at(4) = 3; if (InOrder(nums1)) { cout << "In order" << endl; } else { cout << "Not in order" << endl; } vector<int> nums2(5); nums2.at(0) = 5; nums2.at(1) = 6;…
Write a function definition named first_and_second that takes in sequence and returns the first and second value of that sequence as a list. This is in python Also assert, assert first_and_second([1, 2, 3, 4]) == [1, 2] assert first_and_second(["python", "is", "awesome"]) == ["python", "is"] assert first_and_second(["strawberry", "kiwi", "mango", "guava"]) == ["strawberry", "kiwi"]
Write a function called find_duplicates which accepts one list as a parameter. This function needs to sort through the list passed to it and find values that are duplicated in the list. The duplicated values should be compiled into another list which the function will return. No matter how many times a word is duplicated, it should only be added once to the duplicates list. NB: Only write the function. Do not call it. For example: Test Result random_words = ("remember","snakes","nappy","rough","dusty","judicious","brainy","shop","light","straw","quickest", "adventurous","yielding","grandiose","replace","fat","wipe","happy","brainy","shop","light","straw", "quickest","adventurous","yielding","grandiose","motion","gaudy","precede","medical","park","flowers", "noiseless","blade","hanging","whistle","event","slip") print(find_duplicates(sorted(random_words))) ['adventurous', 'brainy', 'grandiose', 'light', 'quickest', 'shop', 'straw', 'yielding']…

SEE MORE QUESTIONS

Recommended textbooks for you

Computer Networking: A Top-Down Approach (7th Edi…

Computer Engineering

ISBN:

9780133594140

Author:

James Kurose, Keith Ross

Publisher:

PEARSON

Computer Organization and Design MIPS Edition, Fi…

Computer Engineering

ISBN:

9780124077263

Author:

David A. Patterson, John L. Hennessy

Publisher:

Elsevier Science

Network+ Guide to Networks (MindTap Course List)

Computer Engineering

ISBN:

9781337569330

Author:

Jill West, Tamara Dean, Jean Andrews

Publisher:

Cengage Learning

Computer Networking: A Top-Down Approach (7th Edi…

Computer Engineering

ISBN:

9780133594140

Author:

James Kurose, Keith Ross

Publisher:

PEARSON

Computer Organization and Design MIPS Edition, Fi…

Computer Engineering

ISBN:

9780124077263

Author:

David A. Patterson, John L. Hennessy

Publisher:

Elsevier Science

Network+ Guide to Networks (MindTap Course List)

Computer Engineering

ISBN:

9781337569330

Author:

Jill West, Tamara Dean, Jean Andrews

Publisher:

Cengage Learning

Concepts of Database Management

Computer Engineering

ISBN:

9781337093422

Author:

Joy L. Starks, Philip J. Pratt, Mary Z. Last

Publisher:

Cengage Learning

Prelude to Programming

Computer Engineering

ISBN:

9780133750423

Author:

VENIT, Stewart

Publisher:

Pearson Education

Sc Business Data Communications and Networking, T…

Computer Engineering

ISBN:

9781119368830

Author:

FITZGERALD

Publisher:

WILEY

SEE MORE TEXTBOOKS