2. Write a function contains(s, c) that takes an arbitrary string s and a single-character c as inputs anduses recursion to determine if s contains the character c, returning True if it does and False if it doesnot.To force you to use recursion, you may not use the in operator. Rather, you should use recursion toprocess s one character at a time and determine if c is contained in s.For example:>> contains('hello', 'e')result: True>>> contains('hello', 'l')result: True>> contains('hello', 'x')result: False>> contains('', 'x')result: FalseWarningYour function should return a boolean value - either True or False, without any quotes around them.If you see quotes around the result when you make the calls above from the console, you must fix yourfunction to remove the quotes.Hint: You will need two base cases:a. one base case for the smallest possible input for the parameter sb. one base case for when the first character in the string is the one you are looking for; this case is a basecase because you don't need to reduce the problem any further in order to know what value to return.You must check for these base cases in the order given above. Otherwise, you can end up with an error! 1. Write a function add(vals1, vals2) that takesinputs two lists of numbers, vals1 and vals2, and thatuses recursion to construct and return a new list in which each element is the sum of the elements at thecorresponding positions in the original lists. For example:>>> add([1, 2, 3], [4, 5, 6])result: [5, 7, 9]Note that the elements in the result are obtained by adding the corresponding elements from the originallists (1+4, 2+5, and 3+6).Special cases: If the two lists do not have the same length or if either list is empty, the function shouldreturn an empty list ([]).Here are some other examples:>>> add([5, 3], [6, 4])result: [11, 7]>> add([1, 2, 3, 4], [20, 30, 50, 80])result: [21, 32, 53, 84]# lists with different lengths>>> add([5, 3], [6])result: []This function is somewhat similar to the replace function from lecture. That function recursively creates anew string from an existing string, whereas this function will recursively create a new list from two existinglists.Important: In the recursive case, when you use concatenation to build a larger list, make sure that both ofthe operands are lists. For example, if x is an integer and vals is a list, the following will produce an error:X + vals# error: cannot add an integer to a listInstead, you would need to turn x into a list before adding it:[x] + vals# correct!

Code 1: nlist = []def add(vals1,vals2):if len(vals1)==0 and len(vals2)==0:return []if len(vals1) !=…

ce you to use recursion, you may not use the in operator. Rather, you should use recur ss s one character at a time and determine if c is contained in s. kample: contains('hello', 'e') ult: True contains('hello', 'l') ult: True

ce you to use recursion, you may not use the in operator. Rather, you should use recur ss s one character at a time and determine if c is contained in s. kample: contains('hello', 'e') ult: True contains('hello', 'l') ult: True

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

Related questions

Q: Cs10 Quiz 1 100% Name Login 27. Implement the following RECURSIVE function named starString: //…

A: Given: To write a recursive function to print the function starString.

Q: are these two statements equivalent ptr -> name ( *ptr ).name

A: are these two statements equivalent ptr -> name ( *ptr ).name

Q: Write a function named strictly-increasing lst in Scheme that takes a list of integers and…

A: Algorithm: Step1: strictly_increasing takes list as parameter.Step2: Function has condition that…

Q: remove_substring_from_string(s, substr): This function takes two strings s and substr as input. It…

A: PROGRAM CODE: # start definition of function to remove substringdef remove_substring_from_string(s,…

Q: Problem 1: Recursion to Generator You worked with these last homework. For this homework, you'll…

A: In this problem, we are asked to write tail recursive, while loop, and generator implementations of…

Q: Write a recursive function named get_palindromes (words) that takes a list of words as a parameter.…

A: Coded using Python 3.

Q: C Programming practice gn Write a C program that takes a command line argument of a number that you…

A: Ans -- #include<stdio.h> #include<string.h> int factorial(int num) { if(num == 0)…

Q: Write a program that accepts a string and print the reversed form of that string using a pointer…

A: Program Approach:- 1. Include header file 2.Create the user-defined function whose name is…

Q: Code this in C Write a program that reads two matrices of integers. It then generates the sum,…

A: Solution:- About Matrix in C: A matrix is a rectangular array of numbers or symbols arranged in rows…

Q: Data Structures the hasBalancedParentheses () method. Note: this can be done both iteratively or…

A: NOTE: Only function is provided as per the question, and not the complete code. c++ function code:…

Question

2. Write a function contains(s, c) that takes an arbitrary string s and a single-character c as inputs and
uses recursion to determine if s contains the character c, returning True if it does and False if it does
not.
To force you to use recursion, you may not use the in operator. Rather, you should use recursion to
process s one character at a time and determine if c is contained in s.
For example:
>> contains('hello', 'e')
result: True
>>> contains('hello', 'l')
result: True
>> contains('hello', 'x')
result: False
>> contains('', 'x')
result: False
Warning
Your function should return a boolean value - either True or False, without any quotes around them.
If you see quotes around the result when you make the calls above from the console, you must fix your
function to remove the quotes.
Hint: You will need two base cases:
a. one base case for the smallest possible input for the parameter s
b. one base case for when the first character in the string is the one you are looking for; this case is a base
case because you don't need to reduce the problem any further in order to know what value to return.
You must check for these base cases in the order given above. Otherwise, you can end up with an error!

1. Write a function add(vals1, vals2) that takes
inputs two lists of numbers, vals1 and vals2, and that
uses recursion to construct and return a new list in which each element is the sum of the elements at the
corresponding positions in the original lists. For example:
>>> add([1, 2, 3], [4, 5, 6])
result: [5, 7, 9]
Note that the elements in the result are obtained by adding the corresponding elements from the original
lists (1+4, 2+5, and 3+6).
Special cases: If the two lists do not have the same length or if either list is empty, the function should
return an empty list ([]).
Here are some other examples:
>>> add([5, 3], [6, 4])
result: [11, 7]
>> add([1, 2, 3, 4], [20, 30, 50, 80])
result: [21, 32, 53, 84]
# lists with different lengths
>>> add([5, 3], [6])
result: []
This function is somewhat similar to the replace function from lecture. That function recursively creates a
new string from an existing string, whereas this function will recursively create a new list from two existing
lists.
Important: In the recursive case, when you use concatenation to build a larger list, make sure that both of
the operands are lists. For example, if x is an integer and vals is a list, the following will produce an error:
X + vals
# error: cannot add an integer to a list
Instead, you would need to turn x into a list before adding it:
[x] + vals
# correct!

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 2 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Similar questions

java prgm
C++ The binary search algorithm given in this chapter is nonrecursive. Write and implement a recursive version of the binary search algorithm. The program should prompt Y / y to continue searching and N / n to discontinue. If an item is found in the list display the following message: x found at position y else: x is not in the list Use the following list of integers when testing your program: 2, 6, 8, 13, 25, 33, 39, 42, 53, 58, 61, 68, 71, 84, 97
C++
Write a function named contains-double in Scheme that takes a list as input and returns true if an item every appears twice in a row. You may assume the list is flat (i.e., no nested lists).
Memory Management Programming Assignment Please if this can be coded in Java or C++ i would appreciate implement and test the GET-MEMORY algorithm This algorithm uses the Next-Fit(First-Fit-With-A-Roving-Pointer) technique. implement and test the FREE-MOMORY algorithm Implement the “GET_MEMORY” and “FREE_MEMORY” algorithms. Comprehensive testing must be done for each algorithm. Following are sample run results for each: GET_MEMORY IS RUNNING……… Initial FSB list FSB# Location Size 1 7 4 2 14 10 3 30 20 . . . . . . Rover is 14 ---------------------------------------------------------------------------- Allocation request for 5 words Allocation was successful Allocation was in location 14 FSB# Location Size 1 7 4 2 19 5 3 30 20 . . . . . . Rover is 30 ---------------------------------------------------------------------------- Allocation request for 150 words Allocation was not successful . . . __________________________________________________________ FREE_MEMORY…
L et D= { s, d, b}, E= { c, k}, G= { a, k }, U={a, b, c, d, k, s} DUE=