Python functions Program plan: Define the function “count(myList,x)”, Returns the count of the given “x” value. Define the function “isin(myList,x)”, Returns “True”, if the value “x” is present in the list. Define the function “index(myList,x)”, Returns the index or position of the given “x” value. Define the function “reverse(myList)”, Return a new list consists of the elements which are reversed. Define the function “sort(myList)”, Return a new list consists of the elements which are sorted. Define the function “main()”, Create a list “myList” with the elements. Assign the value of “x”. Print the value return from “count(myList,x)”. Print the value return from “isin(myList,x)”. Print the value return from “index(myList,x)”. Print the value return from “reverse(myList)”. Print the value return from “sort(myList)”. Call the “main()” function.

Question

Want to see the full answer?

Answer 1

Question

Chapter 11, Problem 5PE

Program Plan Intro

Python functions

Program plan:

Define the function “count(myList,x)”,

Returns the count of the given “x” value.

Define the function “isin(myList,x)”,

Returns “True”, if the value “x” is present in the list.

Define the function “index(myList,x)”,

Returns the index or position of the given “x” value.

Define the function “reverse(myList)”,

Return a new list consists of the elements which are reversed.

Define the function “sort(myList)”,

Return a new list consists of the elements which are sorted.

Define the function “main()”,

Create a list “myList” with the elements.

Assign the value of “x”.

Print the value return from “count(myList,x)”.

Print the value return from “isin(myList,x)”.

Print the value return from “index(myList,x)”.

Print the value return from “reverse(myList)”.

Print the value return from “sort(myList)”.

Call the “main()” function.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

Write a recursive function named Multiply2 that multiples by 2 and prints each element in a given list. For example: mylist=[1,2,3,4] Multiply2(mylist) prints: 2 4 6 8 Note: the function takes only one parameter, which is the list on which the operation will be performed.

Assume that L is a list of Boolean values, True and False. Write a program in python with a function longestFalse(L) which returns a tuple (start, end) representing the start and end indices of the longest run of False values in L. If there is a tie, then return the first such run. For example, if L is False False True False False False False True True False False 0 1 2 3 4 5 6 7 8 9 10 then the function would return (3, 6), since the longest run of False is from 3 to 6.

Write a recursive function that finds the minimum value in an ArrayList. Your function signature should be public static int findMinimum(ArrayList<Integer>) One way to think of finding a minimum recursively is to think “the minimum number is either the last element in the ArrayList, or the minimum value in the rest of the ArrayList”. For example, if you have the ArrayList [1, 3, 2, 567, 23, 45, 9], the minimum value in this ArrayList is either 9 or the minimum value in [1, 3, 2, 567, 23, 45] Hint:The trick is to remove the last element each time to make the ArrayList a little shorter. import java.util.*; public class RecursiveMin{public static void main(String[] args){Scanner input = new Scanner(System.in);ArrayList<Integer> numbers = new ArrayList<Integer>();while (true){System.out.println("Please enter numbers. Enter -1 to quit: ");int number = input.nextInt();if (number == -1){break;}else {numbers.add(number);}} int minimum =…