from surround import surroundinputs = [][]answers =L = ["tank", "godzilla", "tank"]["tank"]inputs.append (L)answers.append(a)a =TESTS len(inputs)passed = 0for i in range(TESTS):try:result = surround (inputs[i])if result not in answers[i]:print("Error found for input: " + str(inputs[i]))else:passed += 1except Exception:passresult = "Tests passed:+ str(passed) + "/" + str(TESTS)print(result) When Godzilla attacks a city, army units try to surround him to stop his rampage.to surround Godzilla the most often.It's useful to know which unit is ableWrite a function called surround () that accepts one parameter: a list of strings. Each string in the list will either bethe special value "godzilla", or the name of a unit.You may assume all strings are lower case.The value "godzilla" may occur in the list any number of times. Each time it appears, Godzilla is considered surrounded ifboth of the unit names IMMEDIATELY on either side of him in the list are the same.Note that Godzilla is not a unit, andtherefore cannot surround himself!The function should return the NAME of the unit that most frequently surrounds Godzilla. If there is a TIE, then it shouldreturn a single name from among those tied (it does not matter which). If no units ever surround Godzilla, it shouldreturn the empty string.For example:["tank", "godzilla", "tank"] should return "tank"["tank", "godzilla", "missile"] should return ""["godzilla", "tank"] should return ""

Surround.py #Function to get the unit_name#which has surrounded godzilla, else emptry stringdef…

Answered: inswers = %3D - ["tank", "godzilla",…

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

Write the definition of a recursive function int simpleSqrt(int n) The function returns the integer square root of n, meaning the biggest integer whose square is less than or equal to n. You may assume that the function is always called with a nonnegative value for n. Use the following algorithm: If n is 0 then return 0. Otherwise, call the function recursively with n-1 as the argument to get a number t. Check whether or not t+1 squared is strictly greater than n. Based on that test, return the correct result. For example, a call to simpleSqrt(8) would recursively call simpleSqrt(7) and get back 2 as the answer. Then we would square (2+1) = 3 to get 9. Since 9 is bigger than 8, we know that 3 is too big, so return 2 in this case. On the other hand a call to simpleSqrt(9) would recursively call simpleSqrt(8) and get back 2 as the answer. Again we would square (2+1) = 3 to get back 9. So 3 is the correct return value in this case.
Compute the sum of all elements of an array1. Describe the definition of recursive function Base case(s) Recursive case(s) 2. Write the code.
Q1 The periodic function sin⁡(2x) has multiple roots between x values of -5π and 5π. If xL = -15 and xU = 15, which of the following statements is true using a bracketed method? Select one: a. All roots will be returned b. The middle root will be returned c. The chosen bracket is invalid for bracketed methods d. A single root will be returned e. The algorithm will be stuck in an infinite loop Q2 Consider x and y to represent data points (xi,yi), where i = 1, 2, 3, … n. What is the length of pafter running the following command? p = polyval(x,y) Select one: a. n b. n - 1 c. n + 1 d. Empty variable e. 1 Q3 Consider a system of linear equations in the form of AX = B, where X is the unknown vector. Which of the following can be used to solve for X? Select one: a. X = A\B b. X = B./A c. X = inv(B)*A d. X = inv(A)./B e. X = B\A
2. Sum: a recursive function that computes the sum of integers 1, 2, 3, …., n for a given number n. So Sum(6) should return 1 + 2 + 3 + 4 + 5 + 6 , i.e. 21.sum(n) = n + sum(n-1)
Write a recursive function that returns both the smallest and the largest element in an int array. Also, write a program to test your function.
Which is the base case of the following recursion function: def mult3(n): if n == 1: return 3 else: return mult3(n-1) + 3 else n == 1 mult3(n) return mult3(n-1) + 3
Write a recursive function to print all the permutations of a string. For example, for the string abc, the printout is:abcacbbacbcacabcba(Hint: Define the following two functions. The second function is a helper function.def displayPermuation(s):def displayPermuationHelper(s1, s2): The first function simply invokes displayPermuation(" ", s). The secondfunction uses a loop to move a character from s2 to s1 and recursively invokes t with a new s1 and s2. The base case is that s2 is empty and prints s1 to the console.)Write a test program that prompts the user to enter a string and displays all its permutations.
Write a RECURSIVE function, without using any loops, that prints the contents of a matrix with 3 columns. The function should take the matrix and the number of rows as arguments. void print_matrix(int arr[][3], int num_rows);
8. Given this code: //This a code to determine the root of a function //The function is (cosx+2)/3 #include #include float root(float); int main() { float a[100],b[100],c=100.0; int i=1,j=0; b[0]=(cos(0)-3*0+1); printf("\nEnter a beginning guess:\n"); scanf ("%f",&a[0]); while(c>0.00001) { a[j+1]=root(a[j]); c=a[j+1]-a[j]; c=fabs(c); //fabs = Absolute Value of Floating-Point Number j++; } printf("\n The root of the given function is %f",a[j]); } float root(float x) {
Write a recursive function that displays a string reversely on the console using the following header: def reverseDisplay(value):For example, reverseDisplay("abcd") displays dcba. Write a test programthat prompts the user to enter a string and displays its reversal.
Write a recursive function that displays a string reversely on the console using the following header: void reverseDisplay(const string& s) For example, reverseDisplay("abcd") displays dcba. Write a test program that prompts the user to enter a string and displays its reversal.
Bum 0; for (int i = 1; i

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

inswers = %3D - ["tank", "godzilla", "tank"] ["tank"] nputs.append(L) answers.append(a) FESTS assed len(inputs)